/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-abd8500 [2020-01-16 18:30:44,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-01-16 18:30:44,814 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-01-16 18:30:44,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-01-16 18:30:44,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-01-16 18:30:44,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-01-16 18:30:44,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-01-16 18:30:44,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-01-16 18:30:44,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-01-16 18:30:44,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-01-16 18:30:44,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-01-16 18:30:44,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-01-16 18:30:44,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-01-16 18:30:44,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-01-16 18:30:44,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-01-16 18:30:44,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-01-16 18:30:44,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-01-16 18:30:44,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-01-16 18:30:44,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-01-16 18:30:44,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-01-16 18:30:44,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-01-16 18:30:44,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-01-16 18:30:44,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-01-16 18:30:44,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-01-16 18:30:44,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-01-16 18:30:44,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-01-16 18:30:44,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-01-16 18:30:44,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-01-16 18:30:44,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-01-16 18:30:44,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-01-16 18:30:44,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-01-16 18:30:44,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-01-16 18:30:44,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-01-16 18:30:44,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-01-16 18:30:44,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-01-16 18:30:44,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-01-16 18:30:44,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-01-16 18:30:44,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-01-16 18:30:44,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-01-16 18:30:44,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-01-16 18:30:44,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-01-16 18:30:44,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-01-16 18:30:44,900 INFO L113 SettingsManager]: Loading preferences was successful [2020-01-16 18:30:44,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-01-16 18:30:44,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-01-16 18:30:44,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-01-16 18:30:44,903 INFO L138 SettingsManager]: * Use SBE=true [2020-01-16 18:30:44,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-01-16 18:30:44,904 INFO L138 SettingsManager]: * sizeof long=4 [2020-01-16 18:30:44,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-01-16 18:30:44,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-01-16 18:30:44,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-01-16 18:30:44,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-01-16 18:30:44,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-01-16 18:30:44,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-01-16 18:30:44,907 INFO L138 SettingsManager]: * sizeof long double=12 [2020-01-16 18:30:44,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-01-16 18:30:44,907 INFO L138 SettingsManager]: * Use constant arrays=true [2020-01-16 18:30:44,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-01-16 18:30:44,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-01-16 18:30:44,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-01-16 18:30:44,908 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-01-16 18:30:44,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-01-16 18:30:44,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-01-16 18:30:44,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-01-16 18:30:44,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-01-16 18:30:44,909 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-01-16 18:30:44,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-01-16 18:30:44,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-01-16 18:30:44,910 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-01-16 18:30:44,910 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-01-16 18:30:45,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-01-16 18:30:45,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-01-16 18:30:45,241 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-01-16 18:30:45,243 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-01-16 18:30:45,243 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-01-16 18:30:45,244 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_6.bpl [2020-01-16 18:30:45,244 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_6.bpl' [2020-01-16 18:30:45,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-01-16 18:30:45,288 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-01-16 18:30:45,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-01-16 18:30:45,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-01-16 18:30:45,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-01-16 18:30:45,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:45" (1/1) ... [2020-01-16 18:30:45,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:45" (1/1) ... [2020-01-16 18:30:45,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-01-16 18:30:45,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-01-16 18:30:45,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-01-16 18:30:45,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-01-16 18:30:45,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:45" (1/1) ... [2020-01-16 18:30:45,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:45" (1/1) ... [2020-01-16 18:30:45,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:45" (1/1) ... [2020-01-16 18:30:45,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:45" (1/1) ... [2020-01-16 18:30:45,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:45" (1/1) ... [2020-01-16 18:30:45,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:45" (1/1) ... [2020-01-16 18:30:45,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:45" (1/1) ... [2020-01-16 18:30:45,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-01-16 18:30:45,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-01-16 18:30:45,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-01-16 18:30:45,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-01-16 18:30:45,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-01-16 18:30:45,433 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-01-16 18:30:45,434 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-01-16 18:30:45,434 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-01-16 18:30:45,436 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-01-16 18:30:45,436 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-01-16 18:30:45,436 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-01-16 18:30:45,437 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-01-16 18:30:45,437 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-01-16 18:30:45,437 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-01-16 18:30:45,437 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-01-16 18:30:45,438 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-01-16 18:30:45,438 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-01-16 18:30:45,438 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-01-16 18:30:45,438 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-01-16 18:30:45,438 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-01-16 18:30:45,439 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-01-16 18:30:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-01-16 18:30:45,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-01-16 18:30:45,439 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-01-16 18:30:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-01-16 18:30:45,440 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-01-16 18:30:45,441 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-01-16 18:30:45,629 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-01-16 18:30:45,629 INFO L287 CfgBuilder]: Removed 0 assume(true) statements. [2020-01-16 18:30:45,631 INFO L202 PluginConnector]: Adding new model example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.01 06:30:45 BoogieIcfgContainer [2020-01-16 18:30:45,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-01-16 18:30:45,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-01-16 18:30:45,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-01-16 18:30:45,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-01-16 18:30:45,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 06:30:45" (1/2) ... [2020-01-16 18:30:45,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7070e322 and model type example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.01 06:30:45, skipping insertion in model container [2020-01-16 18:30:45,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.01 06:30:45" (2/2) ... [2020-01-16 18:30:45,641 INFO L109 eAbstractionObserver]: Analyzing ICFG example_6.bpl [2020-01-16 18:30:45,652 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-01-16 18:30:45,652 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-01-16 18:30:45,660 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-01-16 18:30:45,661 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-01-16 18:30:45,802 INFO L250 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-01-16 18:30:45,826 INFO L374 AbstractCegarLoop]: Interprodecural is true [2020-01-16 18:30:45,827 INFO L375 AbstractCegarLoop]: Hoare is true [2020-01-16 18:30:45,827 INFO L376 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-01-16 18:30:45,827 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-01-16 18:30:45,828 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-01-16 18:30:45,828 INFO L379 AbstractCegarLoop]: Difference is false [2020-01-16 18:30:45,828 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-01-16 18:30:45,828 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-01-16 18:30:45,851 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 63 transitions [2020-01-16 18:30:45,854 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 52 places, 63 transitions [2020-01-16 18:30:46,058 INFO L129 PetriNetUnfolder]: 129/213 cut-off events. [2020-01-16 18:30:46,060 INFO L130 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2020-01-16 18:30:46,076 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-01-16 18:30:46,082 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 52 places, 63 transitions [2020-01-16 18:30:46,149 INFO L129 PetriNetUnfolder]: 129/213 cut-off events. [2020-01-16 18:30:46,149 INFO L130 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2020-01-16 18:30:46,153 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-01-16 18:30:46,158 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 780 [2020-01-16 18:30:46,160 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-01-16 18:30:46,302 INFO L206 etLargeBlockEncoding]: Checked pairs total: 225 [2020-01-16 18:30:46,302 INFO L214 etLargeBlockEncoding]: Total number of compositions: 7 [2020-01-16 18:30:46,306 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 56 transitions [2020-01-16 18:30:46,393 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 794 states. [2020-01-16 18:30:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states. [2020-01-16 18:30:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:46,422 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:46,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-01-16 18:30:46,425 INFO L426 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-01-16 18:30:46,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:46,433 INFO L82 PathProgramCache]: Analyzing trace with hash -773222054, now seen corresponding path program 1 times [2020-01-16 18:30:46,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:46,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040017045] [2020-01-16 18:30:46,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:46,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040017045] [2020-01-16 18:30:46,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:46,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:30:46,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609891816] [2020-01-16 18:30:46,599 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:30:46,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:46,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:30:46,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:30:46,617 INFO L87 Difference]: Start difference. First operand 794 states. Second operand 3 states. [2020-01-16 18:30:46,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:46,673 INFO L93 Difference]: Finished difference Result 602 states and 2198 transitions. [2020-01-16 18:30:46,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:30:46,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-01-16 18:30:46,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:46,704 INFO L225 Difference]: With dead ends: 602 [2020-01-16 18:30:46,705 INFO L226 Difference]: Without dead ends: 601 [2020-01-16 18:30:46,707 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:30:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-01-16 18:30:46,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2020-01-16 18:30:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2020-01-16 18:30:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 2197 transitions. [2020-01-16 18:30:46,827 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 2197 transitions. Word has length 19 [2020-01-16 18:30:46,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:46,828 INFO L478 AbstractCegarLoop]: Abstraction has 601 states and 2197 transitions. [2020-01-16 18:30:46,828 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:30:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 2197 transitions. [2020-01-16 18:30:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:46,831 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:46,831 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:46,832 INFO L426 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-01-16 18:30:46,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:46,832 INFO L82 PathProgramCache]: Analyzing trace with hash 969558490, now seen corresponding path program 1 times [2020-01-16 18:30:46,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:46,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521016913] [2020-01-16 18:30:46,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:46,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521016913] [2020-01-16 18:30:46,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:46,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:30:46,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854072750] [2020-01-16 18:30:46,863 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:30:46,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:46,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:30:46,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:30:46,864 INFO L87 Difference]: Start difference. First operand 601 states and 2197 transitions. Second operand 3 states. [2020-01-16 18:30:46,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:46,886 INFO L93 Difference]: Finished difference Result 417 states and 1445 transitions. [2020-01-16 18:30:46,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:30:46,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-01-16 18:30:46,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:46,890 INFO L225 Difference]: With dead ends: 417 [2020-01-16 18:30:46,890 INFO L226 Difference]: Without dead ends: 417 [2020-01-16 18:30:46,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:30:46,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-01-16 18:30:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2020-01-16 18:30:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-01-16 18:30:46,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1445 transitions. [2020-01-16 18:30:46,914 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1445 transitions. Word has length 19 [2020-01-16 18:30:46,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:46,914 INFO L478 AbstractCegarLoop]: Abstraction has 417 states and 1445 transitions. [2020-01-16 18:30:46,914 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:30:46,914 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1445 transitions. [2020-01-16 18:30:46,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:46,916 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:46,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-01-16 18:30:46,917 INFO L426 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-01-16 18:30:46,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:46,917 INFO L82 PathProgramCache]: Analyzing trace with hash 160210872, now seen corresponding path program 1 times [2020-01-16 18:30:46,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:46,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784200241] [2020-01-16 18:30:46,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:47,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784200241] [2020-01-16 18:30:47,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:47,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:47,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360315467] [2020-01-16 18:30:47,493 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:47,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:47,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:47,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:47,494 INFO L87 Difference]: Start difference. First operand 417 states and 1445 transitions. Second operand 8 states. [2020-01-16 18:30:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:47,631 INFO L93 Difference]: Finished difference Result 861 states and 2672 transitions. [2020-01-16 18:30:47,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:47,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:47,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:47,638 INFO L225 Difference]: With dead ends: 861 [2020-01-16 18:30:47,639 INFO L226 Difference]: Without dead ends: 823 [2020-01-16 18:30:47,639 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-01-16 18:30:47,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2020-01-16 18:30:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 447. [2020-01-16 18:30:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2020-01-16 18:30:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1541 transitions. [2020-01-16 18:30:47,668 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1541 transitions. Word has length 19 [2020-01-16 18:30:47,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:47,669 INFO L478 AbstractCegarLoop]: Abstraction has 447 states and 1541 transitions. [2020-01-16 18:30:47,669 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1541 transitions. [2020-01-16 18:30:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:47,672 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:47,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-01-16 18:30:47,673 INFO L426 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-01-16 18:30:47,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:47,673 INFO L82 PathProgramCache]: Analyzing trace with hash 534862058, now seen corresponding path program 2 times [2020-01-16 18:30:47,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:47,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955389127] [2020-01-16 18:30:47,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:48,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955389127] [2020-01-16 18:30:48,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:48,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:48,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438002507] [2020-01-16 18:30:48,097 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:48,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:48,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:48,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:48,098 INFO L87 Difference]: Start difference. First operand 447 states and 1541 transitions. Second operand 8 states. [2020-01-16 18:30:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:48,222 INFO L93 Difference]: Finished difference Result 871 states and 2699 transitions. [2020-01-16 18:30:48,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:48,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:48,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:48,229 INFO L225 Difference]: With dead ends: 871 [2020-01-16 18:30:48,230 INFO L226 Difference]: Without dead ends: 812 [2020-01-16 18:30:48,230 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-01-16 18:30:48,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-01-16 18:30:48,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 436. [2020-01-16 18:30:48,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-01-16 18:30:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1507 transitions. [2020-01-16 18:30:48,257 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1507 transitions. Word has length 19 [2020-01-16 18:30:48,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:48,257 INFO L478 AbstractCegarLoop]: Abstraction has 436 states and 1507 transitions. [2020-01-16 18:30:48,257 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:48,257 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1507 transitions. [2020-01-16 18:30:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:48,259 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:48,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-01-16 18:30:48,260 INFO L426 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-01-16 18:30:48,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:48,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1341600626, now seen corresponding path program 3 times [2020-01-16 18:30:48,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:48,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479666556] [2020-01-16 18:30:48,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:48,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479666556] [2020-01-16 18:30:48,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:48,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:48,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823714294] [2020-01-16 18:30:48,616 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:48,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:48,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:48,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:48,617 INFO L87 Difference]: Start difference. First operand 436 states and 1507 transitions. Second operand 8 states. [2020-01-16 18:30:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:48,713 INFO L93 Difference]: Finished difference Result 855 states and 2646 transitions. [2020-01-16 18:30:48,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:48,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:48,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:48,720 INFO L225 Difference]: With dead ends: 855 [2020-01-16 18:30:48,721 INFO L226 Difference]: Without dead ends: 817 [2020-01-16 18:30:48,721 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-01-16 18:30:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2020-01-16 18:30:48,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 445. [2020-01-16 18:30:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-01-16 18:30:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1528 transitions. [2020-01-16 18:30:48,745 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1528 transitions. Word has length 19 [2020-01-16 18:30:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:48,746 INFO L478 AbstractCegarLoop]: Abstraction has 445 states and 1528 transitions. [2020-01-16 18:30:48,746 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1528 transitions. [2020-01-16 18:30:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:48,748 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:48,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-01-16 18:30:48,748 INFO L426 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-01-16 18:30:48,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:48,749 INFO L82 PathProgramCache]: Analyzing trace with hash 365395876, now seen corresponding path program 4 times [2020-01-16 18:30:48,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:48,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037396129] [2020-01-16 18:30:48,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:49,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037396129] [2020-01-16 18:30:49,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:49,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:49,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708056344] [2020-01-16 18:30:49,011 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:49,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:49,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:49,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:49,012 INFO L87 Difference]: Start difference. First operand 445 states and 1528 transitions. Second operand 8 states. [2020-01-16 18:30:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:49,113 INFO L93 Difference]: Finished difference Result 861 states and 2662 transitions. [2020-01-16 18:30:49,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:49,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:49,119 INFO L225 Difference]: With dead ends: 861 [2020-01-16 18:30:49,120 INFO L226 Difference]: Without dead ends: 808 [2020-01-16 18:30:49,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:30:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2020-01-16 18:30:49,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 436. [2020-01-16 18:30:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-01-16 18:30:49,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1498 transitions. [2020-01-16 18:30:49,142 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1498 transitions. Word has length 19 [2020-01-16 18:30:49,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:49,143 INFO L478 AbstractCegarLoop]: Abstraction has 436 states and 1498 transitions. [2020-01-16 18:30:49,143 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:49,143 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1498 transitions. [2020-01-16 18:30:49,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:49,145 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:49,145 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:49,145 INFO L426 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-01-16 18:30:49,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:49,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1763599130, now seen corresponding path program 5 times [2020-01-16 18:30:49,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:49,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729927067] [2020-01-16 18:30:49,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:49,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729927067] [2020-01-16 18:30:49,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:49,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:49,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13822625] [2020-01-16 18:30:49,467 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:49,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:49,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:49,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:49,468 INFO L87 Difference]: Start difference. First operand 436 states and 1498 transitions. Second operand 8 states. [2020-01-16 18:30:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:49,687 INFO L93 Difference]: Finished difference Result 882 states and 2745 transitions. [2020-01-16 18:30:49,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:49,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:49,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:49,694 INFO L225 Difference]: With dead ends: 882 [2020-01-16 18:30:49,694 INFO L226 Difference]: Without dead ends: 834 [2020-01-16 18:30:49,695 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-01-16 18:30:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2020-01-16 18:30:49,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 452. [2020-01-16 18:30:49,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-01-16 18:30:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1546 transitions. [2020-01-16 18:30:49,718 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1546 transitions. Word has length 19 [2020-01-16 18:30:49,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:49,718 INFO L478 AbstractCegarLoop]: Abstraction has 452 states and 1546 transitions. [2020-01-16 18:30:49,718 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:49,719 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1546 transitions. [2020-01-16 18:30:49,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:49,721 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:49,721 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:49,721 INFO L426 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-01-16 18:30:49,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:49,722 INFO L82 PathProgramCache]: Analyzing trace with hash -905319246, now seen corresponding path program 6 times [2020-01-16 18:30:49,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:49,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121142026] [2020-01-16 18:30:49,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:49,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:49,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121142026] [2020-01-16 18:30:49,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:49,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:49,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72361616] [2020-01-16 18:30:49,982 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:49,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:49,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:49,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:49,983 INFO L87 Difference]: Start difference. First operand 452 states and 1546 transitions. Second operand 8 states. [2020-01-16 18:30:50,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:50,096 INFO L93 Difference]: Finished difference Result 878 states and 2717 transitions. [2020-01-16 18:30:50,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:50,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:50,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:50,103 INFO L225 Difference]: With dead ends: 878 [2020-01-16 18:30:50,103 INFO L226 Difference]: Without dead ends: 807 [2020-01-16 18:30:50,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:30:50,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2020-01-16 18:30:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 425. [2020-01-16 18:30:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-01-16 18:30:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1468 transitions. [2020-01-16 18:30:50,124 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1468 transitions. Word has length 19 [2020-01-16 18:30:50,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:50,124 INFO L478 AbstractCegarLoop]: Abstraction has 425 states and 1468 transitions. [2020-01-16 18:30:50,124 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:50,124 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1468 transitions. [2020-01-16 18:30:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:50,126 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:50,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:50,126 INFO L426 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-01-16 18:30:50,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:50,127 INFO L82 PathProgramCache]: Analyzing trace with hash 903297962, now seen corresponding path program 7 times [2020-01-16 18:30:50,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:50,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382129312] [2020-01-16 18:30:50,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:50,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:50,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382129312] [2020-01-16 18:30:50,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:50,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:50,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092814518] [2020-01-16 18:30:50,352 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:50,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:50,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:50,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:50,353 INFO L87 Difference]: Start difference. First operand 425 states and 1468 transitions. Second operand 8 states. [2020-01-16 18:30:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:50,438 INFO L93 Difference]: Finished difference Result 838 states and 2569 transitions. [2020-01-16 18:30:50,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:50,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:50,445 INFO L225 Difference]: With dead ends: 838 [2020-01-16 18:30:50,445 INFO L226 Difference]: Without dead ends: 800 [2020-01-16 18:30:50,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:30:50,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2020-01-16 18:30:50,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 442. [2020-01-16 18:30:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-01-16 18:30:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1513 transitions. [2020-01-16 18:30:50,466 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1513 transitions. Word has length 19 [2020-01-16 18:30:50,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:50,467 INFO L478 AbstractCegarLoop]: Abstraction has 442 states and 1513 transitions. [2020-01-16 18:30:50,467 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1513 transitions. [2020-01-16 18:30:50,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:50,469 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:50,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-01-16 18:30:50,470 INFO L426 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-01-16 18:30:50,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:50,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1277949148, now seen corresponding path program 8 times [2020-01-16 18:30:50,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:50,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289298128] [2020-01-16 18:30:50,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:50,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289298128] [2020-01-16 18:30:50,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:50,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:50,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60919815] [2020-01-16 18:30:50,759 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:50,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:50,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:50,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:50,760 INFO L87 Difference]: Start difference. First operand 442 states and 1513 transitions. Second operand 8 states. [2020-01-16 18:30:50,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:50,872 INFO L93 Difference]: Finished difference Result 848 states and 2596 transitions. [2020-01-16 18:30:50,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:50,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:50,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:50,878 INFO L225 Difference]: With dead ends: 848 [2020-01-16 18:30:50,878 INFO L226 Difference]: Without dead ends: 789 [2020-01-16 18:30:50,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:30:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2020-01-16 18:30:50,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 431. [2020-01-16 18:30:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-01-16 18:30:50,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1483 transitions. [2020-01-16 18:30:50,897 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1483 transitions. Word has length 19 [2020-01-16 18:30:50,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:50,897 INFO L478 AbstractCegarLoop]: Abstraction has 431 states and 1483 transitions. [2020-01-16 18:30:50,897 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1483 transitions. [2020-01-16 18:30:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:50,899 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:50,899 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:50,899 INFO L426 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-01-16 18:30:50,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:50,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1759091492, now seen corresponding path program 9 times [2020-01-16 18:30:50,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:50,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062763224] [2020-01-16 18:30:50,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:51,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-01-16 18:30:51,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062763224] [2020-01-16 18:30:51,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:51,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:51,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527639493] [2020-01-16 18:30:51,137 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:51,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:51,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:51,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:51,138 INFO L87 Difference]: Start difference. First operand 431 states and 1483 transitions. Second operand 8 states. [2020-01-16 18:30:51,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:51,233 INFO L93 Difference]: Finished difference Result 821 states and 2505 transitions. [2020-01-16 18:30:51,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:51,233 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:51,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:51,239 INFO L225 Difference]: With dead ends: 821 [2020-01-16 18:30:51,239 INFO L226 Difference]: Without dead ends: 783 [2020-01-16 18:30:51,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:30:51,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2020-01-16 18:30:51,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 436. [2020-01-16 18:30:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-01-16 18:30:51,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1492 transitions. [2020-01-16 18:30:51,259 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1492 transitions. Word has length 19 [2020-01-16 18:30:51,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:51,260 INFO L478 AbstractCegarLoop]: Abstraction has 436 states and 1492 transitions. [2020-01-16 18:30:51,260 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1492 transitions. [2020-01-16 18:30:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:51,262 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:51,262 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:51,262 INFO L426 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-01-16 18:30:51,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:51,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1008029398, now seen corresponding path program 10 times [2020-01-16 18:30:51,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:51,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706508407] [2020-01-16 18:30:51,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:51,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706508407] [2020-01-16 18:30:51,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:51,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:51,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540185671] [2020-01-16 18:30:51,488 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:51,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:51,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:51,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:51,488 INFO L87 Difference]: Start difference. First operand 436 states and 1492 transitions. Second operand 8 states. [2020-01-16 18:30:51,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:51,599 INFO L93 Difference]: Finished difference Result 820 states and 2499 transitions. [2020-01-16 18:30:51,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:51,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:51,605 INFO L225 Difference]: With dead ends: 820 [2020-01-16 18:30:51,606 INFO L226 Difference]: Without dead ends: 778 [2020-01-16 18:30:51,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:30:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2020-01-16 18:30:51,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 431. [2020-01-16 18:30:51,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-01-16 18:30:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1478 transitions. [2020-01-16 18:30:51,623 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1478 transitions. Word has length 19 [2020-01-16 18:30:51,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:51,623 INFO L478 AbstractCegarLoop]: Abstraction has 431 states and 1478 transitions. [2020-01-16 18:30:51,623 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:51,623 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1478 transitions. [2020-01-16 18:30:51,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:51,625 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:51,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-01-16 18:30:51,625 INFO L426 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-01-16 18:30:51,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:51,626 INFO L82 PathProgramCache]: Analyzing trace with hash -262091078, now seen corresponding path program 11 times [2020-01-16 18:30:51,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:51,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036739412] [2020-01-16 18:30:51,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:51,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036739412] [2020-01-16 18:30:51,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:51,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:51,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337137616] [2020-01-16 18:30:51,851 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:51,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:51,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:51,852 INFO L87 Difference]: Start difference. First operand 431 states and 1478 transitions. Second operand 8 states. [2020-01-16 18:30:51,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:51,931 INFO L93 Difference]: Finished difference Result 845 states and 2591 transitions. [2020-01-16 18:30:51,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:51,931 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:51,937 INFO L225 Difference]: With dead ends: 845 [2020-01-16 18:30:51,937 INFO L226 Difference]: Without dead ends: 797 [2020-01-16 18:30:51,938 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:30:51,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2020-01-16 18:30:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 440. [2020-01-16 18:30:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-01-16 18:30:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1500 transitions. [2020-01-16 18:30:51,956 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1500 transitions. Word has length 19 [2020-01-16 18:30:51,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:51,956 INFO L478 AbstractCegarLoop]: Abstraction has 440 states and 1500 transitions. [2020-01-16 18:30:51,956 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1500 transitions. [2020-01-16 18:30:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:51,958 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:51,958 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:51,959 INFO L426 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-01-16 18:30:51,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:51,959 INFO L82 PathProgramCache]: Analyzing trace with hash -262685724, now seen corresponding path program 12 times [2020-01-16 18:30:51,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:51,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841145565] [2020-01-16 18:30:51,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:52,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841145565] [2020-01-16 18:30:52,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:52,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:52,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100442618] [2020-01-16 18:30:52,182 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:52,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:52,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:52,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:52,183 INFO L87 Difference]: Start difference. First operand 440 states and 1500 transitions. Second operand 8 states. [2020-01-16 18:30:52,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:52,288 INFO L93 Difference]: Finished difference Result 834 states and 2544 transitions. [2020-01-16 18:30:52,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:52,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:52,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:52,292 INFO L225 Difference]: With dead ends: 834 [2020-01-16 18:30:52,292 INFO L226 Difference]: Without dead ends: 782 [2020-01-16 18:30:52,293 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:30:52,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2020-01-16 18:30:52,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 425. [2020-01-16 18:30:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-01-16 18:30:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1462 transitions. [2020-01-16 18:30:52,308 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1462 transitions. Word has length 19 [2020-01-16 18:30:52,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:52,308 INFO L478 AbstractCegarLoop]: Abstraction has 425 states and 1462 transitions. [2020-01-16 18:30:52,308 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1462 transitions. [2020-01-16 18:30:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:52,310 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:52,310 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:52,310 INFO L426 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-01-16 18:30:52,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:52,310 INFO L82 PathProgramCache]: Analyzing trace with hash -272531798, now seen corresponding path program 13 times [2020-01-16 18:30:52,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:52,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111123309] [2020-01-16 18:30:52,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:52,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111123309] [2020-01-16 18:30:52,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:52,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:52,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879161947] [2020-01-16 18:30:52,553 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:52,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:52,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:52,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:52,553 INFO L87 Difference]: Start difference. First operand 425 states and 1462 transitions. Second operand 8 states. [2020-01-16 18:30:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:52,629 INFO L93 Difference]: Finished difference Result 813 states and 2484 transitions. [2020-01-16 18:30:52,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:52,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:52,636 INFO L225 Difference]: With dead ends: 813 [2020-01-16 18:30:52,636 INFO L226 Difference]: Without dead ends: 775 [2020-01-16 18:30:52,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-01-16 18:30:52,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2020-01-16 18:30:52,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 435. [2020-01-16 18:30:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-01-16 18:30:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1490 transitions. [2020-01-16 18:30:52,656 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1490 transitions. Word has length 19 [2020-01-16 18:30:52,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:52,657 INFO L478 AbstractCegarLoop]: Abstraction has 435 states and 1490 transitions. [2020-01-16 18:30:52,657 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1490 transitions. [2020-01-16 18:30:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:52,659 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:52,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-01-16 18:30:52,659 INFO L426 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-01-16 18:30:52,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:52,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1023593892, now seen corresponding path program 14 times [2020-01-16 18:30:52,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:52,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502308734] [2020-01-16 18:30:52,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:52,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502308734] [2020-01-16 18:30:52,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:52,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:52,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351582499] [2020-01-16 18:30:52,917 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:52,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:52,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:52,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:52,918 INFO L87 Difference]: Start difference. First operand 435 states and 1490 transitions. Second operand 8 states. [2020-01-16 18:30:53,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:53,021 INFO L93 Difference]: Finished difference Result 812 states and 2478 transitions. [2020-01-16 18:30:53,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:53,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:53,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:53,028 INFO L225 Difference]: With dead ends: 812 [2020-01-16 18:30:53,028 INFO L226 Difference]: Without dead ends: 770 [2020-01-16 18:30:53,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-01-16 18:30:53,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2020-01-16 18:30:53,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 430. [2020-01-16 18:30:53,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-01-16 18:30:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1476 transitions. [2020-01-16 18:30:53,045 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1476 transitions. Word has length 19 [2020-01-16 18:30:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:53,045 INFO L478 AbstractCegarLoop]: Abstraction has 430 states and 1476 transitions. [2020-01-16 18:30:53,045 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1476 transitions. [2020-01-16 18:30:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:53,047 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:53,047 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:53,047 INFO L426 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-01-16 18:30:53,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:53,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1872969652, now seen corresponding path program 15 times [2020-01-16 18:30:53,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:53,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541774080] [2020-01-16 18:30:53,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:53,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541774080] [2020-01-16 18:30:53,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:53,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:53,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250599477] [2020-01-16 18:30:53,303 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:53,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:53,304 INFO L87 Difference]: Start difference. First operand 430 states and 1476 transitions. Second operand 8 states. [2020-01-16 18:30:53,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:53,375 INFO L93 Difference]: Finished difference Result 824 states and 2521 transitions. [2020-01-16 18:30:53,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:53,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:53,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:53,380 INFO L225 Difference]: With dead ends: 824 [2020-01-16 18:30:53,380 INFO L226 Difference]: Without dead ends: 786 [2020-01-16 18:30:53,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:30:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2020-01-16 18:30:53,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 439. [2020-01-16 18:30:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-01-16 18:30:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1497 transitions. [2020-01-16 18:30:53,397 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1497 transitions. Word has length 19 [2020-01-16 18:30:53,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:53,398 INFO L478 AbstractCegarLoop]: Abstraction has 439 states and 1497 transitions. [2020-01-16 18:30:53,398 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1497 transitions. [2020-01-16 18:30:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:53,399 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:53,399 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:53,400 INFO L426 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-01-16 18:30:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1445792894, now seen corresponding path program 16 times [2020-01-16 18:30:53,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:53,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625177157] [2020-01-16 18:30:53,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:53,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625177157] [2020-01-16 18:30:53,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:53,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:53,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348368066] [2020-01-16 18:30:53,628 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:53,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:53,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:53,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:53,629 INFO L87 Difference]: Start difference. First operand 439 states and 1497 transitions. Second operand 8 states. [2020-01-16 18:30:53,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:53,727 INFO L93 Difference]: Finished difference Result 830 states and 2537 transitions. [2020-01-16 18:30:53,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:53,727 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:53,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:53,731 INFO L225 Difference]: With dead ends: 830 [2020-01-16 18:30:53,732 INFO L226 Difference]: Without dead ends: 777 [2020-01-16 18:30:53,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-01-16 18:30:53,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2020-01-16 18:30:53,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 430. [2020-01-16 18:30:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-01-16 18:30:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1471 transitions. [2020-01-16 18:30:53,746 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1471 transitions. Word has length 19 [2020-01-16 18:30:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:53,747 INFO L478 AbstractCegarLoop]: Abstraction has 430 states and 1471 transitions. [2020-01-16 18:30:53,747 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:53,747 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1471 transitions. [2020-01-16 18:30:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:53,749 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:53,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-01-16 18:30:53,749 INFO L426 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-01-16 18:30:53,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1221170070, now seen corresponding path program 17 times [2020-01-16 18:30:53,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:53,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583519849] [2020-01-16 18:30:53,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:53,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-01-16 18:30:53,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583519849] [2020-01-16 18:30:53,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:53,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:53,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472082346] [2020-01-16 18:30:53,988 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:53,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:53,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:53,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:53,989 INFO L87 Difference]: Start difference. First operand 430 states and 1471 transitions. Second operand 8 states. [2020-01-16 18:30:54,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:54,096 INFO L93 Difference]: Finished difference Result 821 states and 2512 transitions. [2020-01-16 18:30:54,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:54,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:54,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:54,101 INFO L225 Difference]: With dead ends: 821 [2020-01-16 18:30:54,101 INFO L226 Difference]: Without dead ends: 784 [2020-01-16 18:30:54,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-01-16 18:30:54,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2020-01-16 18:30:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 438. [2020-01-16 18:30:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-01-16 18:30:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1491 transitions. [2020-01-16 18:30:54,115 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1491 transitions. Word has length 19 [2020-01-16 18:30:54,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:54,116 INFO L478 AbstractCegarLoop]: Abstraction has 438 states and 1491 transitions. [2020-01-16 18:30:54,116 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1491 transitions. [2020-01-16 18:30:54,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:54,117 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:54,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-01-16 18:30:54,118 INFO L426 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-01-16 18:30:54,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:54,118 INFO L82 PathProgramCache]: Analyzing trace with hash -362295540, now seen corresponding path program 18 times [2020-01-16 18:30:54,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:54,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502964653] [2020-01-16 18:30:54,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:54,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502964653] [2020-01-16 18:30:54,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:54,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:54,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451698410] [2020-01-16 18:30:54,424 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:54,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:54,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:54,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:54,425 INFO L87 Difference]: Start difference. First operand 438 states and 1491 transitions. Second operand 8 states. [2020-01-16 18:30:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:54,527 INFO L93 Difference]: Finished difference Result 828 states and 2530 transitions. [2020-01-16 18:30:54,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:54,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:54,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:54,531 INFO L225 Difference]: With dead ends: 828 [2020-01-16 18:30:54,532 INFO L226 Difference]: Without dead ends: 771 [2020-01-16 18:30:54,532 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-01-16 18:30:54,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2020-01-16 18:30:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 425. [2020-01-16 18:30:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-01-16 18:30:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1457 transitions. [2020-01-16 18:30:54,547 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1457 transitions. Word has length 19 [2020-01-16 18:30:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:54,547 INFO L478 AbstractCegarLoop]: Abstraction has 425 states and 1457 transitions. [2020-01-16 18:30:54,547 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1457 transitions. [2020-01-16 18:30:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:54,549 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:54,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-01-16 18:30:54,549 INFO L426 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-01-16 18:30:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1500056126, now seen corresponding path program 19 times [2020-01-16 18:30:54,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:54,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249942596] [2020-01-16 18:30:54,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:54,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249942596] [2020-01-16 18:30:54,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:54,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:54,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384378299] [2020-01-16 18:30:54,796 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:54,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:54,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:54,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:54,797 INFO L87 Difference]: Start difference. First operand 425 states and 1457 transitions. Second operand 8 states. [2020-01-16 18:30:54,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:54,881 INFO L93 Difference]: Finished difference Result 861 states and 2675 transitions. [2020-01-16 18:30:54,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:54,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:54,886 INFO L225 Difference]: With dead ends: 861 [2020-01-16 18:30:54,887 INFO L226 Difference]: Without dead ends: 813 [2020-01-16 18:30:54,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-01-16 18:30:54,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2020-01-16 18:30:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 442. [2020-01-16 18:30:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-01-16 18:30:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1515 transitions. [2020-01-16 18:30:54,902 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1515 transitions. Word has length 19 [2020-01-16 18:30:54,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:54,903 INFO L478 AbstractCegarLoop]: Abstraction has 442 states and 1515 transitions. [2020-01-16 18:30:54,903 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:54,903 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1515 transitions. [2020-01-16 18:30:54,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:54,904 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:54,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-01-16 18:30:54,905 INFO L426 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-01-16 18:30:54,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:54,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1499461480, now seen corresponding path program 20 times [2020-01-16 18:30:54,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:54,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784706552] [2020-01-16 18:30:54,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:55,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784706552] [2020-01-16 18:30:55,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:55,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:55,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469592600] [2020-01-16 18:30:55,116 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:55,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:55,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:55,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:55,117 INFO L87 Difference]: Start difference. First operand 442 states and 1515 transitions. Second operand 8 states. [2020-01-16 18:30:55,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:55,208 INFO L93 Difference]: Finished difference Result 850 states and 2628 transitions. [2020-01-16 18:30:55,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:55,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:55,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:55,214 INFO L225 Difference]: With dead ends: 850 [2020-01-16 18:30:55,214 INFO L226 Difference]: Without dead ends: 804 [2020-01-16 18:30:55,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:30:55,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2020-01-16 18:30:55,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 433. [2020-01-16 18:30:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2020-01-16 18:30:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1485 transitions. [2020-01-16 18:30:55,234 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1485 transitions. Word has length 19 [2020-01-16 18:30:55,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:55,234 INFO L478 AbstractCegarLoop]: Abstraction has 433 states and 1485 transitions. [2020-01-16 18:30:55,234 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:55,234 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1485 transitions. [2020-01-16 18:30:55,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:55,236 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:55,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-01-16 18:30:55,236 INFO L426 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-01-16 18:30:55,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:55,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1939604516, now seen corresponding path program 21 times [2020-01-16 18:30:55,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:55,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809882225] [2020-01-16 18:30:55,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30: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-01-16 18:30:55,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809882225] [2020-01-16 18:30:55,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:55,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:55,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597250376] [2020-01-16 18:30:55,477 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:55,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:55,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:55,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:55,478 INFO L87 Difference]: Start difference. First operand 433 states and 1485 transitions. Second operand 8 states. [2020-01-16 18:30:55,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:55,600 INFO L93 Difference]: Finished difference Result 875 states and 2726 transitions. [2020-01-16 18:30:55,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:55,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:55,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:55,604 INFO L225 Difference]: With dead ends: 875 [2020-01-16 18:30:55,604 INFO L226 Difference]: Without dead ends: 827 [2020-01-16 18:30:55,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-01-16 18:30:55,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2020-01-16 18:30:55,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 449. [2020-01-16 18:30:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2020-01-16 18:30:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1533 transitions. [2020-01-16 18:30:55,642 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1533 transitions. Word has length 19 [2020-01-16 18:30:55,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:55,642 INFO L478 AbstractCegarLoop]: Abstraction has 449 states and 1533 transitions. [2020-01-16 18:30:55,642 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:55,642 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1533 transitions. [2020-01-16 18:30:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:55,643 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:55,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-01-16 18:30:55,644 INFO L426 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-01-16 18:30:55,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:55,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1081324632, now seen corresponding path program 22 times [2020-01-16 18:30:55,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:55,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441339712] [2020-01-16 18:30:55,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:55,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-01-16 18:30:55,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441339712] [2020-01-16 18:30:55,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:55,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:55,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25108213] [2020-01-16 18:30:55,869 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:55,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:55,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:55,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:55,870 INFO L87 Difference]: Start difference. First operand 449 states and 1533 transitions. Second operand 8 states. [2020-01-16 18:30:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:55,957 INFO L93 Difference]: Finished difference Result 871 states and 2698 transitions. [2020-01-16 18:30:55,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:55,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:55,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:55,961 INFO L225 Difference]: With dead ends: 871 [2020-01-16 18:30:55,962 INFO L226 Difference]: Without dead ends: 811 [2020-01-16 18:30:55,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:30:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-01-16 18:30:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 433. [2020-01-16 18:30:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2020-01-16 18:30:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1477 transitions. [2020-01-16 18:30:55,974 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1477 transitions. Word has length 19 [2020-01-16 18:30:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:55,975 INFO L478 AbstractCegarLoop]: Abstraction has 433 states and 1477 transitions. [2020-01-16 18:30:55,975 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:55,975 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1477 transitions. [2020-01-16 18:30:55,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:55,976 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:55,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-01-16 18:30:55,976 INFO L426 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-01-16 18:30:55,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:55,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1958633188, now seen corresponding path program 23 times [2020-01-16 18:30:55,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:55,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45686060] [2020-01-16 18:30:55,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:56,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45686060] [2020-01-16 18:30:56,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:56,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:56,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221403522] [2020-01-16 18:30:56,206 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:56,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:56,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:56,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:56,207 INFO L87 Difference]: Start difference. First operand 433 states and 1477 transitions. Second operand 8 states. [2020-01-16 18:30:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:56,292 INFO L93 Difference]: Finished difference Result 845 states and 2606 transitions. [2020-01-16 18:30:56,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:56,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:56,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:56,295 INFO L225 Difference]: With dead ends: 845 [2020-01-16 18:30:56,296 INFO L226 Difference]: Without dead ends: 808 [2020-01-16 18:30:56,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:30:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2020-01-16 18:30:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 441. [2020-01-16 18:30:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-01-16 18:30:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1497 transitions. [2020-01-16 18:30:56,311 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1497 transitions. Word has length 19 [2020-01-16 18:30:56,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:56,312 INFO L478 AbstractCegarLoop]: Abstraction has 441 states and 1497 transitions. [2020-01-16 18:30:56,312 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1497 transitions. [2020-01-16 18:30:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:56,313 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:56,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-01-16 18:30:56,314 INFO L426 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-01-16 18:30:56,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:56,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1099758658, now seen corresponding path program 24 times [2020-01-16 18:30:56,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:56,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123892658] [2020-01-16 18:30:56,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:56,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123892658] [2020-01-16 18:30:56,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:56,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:56,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688500166] [2020-01-16 18:30:56,535 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:56,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:56,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:56,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:56,536 INFO L87 Difference]: Start difference. First operand 441 states and 1497 transitions. Second operand 8 states. [2020-01-16 18:30:56,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:56,616 INFO L93 Difference]: Finished difference Result 852 states and 2624 transitions. [2020-01-16 18:30:56,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:56,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:56,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:56,620 INFO L225 Difference]: With dead ends: 852 [2020-01-16 18:30:56,620 INFO L226 Difference]: Without dead ends: 784 [2020-01-16 18:30:56,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-01-16 18:30:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2020-01-16 18:30:56,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 417. [2020-01-16 18:30:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-01-16 18:30:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1439 transitions. [2020-01-16 18:30:56,633 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1439 transitions. Word has length 19 [2020-01-16 18:30:56,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:56,633 INFO L478 AbstractCegarLoop]: Abstraction has 417 states and 1439 transitions. [2020-01-16 18:30:56,633 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:56,633 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1439 transitions. [2020-01-16 18:30:56,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:56,634 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:56,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-01-16 18:30:56,634 INFO L426 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-01-16 18:30:56,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:56,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1228367856, now seen corresponding path program 25 times [2020-01-16 18:30:56,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:56,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020409967] [2020-01-16 18:30:56,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:56,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020409967] [2020-01-16 18:30:56,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:56,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:56,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606226963] [2020-01-16 18:30:56,921 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:56,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:56,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:56,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:56,922 INFO L87 Difference]: Start difference. First operand 417 states and 1439 transitions. Second operand 8 states. [2020-01-16 18:30:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:56,986 INFO L93 Difference]: Finished difference Result 860 states and 2665 transitions. [2020-01-16 18:30:56,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:56,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:56,990 INFO L225 Difference]: With dead ends: 860 [2020-01-16 18:30:56,990 INFO L226 Difference]: Without dead ends: 822 [2020-01-16 18:30:56,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-01-16 18:30:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2020-01-16 18:30:57,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 446. [2020-01-16 18:30:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-01-16 18:30:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1534 transitions. [2020-01-16 18:30:57,006 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1534 transitions. Word has length 19 [2020-01-16 18:30:57,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:57,006 INFO L478 AbstractCegarLoop]: Abstraction has 446 states and 1534 transitions. [2020-01-16 18:30:57,006 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1534 transitions. [2020-01-16 18:30:57,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:57,007 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:57,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-01-16 18:30:57,008 INFO L426 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-01-16 18:30:57,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:57,009 INFO L82 PathProgramCache]: Analyzing trace with hash -853716670, now seen corresponding path program 26 times [2020-01-16 18:30:57,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:57,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228790116] [2020-01-16 18:30:57,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:57,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228790116] [2020-01-16 18:30:57,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:57,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:57,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339822812] [2020-01-16 18:30:57,303 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:57,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:57,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:57,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:57,303 INFO L87 Difference]: Start difference. First operand 446 states and 1534 transitions. Second operand 8 states. [2020-01-16 18:30:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:57,381 INFO L93 Difference]: Finished difference Result 870 states and 2692 transitions. [2020-01-16 18:30:57,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:57,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:57,384 INFO L225 Difference]: With dead ends: 870 [2020-01-16 18:30:57,384 INFO L226 Difference]: Without dead ends: 811 [2020-01-16 18:30:57,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-01-16 18:30:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-01-16 18:30:57,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 435. [2020-01-16 18:30:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-01-16 18:30:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1500 transitions. [2020-01-16 18:30:57,399 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1500 transitions. Word has length 19 [2020-01-16 18:30:57,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:57,400 INFO L478 AbstractCegarLoop]: Abstraction has 435 states and 1500 transitions. [2020-01-16 18:30:57,400 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1500 transitions. [2020-01-16 18:30:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:57,401 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:57,401 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:57,401 INFO L426 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-01-16 18:30:57,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:57,402 INFO L82 PathProgramCache]: Analyzing trace with hash -46978102, now seen corresponding path program 27 times [2020-01-16 18:30:57,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:57,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987878216] [2020-01-16 18:30:57,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:57,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987878216] [2020-01-16 18:30:57,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:57,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:57,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195628542] [2020-01-16 18:30:57,624 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:57,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:57,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:57,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:57,624 INFO L87 Difference]: Start difference. First operand 435 states and 1500 transitions. Second operand 8 states. [2020-01-16 18:30:57,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:57,698 INFO L93 Difference]: Finished difference Result 854 states and 2639 transitions. [2020-01-16 18:30:57,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:57,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:57,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:57,701 INFO L225 Difference]: With dead ends: 854 [2020-01-16 18:30:57,701 INFO L226 Difference]: Without dead ends: 816 [2020-01-16 18:30:57,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-01-16 18:30:57,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2020-01-16 18:30:57,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 444. [2020-01-16 18:30:57,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-01-16 18:30:57,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1521 transitions. [2020-01-16 18:30:57,715 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1521 transitions. Word has length 19 [2020-01-16 18:30:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:57,716 INFO L478 AbstractCegarLoop]: Abstraction has 444 states and 1521 transitions. [2020-01-16 18:30:57,716 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1521 transitions. [2020-01-16 18:30:57,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:57,717 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:57,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-01-16 18:30:57,717 INFO L426 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-01-16 18:30:57,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:57,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1023182852, now seen corresponding path program 28 times [2020-01-16 18:30:57,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:57,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160158778] [2020-01-16 18:30:57,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:57,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160158778] [2020-01-16 18:30:57,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:57,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:57,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959485716] [2020-01-16 18:30:57,953 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:57,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:57,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:57,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:57,954 INFO L87 Difference]: Start difference. First operand 444 states and 1521 transitions. Second operand 8 states. [2020-01-16 18:30:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:58,037 INFO L93 Difference]: Finished difference Result 860 states and 2655 transitions. [2020-01-16 18:30:58,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:58,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:58,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:58,041 INFO L225 Difference]: With dead ends: 860 [2020-01-16 18:30:58,041 INFO L226 Difference]: Without dead ends: 807 [2020-01-16 18:30:58,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-01-16 18:30:58,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2020-01-16 18:30:58,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 435. [2020-01-16 18:30:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-01-16 18:30:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1491 transitions. [2020-01-16 18:30:58,056 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1491 transitions. Word has length 19 [2020-01-16 18:30:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:58,056 INFO L478 AbstractCegarLoop]: Abstraction has 435 states and 1491 transitions. [2020-01-16 18:30:58,056 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1491 transitions. [2020-01-16 18:30:58,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:58,057 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:58,058 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:58,058 INFO L426 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-01-16 18:30:58,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:58,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1142789438, now seen corresponding path program 29 times [2020-01-16 18:30:58,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:58,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470344449] [2020-01-16 18:30:58,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:58,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470344449] [2020-01-16 18:30:58,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:58,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:58,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435935256] [2020-01-16 18:30:58,301 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:58,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:58,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:58,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:58,302 INFO L87 Difference]: Start difference. First operand 435 states and 1491 transitions. Second operand 8 states. [2020-01-16 18:30:58,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:58,379 INFO L93 Difference]: Finished difference Result 881 states and 2738 transitions. [2020-01-16 18:30:58,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:58,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:58,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:58,382 INFO L225 Difference]: With dead ends: 881 [2020-01-16 18:30:58,382 INFO L226 Difference]: Without dead ends: 833 [2020-01-16 18:30:58,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:30:58,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2020-01-16 18:30:58,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 451. [2020-01-16 18:30:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2020-01-16 18:30:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1539 transitions. [2020-01-16 18:30:58,397 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1539 transitions. Word has length 19 [2020-01-16 18:30:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:58,398 INFO L478 AbstractCegarLoop]: Abstraction has 451 states and 1539 transitions. [2020-01-16 18:30:58,398 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1539 transitions. [2020-01-16 18:30:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:58,399 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:58,400 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:58,400 INFO L426 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-01-16 18:30:58,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:58,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2001069322, now seen corresponding path program 30 times [2020-01-16 18:30:58,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:58,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507912030] [2020-01-16 18:30:58,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:58,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507912030] [2020-01-16 18:30:58,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:58,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:58,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268882745] [2020-01-16 18:30:58,601 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:58,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:58,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:58,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:58,602 INFO L87 Difference]: Start difference. First operand 451 states and 1539 transitions. Second operand 8 states. [2020-01-16 18:30:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:58,684 INFO L93 Difference]: Finished difference Result 877 states and 2710 transitions. [2020-01-16 18:30:58,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:58,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:58,686 INFO L225 Difference]: With dead ends: 877 [2020-01-16 18:30:58,687 INFO L226 Difference]: Without dead ends: 806 [2020-01-16 18:30:58,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-01-16 18:30:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2020-01-16 18:30:58,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 424. [2020-01-16 18:30:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-01-16 18:30:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1461 transitions. [2020-01-16 18:30:58,705 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1461 transitions. Word has length 19 [2020-01-16 18:30:58,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:58,705 INFO L478 AbstractCegarLoop]: Abstraction has 424 states and 1461 transitions. [2020-01-16 18:30:58,705 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:58,705 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1461 transitions. [2020-01-16 18:30:58,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:58,707 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:58,707 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:58,707 INFO L426 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-01-16 18:30:58,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:58,708 INFO L82 PathProgramCache]: Analyzing trace with hash 784001922, now seen corresponding path program 31 times [2020-01-16 18:30:58,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:58,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240604442] [2020-01-16 18:30:58,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:58,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-01-16 18:30:58,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240604442] [2020-01-16 18:30:58,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:58,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:58,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427334029] [2020-01-16 18:30:58,949 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:58,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:58,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:58,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:58,950 INFO L87 Difference]: Start difference. First operand 424 states and 1461 transitions. Second operand 8 states. [2020-01-16 18:30:59,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:59,017 INFO L93 Difference]: Finished difference Result 837 states and 2562 transitions. [2020-01-16 18:30:59,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:59,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:59,020 INFO L225 Difference]: With dead ends: 837 [2020-01-16 18:30:59,020 INFO L226 Difference]: Without dead ends: 799 [2020-01-16 18:30:59,021 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:30:59,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2020-01-16 18:30:59,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 441. [2020-01-16 18:30:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-01-16 18:30:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1506 transitions. [2020-01-16 18:30:59,033 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1506 transitions. Word has length 19 [2020-01-16 18:30:59,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:59,034 INFO L478 AbstractCegarLoop]: Abstraction has 441 states and 1506 transitions. [2020-01-16 18:30:59,034 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:59,034 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1506 transitions. [2020-01-16 18:30:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:59,035 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:59,035 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:59,036 INFO L426 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-01-16 18:30:59,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:59,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1158653108, now seen corresponding path program 32 times [2020-01-16 18:30:59,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:59,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29810860] [2020-01-16 18:30:59,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:59,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29810860] [2020-01-16 18:30:59,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:59,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:59,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895425543] [2020-01-16 18:30:59,261 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:59,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:59,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:59,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:59,261 INFO L87 Difference]: Start difference. First operand 441 states and 1506 transitions. Second operand 8 states. [2020-01-16 18:30:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:59,354 INFO L93 Difference]: Finished difference Result 847 states and 2589 transitions. [2020-01-16 18:30:59,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:59,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:59,356 INFO L225 Difference]: With dead ends: 847 [2020-01-16 18:30:59,357 INFO L226 Difference]: Without dead ends: 788 [2020-01-16 18:30:59,357 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:30:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2020-01-16 18:30:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 430. [2020-01-16 18:30:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-01-16 18:30:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1476 transitions. [2020-01-16 18:30:59,370 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1476 transitions. Word has length 19 [2020-01-16 18:30:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:59,370 INFO L478 AbstractCegarLoop]: Abstraction has 430 states and 1476 transitions. [2020-01-16 18:30:59,370 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1476 transitions. [2020-01-16 18:30:59,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:59,371 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:59,371 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:59,371 INFO L426 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-01-16 18:30:59,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:59,371 INFO L82 PathProgramCache]: Analyzing trace with hash 988603004, now seen corresponding path program 33 times [2020-01-16 18:30:59,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:59,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461605215] [2020-01-16 18:30:59,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:59,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461605215] [2020-01-16 18:30:59,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:59,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:59,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372082793] [2020-01-16 18:30:59,568 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:59,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:59,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:59,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:59,568 INFO L87 Difference]: Start difference. First operand 430 states and 1476 transitions. Second operand 8 states. [2020-01-16 18:30:59,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:59,633 INFO L93 Difference]: Finished difference Result 820 states and 2498 transitions. [2020-01-16 18:30:59,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:59,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:59,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:59,635 INFO L225 Difference]: With dead ends: 820 [2020-01-16 18:30:59,636 INFO L226 Difference]: Without dead ends: 782 [2020-01-16 18:30:59,636 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-01-16 18:30:59,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2020-01-16 18:30:59,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 435. [2020-01-16 18:30:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-01-16 18:30:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1485 transitions. [2020-01-16 18:30:59,647 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1485 transitions. Word has length 19 [2020-01-16 18:30:59,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:59,647 INFO L478 AbstractCegarLoop]: Abstraction has 435 states and 1485 transitions. [2020-01-16 18:30:59,647 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:59,647 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1485 transitions. [2020-01-16 18:30:59,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:59,648 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:59,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-01-16 18:30:59,649 INFO L426 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-01-16 18:30:59,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:59,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1865254260, now seen corresponding path program 1 times [2020-01-16 18:30:59,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:59,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648868007] [2020-01-16 18:30:59,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:59,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-01-16 18:30:59,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648868007] [2020-01-16 18:30:59,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:59,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:30:59,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720061072] [2020-01-16 18:30:59,672 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:30:59,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:59,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:30:59,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:30:59,672 INFO L87 Difference]: Start difference. First operand 435 states and 1485 transitions. Second operand 3 states. [2020-01-16 18:30:59,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:59,677 INFO L93 Difference]: Finished difference Result 349 states and 1112 transitions. [2020-01-16 18:30:59,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:30:59,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-01-16 18:30:59,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:59,678 INFO L225 Difference]: With dead ends: 349 [2020-01-16 18:30:59,678 INFO L226 Difference]: Without dead ends: 349 [2020-01-16 18:30:59,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:30:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-01-16 18:30:59,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2020-01-16 18:30:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:30:59,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1112 transitions. [2020-01-16 18:30:59,688 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1112 transitions. Word has length 19 [2020-01-16 18:30:59,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:59,688 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1112 transitions. [2020-01-16 18:30:59,688 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:30:59,688 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1112 transitions. [2020-01-16 18:30:59,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:59,689 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:59,689 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:30:59,690 INFO L426 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-01-16 18:30:59,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:59,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1163123542, now seen corresponding path program 34 times [2020-01-16 18:30:59,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:59,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132463368] [2020-01-16 18:30:59,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:30:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:30:59,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132463368] [2020-01-16 18:30:59,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:30:59,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:30:59,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052591856] [2020-01-16 18:30:59,891 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:30:59,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:30:59,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:30:59,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:30:59,892 INFO L87 Difference]: Start difference. First operand 349 states and 1112 transitions. Second operand 8 states. [2020-01-16 18:30:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:30:59,975 INFO L93 Difference]: Finished difference Result 644 states and 1770 transitions. [2020-01-16 18:30:59,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:30:59,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:30:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:30:59,977 INFO L225 Difference]: With dead ends: 644 [2020-01-16 18:30:59,977 INFO L226 Difference]: Without dead ends: 611 [2020-01-16 18:30:59,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-01-16 18:30:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-01-16 18:30:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 346. [2020-01-16 18:30:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-01-16 18:30:59,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1105 transitions. [2020-01-16 18:30:59,989 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1105 transitions. Word has length 19 [2020-01-16 18:30:59,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:30:59,989 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 1105 transitions. [2020-01-16 18:30:59,989 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:30:59,989 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1105 transitions. [2020-01-16 18:30:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:30:59,990 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:30:59,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-01-16 18:30:59,990 INFO L426 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-01-16 18:30:59,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:30:59,991 INFO L82 PathProgramCache]: Analyzing trace with hash -409413030, now seen corresponding path program 35 times [2020-01-16 18:30:59,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:30:59,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138478326] [2020-01-16 18:30:59,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:30:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:00,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138478326] [2020-01-16 18:31:00,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:00,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:00,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377233585] [2020-01-16 18:31:00,182 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:00,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:00,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:00,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:00,183 INFO L87 Difference]: Start difference. First operand 346 states and 1105 transitions. Second operand 8 states. [2020-01-16 18:31:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:00,272 INFO L93 Difference]: Finished difference Result 666 states and 1842 transitions. [2020-01-16 18:31:00,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:00,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:00,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:00,274 INFO L225 Difference]: With dead ends: 666 [2020-01-16 18:31:00,275 INFO L226 Difference]: Without dead ends: 626 [2020-01-16 18:31:00,277 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-01-16 18:31:00,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 352. [2020-01-16 18:31:00,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-01-16 18:31:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1117 transitions. [2020-01-16 18:31:00,286 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1117 transitions. Word has length 19 [2020-01-16 18:31:00,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:00,286 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 1117 transitions. [2020-01-16 18:31:00,286 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1117 transitions. [2020-01-16 18:31:00,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:00,287 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:00,287 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:00,287 INFO L426 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-01-16 18:31:00,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:00,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1283748356, now seen corresponding path program 36 times [2020-01-16 18:31:00,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:00,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971032032] [2020-01-16 18:31:00,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:00,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:00,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971032032] [2020-01-16 18:31:00,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:00,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:00,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952803910] [2020-01-16 18:31:00,506 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:00,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:00,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:00,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:00,506 INFO L87 Difference]: Start difference. First operand 352 states and 1117 transitions. Second operand 8 states. [2020-01-16 18:31:00,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:00,603 INFO L93 Difference]: Finished difference Result 656 states and 1805 transitions. [2020-01-16 18:31:00,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:00,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:00,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:00,605 INFO L225 Difference]: With dead ends: 656 [2020-01-16 18:31:00,605 INFO L226 Difference]: Without dead ends: 616 [2020-01-16 18:31:00,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:00,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-01-16 18:31:00,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 342. [2020-01-16 18:31:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-01-16 18:31:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1096 transitions. [2020-01-16 18:31:00,615 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1096 transitions. Word has length 19 [2020-01-16 18:31:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:00,615 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 1096 transitions. [2020-01-16 18:31:00,615 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1096 transitions. [2020-01-16 18:31:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:00,616 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:00,616 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:00,616 INFO L426 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-01-16 18:31:00,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:00,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1043020286, now seen corresponding path program 37 times [2020-01-16 18:31:00,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:00,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455699456] [2020-01-16 18:31:00,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:00,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:00,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455699456] [2020-01-16 18:31:00,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:00,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:00,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322927807] [2020-01-16 18:31:00,826 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:00,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:00,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:00,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:00,826 INFO L87 Difference]: Start difference. First operand 342 states and 1096 transitions. Second operand 8 states. [2020-01-16 18:31:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:00,895 INFO L93 Difference]: Finished difference Result 637 states and 1753 transitions. [2020-01-16 18:31:00,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:00,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:00,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:00,896 INFO L225 Difference]: With dead ends: 637 [2020-01-16 18:31:00,896 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 18:31:00,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-01-16 18:31:00,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 18:31:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 348. [2020-01-16 18:31:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-01-16 18:31:00,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1110 transitions. [2020-01-16 18:31:00,905 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1110 transitions. Word has length 19 [2020-01-16 18:31:00,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:00,905 INFO L478 AbstractCegarLoop]: Abstraction has 348 states and 1110 transitions. [2020-01-16 18:31:00,905 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1110 transitions. [2020-01-16 18:31:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:00,906 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:00,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-01-16 18:31:00,906 INFO L426 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-01-16 18:31:00,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:00,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1100220464, now seen corresponding path program 38 times [2020-01-16 18:31:00,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:00,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820382123] [2020-01-16 18:31:00,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:01,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820382123] [2020-01-16 18:31:01,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:01,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:01,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545286087] [2020-01-16 18:31:01,103 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:01,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:01,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:01,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:01,104 INFO L87 Difference]: Start difference. First operand 348 states and 1110 transitions. Second operand 8 states. [2020-01-16 18:31:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:01,183 INFO L93 Difference]: Finished difference Result 636 states and 1749 transitions. [2020-01-16 18:31:01,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:01,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:01,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:01,185 INFO L225 Difference]: With dead ends: 636 [2020-01-16 18:31:01,185 INFO L226 Difference]: Without dead ends: 603 [2020-01-16 18:31:01,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-01-16 18:31:01,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-01-16 18:31:01,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 345. [2020-01-16 18:31:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:31:01,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1103 transitions. [2020-01-16 18:31:01,195 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1103 transitions. Word has length 19 [2020-01-16 18:31:01,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:01,195 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1103 transitions. [2020-01-16 18:31:01,195 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1103 transitions. [2020-01-16 18:31:01,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:01,196 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:01,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-01-16 18:31:01,197 INFO L426 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-01-16 18:31:01,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:01,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1549366552, now seen corresponding path program 39 times [2020-01-16 18:31:01,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:01,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136867781] [2020-01-16 18:31:01,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:01,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136867781] [2020-01-16 18:31:01,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:01,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:01,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253528916] [2020-01-16 18:31:01,403 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:01,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:01,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:01,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:01,404 INFO L87 Difference]: Start difference. First operand 345 states and 1103 transitions. Second operand 8 states. [2020-01-16 18:31:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:01,475 INFO L93 Difference]: Finished difference Result 646 states and 1779 transitions. [2020-01-16 18:31:01,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:01,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:01,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:01,477 INFO L225 Difference]: With dead ends: 646 [2020-01-16 18:31:01,477 INFO L226 Difference]: Without dead ends: 615 [2020-01-16 18:31:01,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-01-16 18:31:01,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-01-16 18:31:01,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 351. [2020-01-16 18:31:01,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-01-16 18:31:01,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1114 transitions. [2020-01-16 18:31:01,486 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1114 transitions. Word has length 19 [2020-01-16 18:31:01,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:01,486 INFO L478 AbstractCegarLoop]: Abstraction has 351 states and 1114 transitions. [2020-01-16 18:31:01,487 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:01,487 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1114 transitions. [2020-01-16 18:31:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:01,488 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:01,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-01-16 18:31:01,488 INFO L426 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-01-16 18:31:01,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:01,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1769395994, now seen corresponding path program 40 times [2020-01-16 18:31:01,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:01,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421606784] [2020-01-16 18:31:01,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:01,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421606784] [2020-01-16 18:31:01,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:01,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:01,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557608080] [2020-01-16 18:31:01,698 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:01,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:01,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:01,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:01,698 INFO L87 Difference]: Start difference. First operand 351 states and 1114 transitions. Second operand 8 states. [2020-01-16 18:31:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:01,782 INFO L93 Difference]: Finished difference Result 651 states and 1791 transitions. [2020-01-16 18:31:01,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:01,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:01,784 INFO L225 Difference]: With dead ends: 651 [2020-01-16 18:31:01,784 INFO L226 Difference]: Without dead ends: 609 [2020-01-16 18:31:01,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:01,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-01-16 18:31:01,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 345. [2020-01-16 18:31:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:31:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1100 transitions. [2020-01-16 18:31:01,793 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1100 transitions. Word has length 19 [2020-01-16 18:31:01,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:01,794 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1100 transitions. [2020-01-16 18:31:01,794 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1100 transitions. [2020-01-16 18:31:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:01,795 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:01,795 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:01,795 INFO L426 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-01-16 18:31:01,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:01,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1215861966, now seen corresponding path program 41 times [2020-01-16 18:31:01,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:01,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023952623] [2020-01-16 18:31:01,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:01,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023952623] [2020-01-16 18:31:01,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:01,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:01,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416771916] [2020-01-16 18:31:01,994 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:01,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:01,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:01,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:01,995 INFO L87 Difference]: Start difference. First operand 345 states and 1100 transitions. Second operand 8 states. [2020-01-16 18:31:02,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:02,104 INFO L93 Difference]: Finished difference Result 643 states and 1772 transitions. [2020-01-16 18:31:02,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:02,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:02,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:02,106 INFO L225 Difference]: With dead ends: 643 [2020-01-16 18:31:02,106 INFO L226 Difference]: Without dead ends: 613 [2020-01-16 18:31:02,107 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:02,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-01-16 18:31:02,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 350. [2020-01-16 18:31:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-01-16 18:31:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1110 transitions. [2020-01-16 18:31:02,118 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1110 transitions. Word has length 19 [2020-01-16 18:31:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:02,119 INFO L478 AbstractCegarLoop]: Abstraction has 350 states and 1110 transitions. [2020-01-16 18:31:02,119 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:02,119 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1110 transitions. [2020-01-16 18:31:02,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:02,120 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:02,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-01-16 18:31:02,121 INFO L426 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-01-16 18:31:02,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:02,121 INFO L82 PathProgramCache]: Analyzing trace with hash -513185368, now seen corresponding path program 42 times [2020-01-16 18:31:02,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:02,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067347509] [2020-01-16 18:31:02,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:02,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067347509] [2020-01-16 18:31:02,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:02,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:02,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712489906] [2020-01-16 18:31:02,364 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:02,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:02,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:02,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:02,364 INFO L87 Difference]: Start difference. First operand 350 states and 1110 transitions. Second operand 8 states. [2020-01-16 18:31:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:02,463 INFO L93 Difference]: Finished difference Result 649 states and 1786 transitions. [2020-01-16 18:31:02,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:02,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:02,465 INFO L225 Difference]: With dead ends: 649 [2020-01-16 18:31:02,465 INFO L226 Difference]: Without dead ends: 605 [2020-01-16 18:31:02,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:02,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-01-16 18:31:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 342. [2020-01-16 18:31:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-01-16 18:31:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1093 transitions. [2020-01-16 18:31:02,474 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1093 transitions. Word has length 19 [2020-01-16 18:31:02,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:02,474 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 1093 transitions. [2020-01-16 18:31:02,475 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:02,475 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1093 transitions. [2020-01-16 18:31:02,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:02,475 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:02,476 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:02,476 INFO L426 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-01-16 18:31:02,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:02,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1822419634, now seen corresponding path program 43 times [2020-01-16 18:31:02,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:02,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712521528] [2020-01-16 18:31:02,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:02,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712521528] [2020-01-16 18:31:02,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:02,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:02,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182784652] [2020-01-16 18:31:02,673 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:02,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:02,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:02,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:02,673 INFO L87 Difference]: Start difference. First operand 342 states and 1093 transitions. Second operand 8 states. [2020-01-16 18:31:02,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:02,771 INFO L93 Difference]: Finished difference Result 678 states and 1898 transitions. [2020-01-16 18:31:02,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:02,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:02,773 INFO L225 Difference]: With dead ends: 678 [2020-01-16 18:31:02,773 INFO L226 Difference]: Without dead ends: 638 [2020-01-16 18:31:02,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-01-16 18:31:02,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-01-16 18:31:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 353. [2020-01-16 18:31:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-01-16 18:31:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1125 transitions. [2020-01-16 18:31:02,782 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1125 transitions. Word has length 19 [2020-01-16 18:31:02,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:02,783 INFO L478 AbstractCegarLoop]: Abstraction has 353 states and 1125 transitions. [2020-01-16 18:31:02,783 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1125 transitions. [2020-01-16 18:31:02,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:02,783 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:02,783 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:02,784 INFO L426 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-01-16 18:31:02,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:02,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1598212336, now seen corresponding path program 44 times [2020-01-16 18:31:02,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:02,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241165154] [2020-01-16 18:31:02,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:02,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241165154] [2020-01-16 18:31:02,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:02,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:02,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742019885] [2020-01-16 18:31:02,976 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:02,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:02,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:02,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:02,977 INFO L87 Difference]: Start difference. First operand 353 states and 1125 transitions. Second operand 8 states. [2020-01-16 18:31:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:03,065 INFO L93 Difference]: Finished difference Result 668 states and 1861 transitions. [2020-01-16 18:31:03,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:03,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:03,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:03,067 INFO L225 Difference]: With dead ends: 668 [2020-01-16 18:31:03,068 INFO L226 Difference]: Without dead ends: 632 [2020-01-16 18:31:03,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:03,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-01-16 18:31:03,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 347. [2020-01-16 18:31:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-01-16 18:31:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1108 transitions. [2020-01-16 18:31:03,080 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1108 transitions. Word has length 19 [2020-01-16 18:31:03,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:03,080 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 1108 transitions. [2020-01-16 18:31:03,080 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1108 transitions. [2020-01-16 18:31:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:03,081 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:03,081 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:03,082 INFO L426 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-01-16 18:31:03,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:03,082 INFO L82 PathProgramCache]: Analyzing trace with hash 411687860, now seen corresponding path program 45 times [2020-01-16 18:31:03,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:03,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143390762] [2020-01-16 18:31:03,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:03,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:03,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143390762] [2020-01-16 18:31:03,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:03,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:03,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581643060] [2020-01-16 18:31:03,288 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:03,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:03,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:03,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:03,289 INFO L87 Difference]: Start difference. First operand 347 states and 1108 transitions. Second operand 8 states. [2020-01-16 18:31:03,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:03,385 INFO L93 Difference]: Finished difference Result 690 states and 1937 transitions. [2020-01-16 18:31:03,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:03,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:03,387 INFO L225 Difference]: With dead ends: 690 [2020-01-16 18:31:03,387 INFO L226 Difference]: Without dead ends: 650 [2020-01-16 18:31:03,387 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-01-16 18:31:03,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 359. [2020-01-16 18:31:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2020-01-16 18:31:03,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1139 transitions. [2020-01-16 18:31:03,398 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1139 transitions. Word has length 19 [2020-01-16 18:31:03,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:03,399 INFO L478 AbstractCegarLoop]: Abstraction has 359 states and 1139 transitions. [2020-01-16 18:31:03,399 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1139 transitions. [2020-01-16 18:31:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:03,400 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:03,400 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:03,400 INFO L426 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-01-16 18:31:03,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:03,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1380571900, now seen corresponding path program 46 times [2020-01-16 18:31:03,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:03,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333522089] [2020-01-16 18:31:03,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:03,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:03,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333522089] [2020-01-16 18:31:03,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:03,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:03,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470511536] [2020-01-16 18:31:03,597 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:03,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:03,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:03,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:03,598 INFO L87 Difference]: Start difference. First operand 359 states and 1139 transitions. Second operand 8 states. [2020-01-16 18:31:03,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:03,705 INFO L93 Difference]: Finished difference Result 686 states and 1913 transitions. [2020-01-16 18:31:03,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:03,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:03,707 INFO L225 Difference]: With dead ends: 686 [2020-01-16 18:31:03,707 INFO L226 Difference]: Without dead ends: 638 [2020-01-16 18:31:03,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-01-16 18:31:03,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-01-16 18:31:03,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 347. [2020-01-16 18:31:03,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-01-16 18:31:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1103 transitions. [2020-01-16 18:31:03,715 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1103 transitions. Word has length 19 [2020-01-16 18:31:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:03,715 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 1103 transitions. [2020-01-16 18:31:03,716 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1103 transitions. [2020-01-16 18:31:03,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:03,716 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:03,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-01-16 18:31:03,717 INFO L426 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-01-16 18:31:03,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:03,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1771460028, now seen corresponding path program 47 times [2020-01-16 18:31:03,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:03,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145472270] [2020-01-16 18:31:03,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31: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-01-16 18:31:03,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145472270] [2020-01-16 18:31:03,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:03,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:03,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585657421] [2020-01-16 18:31:03,919 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:03,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:03,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:03,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:03,920 INFO L87 Difference]: Start difference. First operand 347 states and 1103 transitions. Second operand 8 states. [2020-01-16 18:31:04,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:04,017 INFO L93 Difference]: Finished difference Result 663 states and 1842 transitions. [2020-01-16 18:31:04,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:04,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:04,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:04,019 INFO L225 Difference]: With dead ends: 663 [2020-01-16 18:31:04,019 INFO L226 Difference]: Without dead ends: 633 [2020-01-16 18:31:04,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-01-16 18:31:04,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 352. [2020-01-16 18:31:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-01-16 18:31:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1113 transitions. [2020-01-16 18:31:04,028 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1113 transitions. Word has length 19 [2020-01-16 18:31:04,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:04,029 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 1113 transitions. [2020-01-16 18:31:04,029 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:04,029 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1113 transitions. [2020-01-16 18:31:04,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:04,029 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:04,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-01-16 18:31:04,030 INFO L426 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-01-16 18:31:04,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:04,030 INFO L82 PathProgramCache]: Analyzing trace with hash 42412694, now seen corresponding path program 48 times [2020-01-16 18:31:04,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:04,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210205765] [2020-01-16 18:31:04,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:04,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210205765] [2020-01-16 18:31:04,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:04,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:04,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108092421] [2020-01-16 18:31:04,225 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:04,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:04,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:04,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:04,226 INFO L87 Difference]: Start difference. First operand 352 states and 1113 transitions. Second operand 8 states. [2020-01-16 18:31:04,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:04,332 INFO L93 Difference]: Finished difference Result 669 states and 1856 transitions. [2020-01-16 18:31:04,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:04,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:04,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:04,334 INFO L225 Difference]: With dead ends: 669 [2020-01-16 18:31:04,335 INFO L226 Difference]: Without dead ends: 618 [2020-01-16 18:31:04,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-01-16 18:31:04,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-01-16 18:31:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 337. [2020-01-16 18:31:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-01-16 18:31:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1082 transitions. [2020-01-16 18:31:04,342 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1082 transitions. Word has length 19 [2020-01-16 18:31:04,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:04,342 INFO L478 AbstractCegarLoop]: Abstraction has 337 states and 1082 transitions. [2020-01-16 18:31:04,343 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:04,343 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1082 transitions. [2020-01-16 18:31:04,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:04,344 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:04,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-01-16 18:31:04,344 INFO L426 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-01-16 18:31:04,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:04,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1950102064, now seen corresponding path program 49 times [2020-01-16 18:31:04,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:04,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679332949] [2020-01-16 18:31:04,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:04,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679332949] [2020-01-16 18:31:04,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:04,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:04,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400627208] [2020-01-16 18:31:04,563 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:04,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:04,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:04,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:04,564 INFO L87 Difference]: Start difference. First operand 337 states and 1082 transitions. Second operand 8 states. [2020-01-16 18:31:04,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:04,633 INFO L93 Difference]: Finished difference Result 648 states and 1785 transitions. [2020-01-16 18:31:04,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:04,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:04,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:04,635 INFO L225 Difference]: With dead ends: 648 [2020-01-16 18:31:04,635 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 18:31:04,635 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:04,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 18:31:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 353. [2020-01-16 18:31:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-01-16 18:31:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1124 transitions. [2020-01-16 18:31:04,643 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1124 transitions. Word has length 19 [2020-01-16 18:31:04,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:04,643 INFO L478 AbstractCegarLoop]: Abstraction has 353 states and 1124 transitions. [2020-01-16 18:31:04,643 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:04,643 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1124 transitions. [2020-01-16 18:31:04,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:04,644 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:04,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-01-16 18:31:04,644 INFO L426 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-01-16 18:31:04,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:04,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1575450878, now seen corresponding path program 50 times [2020-01-16 18:31:04,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:04,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323430472] [2020-01-16 18:31:04,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:04,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323430472] [2020-01-16 18:31:04,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:04,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:04,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634803936] [2020-01-16 18:31:04,865 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:04,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:04,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:04,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:04,865 INFO L87 Difference]: Start difference. First operand 353 states and 1124 transitions. Second operand 8 states. [2020-01-16 18:31:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:04,949 INFO L93 Difference]: Finished difference Result 657 states and 1808 transitions. [2020-01-16 18:31:04,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:04,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:04,951 INFO L225 Difference]: With dead ends: 657 [2020-01-16 18:31:04,951 INFO L226 Difference]: Without dead ends: 609 [2020-01-16 18:31:04,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-01-16 18:31:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-01-16 18:31:04,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 345. [2020-01-16 18:31:04,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:31:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1106 transitions. [2020-01-16 18:31:04,961 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1106 transitions. Word has length 19 [2020-01-16 18:31:04,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:04,961 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1106 transitions. [2020-01-16 18:31:04,961 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1106 transitions. [2020-01-16 18:31:04,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:04,962 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:04,962 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:04,962 INFO L426 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-01-16 18:31:04,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:04,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1745500982, now seen corresponding path program 51 times [2020-01-16 18:31:04,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:04,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200748000] [2020-01-16 18:31:04,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:05,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200748000] [2020-01-16 18:31:05,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:05,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:05,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179659862] [2020-01-16 18:31:05,195 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:05,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:05,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:05,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:05,195 INFO L87 Difference]: Start difference. First operand 345 states and 1106 transitions. Second operand 8 states. [2020-01-16 18:31:05,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:05,266 INFO L93 Difference]: Finished difference Result 633 states and 1736 transitions. [2020-01-16 18:31:05,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:05,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:05,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:05,267 INFO L225 Difference]: With dead ends: 633 [2020-01-16 18:31:05,268 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 18:31:05,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:05,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 18:31:05,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 348. [2020-01-16 18:31:05,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-01-16 18:31:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1110 transitions. [2020-01-16 18:31:05,277 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1110 transitions. Word has length 19 [2020-01-16 18:31:05,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:05,277 INFO L478 AbstractCegarLoop]: Abstraction has 348 states and 1110 transitions. [2020-01-16 18:31:05,277 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:05,277 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1110 transitions. [2020-01-16 18:31:05,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:05,278 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:05,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-01-16 18:31:05,278 INFO L426 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-01-16 18:31:05,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:05,278 INFO L82 PathProgramCache]: Analyzing trace with hash 397739768, now seen corresponding path program 52 times [2020-01-16 18:31:05,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:05,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055361391] [2020-01-16 18:31:05,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:05,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-01-16 18:31:05,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055361391] [2020-01-16 18:31:05,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:05,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:05,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858506414] [2020-01-16 18:31:05,497 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:05,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:05,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:05,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:05,497 INFO L87 Difference]: Start difference. First operand 348 states and 1110 transitions. Second operand 8 states. [2020-01-16 18:31:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:05,573 INFO L93 Difference]: Finished difference Result 632 states and 1732 transitions. [2020-01-16 18:31:05,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:05,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:05,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:05,576 INFO L225 Difference]: With dead ends: 632 [2020-01-16 18:31:05,576 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 18:31:05,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:05,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 18:31:05,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 345. [2020-01-16 18:31:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:31:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1103 transitions. [2020-01-16 18:31:05,588 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1103 transitions. Word has length 19 [2020-01-16 18:31:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:05,588 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1103 transitions. [2020-01-16 18:31:05,589 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1103 transitions. [2020-01-16 18:31:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:05,590 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:05,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-01-16 18:31:05,590 INFO L426 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-01-16 18:31:05,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:05,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1151450280, now seen corresponding path program 53 times [2020-01-16 18:31:05,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:05,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106555728] [2020-01-16 18:31:05,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:05,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:05,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106555728] [2020-01-16 18:31:05,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:05,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:05,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292546989] [2020-01-16 18:31:05,814 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:05,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:05,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:05,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:05,815 INFO L87 Difference]: Start difference. First operand 345 states and 1103 transitions. Second operand 8 states. [2020-01-16 18:31:05,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:05,888 INFO L93 Difference]: Finished difference Result 654 states and 1804 transitions. [2020-01-16 18:31:05,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:05,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:05,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:05,889 INFO L225 Difference]: With dead ends: 654 [2020-01-16 18:31:05,890 INFO L226 Difference]: Without dead ends: 614 [2020-01-16 18:31:05,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:05,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-01-16 18:31:05,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 351. [2020-01-16 18:31:05,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-01-16 18:31:05,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1115 transitions. [2020-01-16 18:31:05,897 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1115 transitions. Word has length 19 [2020-01-16 18:31:05,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:05,897 INFO L478 AbstractCegarLoop]: Abstraction has 351 states and 1115 transitions. [2020-01-16 18:31:05,897 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:05,897 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1115 transitions. [2020-01-16 18:31:05,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:05,898 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:05,898 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:05,898 INFO L426 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-01-16 18:31:05,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:05,898 INFO L82 PathProgramCache]: Analyzing trace with hash 277114954, now seen corresponding path program 54 times [2020-01-16 18:31:05,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:05,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12075653] [2020-01-16 18:31:05,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:06,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12075653] [2020-01-16 18:31:06,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:06,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:06,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308093032] [2020-01-16 18:31:06,102 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:06,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:06,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:06,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:06,103 INFO L87 Difference]: Start difference. First operand 351 states and 1115 transitions. Second operand 8 states. [2020-01-16 18:31:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:06,195 INFO L93 Difference]: Finished difference Result 644 states and 1767 transitions. [2020-01-16 18:31:06,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:06,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:06,197 INFO L225 Difference]: With dead ends: 644 [2020-01-16 18:31:06,197 INFO L226 Difference]: Without dead ends: 604 [2020-01-16 18:31:06,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-01-16 18:31:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-01-16 18:31:06,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 341. [2020-01-16 18:31:06,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:31:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1094 transitions. [2020-01-16 18:31:06,207 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1094 transitions. Word has length 19 [2020-01-16 18:31:06,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:06,207 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1094 transitions. [2020-01-16 18:31:06,208 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:06,208 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1094 transitions. [2020-01-16 18:31:06,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:06,209 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:06,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-01-16 18:31:06,209 INFO L426 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-01-16 18:31:06,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:06,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1499893780, now seen corresponding path program 55 times [2020-01-16 18:31:06,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:06,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970793354] [2020-01-16 18:31:06,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:06,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970793354] [2020-01-16 18:31:06,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:06,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:06,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850988906] [2020-01-16 18:31:06,468 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:06,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:06,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:06,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:06,469 INFO L87 Difference]: Start difference. First operand 341 states and 1094 transitions. Second operand 8 states. [2020-01-16 18:31:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:06,538 INFO L93 Difference]: Finished difference Result 658 states and 1820 transitions. [2020-01-16 18:31:06,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:06,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:06,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:06,540 INFO L225 Difference]: With dead ends: 658 [2020-01-16 18:31:06,540 INFO L226 Difference]: Without dead ends: 627 [2020-01-16 18:31:06,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:06,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-01-16 18:31:06,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 355. [2020-01-16 18:31:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2020-01-16 18:31:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 1129 transitions. [2020-01-16 18:31:06,549 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 1129 transitions. Word has length 19 [2020-01-16 18:31:06,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:06,549 INFO L478 AbstractCegarLoop]: Abstraction has 355 states and 1129 transitions. [2020-01-16 18:31:06,549 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:06,549 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 1129 transitions. [2020-01-16 18:31:06,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:06,550 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:06,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-01-16 18:31:06,550 INFO L426 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-01-16 18:31:06,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:06,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1874544966, now seen corresponding path program 56 times [2020-01-16 18:31:06,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:06,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787965271] [2020-01-16 18:31:06,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:06,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787965271] [2020-01-16 18:31:06,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:06,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:06,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628698268] [2020-01-16 18:31:06,763 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:06,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:06,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:06,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:06,763 INFO L87 Difference]: Start difference. First operand 355 states and 1129 transitions. Second operand 8 states. [2020-01-16 18:31:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:06,846 INFO L93 Difference]: Finished difference Result 667 states and 1843 transitions. [2020-01-16 18:31:06,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:06,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:06,847 INFO L225 Difference]: With dead ends: 667 [2020-01-16 18:31:06,848 INFO L226 Difference]: Without dead ends: 619 [2020-01-16 18:31:06,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-01-16 18:31:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-01-16 18:31:06,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 347. [2020-01-16 18:31:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-01-16 18:31:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1109 transitions. [2020-01-16 18:31:06,855 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1109 transitions. Word has length 19 [2020-01-16 18:31:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:06,856 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 1109 transitions. [2020-01-16 18:31:06,856 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1109 transitions. [2020-01-16 18:31:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:06,857 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:06,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:06,857 INFO L426 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-01-16 18:31:06,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:06,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1939279986, now seen corresponding path program 57 times [2020-01-16 18:31:06,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:06,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058311019] [2020-01-16 18:31:06,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:07,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:07,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058311019] [2020-01-16 18:31:07,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:07,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:07,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142610898] [2020-01-16 18:31:07,131 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:07,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:07,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:07,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:07,132 INFO L87 Difference]: Start difference. First operand 347 states and 1109 transitions. Second operand 8 states. [2020-01-16 18:31:07,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:07,208 INFO L93 Difference]: Finished difference Result 648 states and 1786 transitions. [2020-01-16 18:31:07,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:07,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:07,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:07,210 INFO L225 Difference]: With dead ends: 648 [2020-01-16 18:31:07,210 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 18:31:07,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-01-16 18:31:07,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 18:31:07,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 352. [2020-01-16 18:31:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-01-16 18:31:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1118 transitions. [2020-01-16 18:31:07,219 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1118 transitions. Word has length 19 [2020-01-16 18:31:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:07,220 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 1118 transitions. [2020-01-16 18:31:07,220 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:07,220 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1118 transitions. [2020-01-16 18:31:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:07,221 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:07,221 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:07,221 INFO L426 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-01-16 18:31:07,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:07,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1604625216, now seen corresponding path program 58 times [2020-01-16 18:31:07,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:07,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590222572] [2020-01-16 18:31:07,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:07,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590222572] [2020-01-16 18:31:07,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:07,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:07,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894995323] [2020-01-16 18:31:07,422 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:07,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:07,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:07,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:07,422 INFO L87 Difference]: Start difference. First operand 352 states and 1118 transitions. Second operand 8 states. [2020-01-16 18:31:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:07,507 INFO L93 Difference]: Finished difference Result 650 states and 1790 transitions. [2020-01-16 18:31:07,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:07,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:07,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:07,509 INFO L225 Difference]: With dead ends: 650 [2020-01-16 18:31:07,509 INFO L226 Difference]: Without dead ends: 612 [2020-01-16 18:31:07,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-01-16 18:31:07,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-01-16 18:31:07,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 347. [2020-01-16 18:31:07,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-01-16 18:31:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1104 transitions. [2020-01-16 18:31:07,518 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1104 transitions. Word has length 19 [2020-01-16 18:31:07,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:07,518 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 1104 transitions. [2020-01-16 18:31:07,518 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:07,518 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1104 transitions. [2020-01-16 18:31:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:07,519 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:07,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-01-16 18:31:07,519 INFO L426 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-01-16 18:31:07,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:07,519 INFO L82 PathProgramCache]: Analyzing trace with hash 334504740, now seen corresponding path program 59 times [2020-01-16 18:31:07,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:07,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98047327] [2020-01-16 18:31:07,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:07,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98047327] [2020-01-16 18:31:07,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:07,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:07,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565697526] [2020-01-16 18:31:07,718 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:07,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:07,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:07,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:07,719 INFO L87 Difference]: Start difference. First operand 347 states and 1104 transitions. Second operand 8 states. [2020-01-16 18:31:07,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:07,837 INFO L93 Difference]: Finished difference Result 670 states and 1858 transitions. [2020-01-16 18:31:07,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:07,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:07,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:07,839 INFO L225 Difference]: With dead ends: 670 [2020-01-16 18:31:07,839 INFO L226 Difference]: Without dead ends: 630 [2020-01-16 18:31:07,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-01-16 18:31:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-01-16 18:31:07,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 356. [2020-01-16 18:31:07,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2020-01-16 18:31:07,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 1126 transitions. [2020-01-16 18:31:07,847 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 1126 transitions. Word has length 19 [2020-01-16 18:31:07,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:07,847 INFO L478 AbstractCegarLoop]: Abstraction has 356 states and 1126 transitions. [2020-01-16 18:31:07,847 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:07,847 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 1126 transitions. [2020-01-16 18:31:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:07,848 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:07,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-01-16 18:31:07,848 INFO L426 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-01-16 18:31:07,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:07,849 INFO L82 PathProgramCache]: Analyzing trace with hash 333910094, now seen corresponding path program 60 times [2020-01-16 18:31:07,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:07,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258673851] [2020-01-16 18:31:07,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:08,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258673851] [2020-01-16 18:31:08,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:08,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:08,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964039750] [2020-01-16 18:31:08,058 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:08,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:08,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:08,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:08,058 INFO L87 Difference]: Start difference. First operand 356 states and 1126 transitions. Second operand 8 states. [2020-01-16 18:31:08,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:08,163 INFO L93 Difference]: Finished difference Result 663 states and 1828 transitions. [2020-01-16 18:31:08,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:08,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:08,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:08,165 INFO L225 Difference]: With dead ends: 663 [2020-01-16 18:31:08,165 INFO L226 Difference]: Without dead ends: 615 [2020-01-16 18:31:08,166 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:08,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-01-16 18:31:08,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 341. [2020-01-16 18:31:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:31:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1090 transitions. [2020-01-16 18:31:08,173 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1090 transitions. Word has length 19 [2020-01-16 18:31:08,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:08,173 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1090 transitions. [2020-01-16 18:31:08,173 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1090 transitions. [2020-01-16 18:31:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:08,174 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:08,174 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:08,174 INFO L426 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-01-16 18:31:08,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:08,174 INFO L82 PathProgramCache]: Analyzing trace with hash -985705328, now seen corresponding path program 61 times [2020-01-16 18:31:08,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:08,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84573369] [2020-01-16 18:31:08,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:08,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84573369] [2020-01-16 18:31:08,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:08,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:08,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783332712] [2020-01-16 18:31:08,382 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:08,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:08,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:08,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:08,383 INFO L87 Difference]: Start difference. First operand 341 states and 1090 transitions. Second operand 8 states. [2020-01-16 18:31:08,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:08,448 INFO L93 Difference]: Finished difference Result 620 states and 1696 transitions. [2020-01-16 18:31:08,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:08,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:08,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:08,450 INFO L225 Difference]: With dead ends: 620 [2020-01-16 18:31:08,450 INFO L226 Difference]: Without dead ends: 589 [2020-01-16 18:31:08,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:08,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-01-16 18:31:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 347. [2020-01-16 18:31:08,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-01-16 18:31:08,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1104 transitions. [2020-01-16 18:31:08,459 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1104 transitions. Word has length 19 [2020-01-16 18:31:08,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:08,459 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 1104 transitions. [2020-01-16 18:31:08,459 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1104 transitions. [2020-01-16 18:31:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:08,460 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31: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-01-16 18:31:08,460 INFO L426 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-01-16 18:31:08,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:08,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1157535422, now seen corresponding path program 62 times [2020-01-16 18:31:08,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:08,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144679359] [2020-01-16 18:31:08,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:08,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144679359] [2020-01-16 18:31:08,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:08,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:08,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119555804] [2020-01-16 18:31:08,679 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:08,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:08,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:08,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:08,680 INFO L87 Difference]: Start difference. First operand 347 states and 1104 transitions. Second operand 8 states. [2020-01-16 18:31:08,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:08,770 INFO L93 Difference]: Finished difference Result 619 states and 1692 transitions. [2020-01-16 18:31:08,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:08,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:08,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:08,771 INFO L225 Difference]: With dead ends: 619 [2020-01-16 18:31:08,772 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 18:31:08,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-01-16 18:31:08,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 18:31:08,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 344. [2020-01-16 18:31:08,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-01-16 18:31:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1097 transitions. [2020-01-16 18:31:08,781 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1097 transitions. Word has length 19 [2020-01-16 18:31:08,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:08,782 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 1097 transitions. [2020-01-16 18:31:08,782 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1097 transitions. [2020-01-16 18:31:08,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:08,783 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:08,783 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:08,783 INFO L426 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-01-16 18:31:08,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:08,783 INFO L82 PathProgramCache]: Analyzing trace with hash 108386260, now seen corresponding path program 63 times [2020-01-16 18:31:08,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:08,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029992140] [2020-01-16 18:31:08,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:08,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029992140] [2020-01-16 18:31:08,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:08,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:08,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255745643] [2020-01-16 18:31:08,997 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:08,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:08,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:08,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:08,997 INFO L87 Difference]: Start difference. First operand 344 states and 1097 transitions. Second operand 8 states. [2020-01-16 18:31:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:09,064 INFO L93 Difference]: Finished difference Result 625 states and 1710 transitions. [2020-01-16 18:31:09,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:09,064 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:09,066 INFO L225 Difference]: With dead ends: 625 [2020-01-16 18:31:09,066 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 18:31:09,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 18:31:09,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 349. [2020-01-16 18:31:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:31:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1106 transitions. [2020-01-16 18:31:09,073 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1106 transitions. Word has length 19 [2020-01-16 18:31:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:09,073 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1106 transitions. [2020-01-16 18:31:09,074 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1106 transitions. [2020-01-16 18:31:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:09,074 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:09,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-01-16 18:31:09,075 INFO L426 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-01-16 18:31:09,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:09,075 INFO L82 PathProgramCache]: Analyzing trace with hash -642675834, now seen corresponding path program 64 times [2020-01-16 18:31:09,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:09,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781308986] [2020-01-16 18:31:09,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:09,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781308986] [2020-01-16 18:31:09,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:09,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:09,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578418430] [2020-01-16 18:31:09,292 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:09,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:09,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:09,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:09,293 INFO L87 Difference]: Start difference. First operand 349 states and 1106 transitions. Second operand 8 states. [2020-01-16 18:31:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:09,388 INFO L93 Difference]: Finished difference Result 627 states and 1714 transitions. [2020-01-16 18:31:09,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:09,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:09,390 INFO L225 Difference]: With dead ends: 627 [2020-01-16 18:31:09,390 INFO L226 Difference]: Without dead ends: 589 [2020-01-16 18:31:09,391 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:09,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-01-16 18:31:09,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 344. [2020-01-16 18:31:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-01-16 18:31:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1094 transitions. [2020-01-16 18:31:09,399 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1094 transitions. Word has length 19 [2020-01-16 18:31:09,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:09,399 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 1094 transitions. [2020-01-16 18:31:09,399 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:09,399 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1094 transitions. [2020-01-16 18:31:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:09,400 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:09,400 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:09,400 INFO L426 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-01-16 18:31:09,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:09,401 INFO L82 PathProgramCache]: Analyzing trace with hash 517971322, now seen corresponding path program 65 times [2020-01-16 18:31:09,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:09,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423459621] [2020-01-16 18:31:09,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:09,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-01-16 18:31:09,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423459621] [2020-01-16 18:31:09,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:09,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:09,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480053251] [2020-01-16 18:31:09,603 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:09,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:09,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:09,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:09,604 INFO L87 Difference]: Start difference. First operand 344 states and 1094 transitions. Second operand 8 states. [2020-01-16 18:31:09,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:09,697 INFO L93 Difference]: Finished difference Result 622 states and 1703 transitions. [2020-01-16 18:31:09,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:09,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:09,699 INFO L225 Difference]: With dead ends: 622 [2020-01-16 18:31:09,699 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 18:31: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-01-16 18:31:09,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 18:31:09,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 348. [2020-01-16 18:31:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-01-16 18:31:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1102 transitions. [2020-01-16 18:31:09,708 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1102 transitions. Word has length 19 [2020-01-16 18:31:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:09,709 INFO L478 AbstractCegarLoop]: Abstraction has 348 states and 1102 transitions. [2020-01-16 18:31:09,709 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1102 transitions. [2020-01-16 18:31:09,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:09,709 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:09,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-01-16 18:31:09,710 INFO L426 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-01-16 18:31:09,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:09,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2066382666, now seen corresponding path program 66 times [2020-01-16 18:31:09,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:09,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122101494] [2020-01-16 18:31:09,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:09,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122101494] [2020-01-16 18:31:09,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:09,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:09,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764639963] [2020-01-16 18:31:09,934 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:09,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:09,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:09,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:09,935 INFO L87 Difference]: Start difference. First operand 348 states and 1102 transitions. Second operand 8 states. [2020-01-16 18:31:10,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:10,027 INFO L93 Difference]: Finished difference Result 625 states and 1709 transitions. [2020-01-16 18:31:10,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:10,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:10,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:10,029 INFO L225 Difference]: With dead ends: 625 [2020-01-16 18:31:10,029 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 18:31:10,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-01-16 18:31:10,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 18:31:10,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 341. [2020-01-16 18:31:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:31:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1087 transitions. [2020-01-16 18:31:10,038 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1087 transitions. Word has length 19 [2020-01-16 18:31:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:10,039 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1087 transitions. [2020-01-16 18:31:10,039 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1087 transitions. [2020-01-16 18:31:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:10,040 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:10,040 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:10,040 INFO L426 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-01-16 18:31:10,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:10,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1775607780, now seen corresponding path program 67 times [2020-01-16 18:31:10,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:10,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776590573] [2020-01-16 18:31:10,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:10,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776590573] [2020-01-16 18:31:10,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:10,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:10,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035962265] [2020-01-16 18:31:10,243 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:10,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:10,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:10,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:10,243 INFO L87 Difference]: Start difference. First operand 341 states and 1087 transitions. Second operand 8 states. [2020-01-16 18:31:10,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:10,320 INFO L93 Difference]: Finished difference Result 658 states and 1828 transitions. [2020-01-16 18:31:10,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:10,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:10,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:10,322 INFO L225 Difference]: With dead ends: 658 [2020-01-16 18:31:10,322 INFO L226 Difference]: Without dead ends: 618 [2020-01-16 18:31:10,322 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-01-16 18:31:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 351. [2020-01-16 18:31:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-01-16 18:31:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1115 transitions. [2020-01-16 18:31:10,332 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1115 transitions. Word has length 19 [2020-01-16 18:31:10,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:10,332 INFO L478 AbstractCegarLoop]: Abstraction has 351 states and 1115 transitions. [2020-01-16 18:31:10,332 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1115 transitions. [2020-01-16 18:31:10,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:10,333 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:10,333 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:10,334 INFO L426 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-01-16 18:31:10,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:10,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1645024190, now seen corresponding path program 68 times [2020-01-16 18:31:10,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:10,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199294458] [2020-01-16 18:31:10,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:10,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199294458] [2020-01-16 18:31:10,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:10,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:10,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407984950] [2020-01-16 18:31:10,514 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:10,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:10,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:10,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:10,514 INFO L87 Difference]: Start difference. First operand 351 states and 1115 transitions. Second operand 8 states. [2020-01-16 18:31:10,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:10,600 INFO L93 Difference]: Finished difference Result 648 states and 1791 transitions. [2020-01-16 18:31:10,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:10,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:10,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:10,602 INFO L225 Difference]: With dead ends: 648 [2020-01-16 18:31:10,602 INFO L226 Difference]: Without dead ends: 612 [2020-01-16 18:31:10,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-01-16 18:31:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-01-16 18:31:10,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 345. [2020-01-16 18:31:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:31:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1099 transitions. [2020-01-16 18:31:10,610 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1099 transitions. Word has length 19 [2020-01-16 18:31:10,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:10,611 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1099 transitions. [2020-01-16 18:31:10,611 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:10,611 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1099 transitions. [2020-01-16 18:31:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:10,612 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:10,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-01-16 18:31:10,612 INFO L426 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-01-16 18:31:10,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:10,612 INFO L82 PathProgramCache]: Analyzing trace with hash -286202784, now seen corresponding path program 69 times [2020-01-16 18:31:10,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:10,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683627577] [2020-01-16 18:31:10,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:10,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683627577] [2020-01-16 18:31:10,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:10,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:10,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064539412] [2020-01-16 18:31:10,852 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:10,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:10,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:10,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:10,852 INFO L87 Difference]: Start difference. First operand 345 states and 1099 transitions. Second operand 8 states. [2020-01-16 18:31:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:10,941 INFO L93 Difference]: Finished difference Result 664 states and 1847 transitions. [2020-01-16 18:31:10,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:10,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:10,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:10,943 INFO L225 Difference]: With dead ends: 664 [2020-01-16 18:31:10,943 INFO L226 Difference]: Without dead ends: 624 [2020-01-16 18:31:10,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-01-16 18:31:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-01-16 18:31:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 354. [2020-01-16 18:31:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-01-16 18:31:10,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1121 transitions. [2020-01-16 18:31:10,952 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1121 transitions. Word has length 19 [2020-01-16 18:31:10,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:10,952 INFO L478 AbstractCegarLoop]: Abstraction has 354 states and 1121 transitions. [2020-01-16 18:31:10,952 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:10,952 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1121 transitions. [2020-01-16 18:31:10,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:10,953 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:10,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-01-16 18:31:10,953 INFO L426 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-01-16 18:31:10,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:10,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1031499928, now seen corresponding path program 70 times [2020-01-16 18:31:10,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:10,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961762065] [2020-01-16 18:31:10,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:11,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961762065] [2020-01-16 18:31:11,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:11,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:11,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817321624] [2020-01-16 18:31:11,158 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:11,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:11,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:11,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:11,159 INFO L87 Difference]: Start difference. First operand 354 states and 1121 transitions. Second operand 8 states. [2020-01-16 18:31:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:11,234 INFO L93 Difference]: Finished difference Result 657 states and 1817 transitions. [2020-01-16 18:31:11,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:11,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:11,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:11,236 INFO L225 Difference]: With dead ends: 657 [2020-01-16 18:31:11,236 INFO L226 Difference]: Without dead ends: 615 [2020-01-16 18:31:11,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-01-16 18:31:11,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 345. [2020-01-16 18:31:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:31:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1095 transitions. [2020-01-16 18:31:11,246 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1095 transitions. Word has length 19 [2020-01-16 18:31:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:11,246 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1095 transitions. [2020-01-16 18:31:11,246 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1095 transitions. [2020-01-16 18:31:11,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:11,247 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:11,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-01-16 18:31:11,247 INFO L426 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-01-16 18:31:11,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:11,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1073569384, now seen corresponding path program 71 times [2020-01-16 18:31:11,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:11,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970437809] [2020-01-16 18:31:11,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:11,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970437809] [2020-01-16 18:31:11,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:11,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:11,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541949186] [2020-01-16 18:31:11,446 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:11,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:11,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:11,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:11,447 INFO L87 Difference]: Start difference. First operand 345 states and 1095 transitions. Second operand 8 states. [2020-01-16 18:31:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:11,528 INFO L93 Difference]: Finished difference Result 639 states and 1762 transitions. [2020-01-16 18:31:11,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:11,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:11,530 INFO L225 Difference]: With dead ends: 639 [2020-01-16 18:31:11,530 INFO L226 Difference]: Without dead ends: 609 [2020-01-16 18:31:11,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:11,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-01-16 18:31:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 349. [2020-01-16 18:31:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:31:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1103 transitions. [2020-01-16 18:31:11,538 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1103 transitions. Word has length 19 [2020-01-16 18:31:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:11,539 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1103 transitions. [2020-01-16 18:31:11,539 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1103 transitions. [2020-01-16 18:31:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:11,539 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:11,539 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:11,540 INFO L426 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-01-16 18:31:11,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:11,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1510784604, now seen corresponding path program 72 times [2020-01-16 18:31:11,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:11,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608631188] [2020-01-16 18:31:11,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31: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-01-16 18:31:11,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608631188] [2020-01-16 18:31:11,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:11,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:11,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870620343] [2020-01-16 18:31:11,736 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:11,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:11,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:11,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:11,737 INFO L87 Difference]: Start difference. First operand 349 states and 1103 transitions. Second operand 8 states. [2020-01-16 18:31:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:11,833 INFO L93 Difference]: Finished difference Result 642 states and 1768 transitions. [2020-01-16 18:31:11,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:11,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:11,835 INFO L225 Difference]: With dead ends: 642 [2020-01-16 18:31:11,835 INFO L226 Difference]: Without dead ends: 597 [2020-01-16 18:31:11,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-01-16 18:31:11,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2020-01-16 18:31:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-01-16 18:31:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1078 transitions. [2020-01-16 18:31:11,843 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1078 transitions. Word has length 19 [2020-01-16 18:31:11,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:11,844 INFO L478 AbstractCegarLoop]: Abstraction has 337 states and 1078 transitions. [2020-01-16 18:31:11,844 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:11,844 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1078 transitions. [2020-01-16 18:31:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:11,844 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:11,844 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:11,845 INFO L426 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-01-16 18:31:11,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:11,845 INFO L82 PathProgramCache]: Analyzing trace with hash 458482122, now seen corresponding path program 73 times [2020-01-16 18:31:11,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:11,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460184006] [2020-01-16 18:31:11,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:12,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460184006] [2020-01-16 18:31:12,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:12,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:12,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138445069] [2020-01-16 18:31:12,076 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:12,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:12,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:12,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:12,076 INFO L87 Difference]: Start difference. First operand 337 states and 1078 transitions. Second operand 8 states. [2020-01-16 18:31:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:12,137 INFO L93 Difference]: Finished difference Result 609 states and 1671 transitions. [2020-01-16 18:31:12,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:12,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:12,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:12,139 INFO L225 Difference]: With dead ends: 609 [2020-01-16 18:31:12,139 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 18:31:12,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:12,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 18:31:12,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 346. [2020-01-16 18:31:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-01-16 18:31:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1105 transitions. [2020-01-16 18:31:12,146 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1105 transitions. Word has length 19 [2020-01-16 18:31:12,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:12,146 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 1105 transitions. [2020-01-16 18:31:12,146 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1105 transitions. [2020-01-16 18:31:12,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:12,147 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:12,147 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:12,147 INFO L426 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-01-16 18:31:12,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:12,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1693244424, now seen corresponding path program 74 times [2020-01-16 18:31:12,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:12,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127902495] [2020-01-16 18:31:12,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:12,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127902495] [2020-01-16 18:31:12,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:12,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:12,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779171524] [2020-01-16 18:31:12,376 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:12,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:12,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:12,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:12,376 INFO L87 Difference]: Start difference. First operand 346 states and 1105 transitions. Second operand 8 states. [2020-01-16 18:31:12,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:12,479 INFO L93 Difference]: Finished difference Result 608 states and 1667 transitions. [2020-01-16 18:31:12,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:12,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:12,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:12,482 INFO L225 Difference]: With dead ends: 608 [2020-01-16 18:31:12,482 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 18:31:12,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-01-16 18:31:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 18:31:12,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 343. [2020-01-16 18:31:12,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-01-16 18:31:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1098 transitions. [2020-01-16 18:31:12,496 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1098 transitions. Word has length 19 [2020-01-16 18:31:12,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:12,496 INFO L478 AbstractCegarLoop]: Abstraction has 343 states and 1098 transitions. [2020-01-16 18:31:12,497 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1098 transitions. [2020-01-16 18:31:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:12,498 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:12,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:12,498 INFO L426 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-01-16 18:31:12,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:12,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1552573710, now seen corresponding path program 75 times [2020-01-16 18:31:12,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:12,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298044820] [2020-01-16 18:31:12,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:12,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298044820] [2020-01-16 18:31:12,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:12,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:12,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573447979] [2020-01-16 18:31:12,745 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:12,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:12,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:12,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:12,746 INFO L87 Difference]: Start difference. First operand 343 states and 1098 transitions. Second operand 8 states. [2020-01-16 18:31:12,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:12,808 INFO L93 Difference]: Finished difference Result 614 states and 1685 transitions. [2020-01-16 18:31:12,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:12,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:12,810 INFO L225 Difference]: With dead ends: 614 [2020-01-16 18:31:12,810 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 18:31:12,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-01-16 18:31:12,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 18:31:12,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 348. [2020-01-16 18:31:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-01-16 18:31:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1107 transitions. [2020-01-16 18:31:12,820 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1107 transitions. Word has length 19 [2020-01-16 18:31:12,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:12,821 INFO L478 AbstractCegarLoop]: Abstraction has 348 states and 1107 transitions. [2020-01-16 18:31:12,821 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1107 transitions. [2020-01-16 18:31:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:12,822 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:12,822 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:12,822 INFO L426 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-01-16 18:31:12,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:12,822 INFO L82 PathProgramCache]: Analyzing trace with hash 801511616, now seen corresponding path program 76 times [2020-01-16 18:31:12,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:12,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704424029] [2020-01-16 18:31:12,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:13,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704424029] [2020-01-16 18:31:13,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:13,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:13,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390813168] [2020-01-16 18:31:13,040 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:13,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:13,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:13,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:13,040 INFO L87 Difference]: Start difference. First operand 348 states and 1107 transitions. Second operand 8 states. [2020-01-16 18:31:13,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:13,131 INFO L93 Difference]: Finished difference Result 616 states and 1689 transitions. [2020-01-16 18:31:13,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:13,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:13,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:13,133 INFO L225 Difference]: With dead ends: 616 [2020-01-16 18:31:13,133 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 18:31:13,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 18:31:13,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 343. [2020-01-16 18:31:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-01-16 18:31:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1095 transitions. [2020-01-16 18:31:13,142 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1095 transitions. Word has length 19 [2020-01-16 18:31:13,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:13,142 INFO L478 AbstractCegarLoop]: Abstraction has 343 states and 1095 transitions. [2020-01-16 18:31:13,142 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1095 transitions. [2020-01-16 18:31:13,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:13,143 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:13,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-01-16 18:31:13,143 INFO L426 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-01-16 18:31:13,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:13,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1962158772, now seen corresponding path program 77 times [2020-01-16 18:31:13,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:13,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960778583] [2020-01-16 18:31:13,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:13,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-01-16 18:31:13,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960778583] [2020-01-16 18:31:13,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:13,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:13,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044880901] [2020-01-16 18:31:13,350 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:13,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:13,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:13,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:13,351 INFO L87 Difference]: Start difference. First operand 343 states and 1095 transitions. Second operand 8 states. [2020-01-16 18:31:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:13,440 INFO L93 Difference]: Finished difference Result 611 states and 1678 transitions. [2020-01-16 18:31:13,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:13,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:13,441 INFO L225 Difference]: With dead ends: 611 [2020-01-16 18:31:13,442 INFO L226 Difference]: Without dead ends: 581 [2020-01-16 18:31:13,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-01-16 18:31:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-01-16 18:31:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 347. [2020-01-16 18:31:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-01-16 18:31:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1103 transitions. [2020-01-16 18:31:13,449 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1103 transitions. Word has length 19 [2020-01-16 18:31:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:13,450 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 1103 transitions. [2020-01-16 18:31:13,450 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1103 transitions. [2020-01-16 18:31:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:13,450 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:13,451 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:13,451 INFO L426 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-01-16 18:31:13,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:13,451 INFO L82 PathProgramCache]: Analyzing trace with hash -622195216, now seen corresponding path program 78 times [2020-01-16 18:31:13,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:13,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736352746] [2020-01-16 18:31:13,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:13,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736352746] [2020-01-16 18:31:13,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:13,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:13,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292639922] [2020-01-16 18:31:13,660 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:13,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:13,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:13,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:13,660 INFO L87 Difference]: Start difference. First operand 347 states and 1103 transitions. Second operand 8 states. [2020-01-16 18:31:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:13,749 INFO L93 Difference]: Finished difference Result 614 states and 1684 transitions. [2020-01-16 18:31:13,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:13,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:13,751 INFO L225 Difference]: With dead ends: 614 [2020-01-16 18:31:13,751 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 18:31:13,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-01-16 18:31:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 18:31:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 340. [2020-01-16 18:31:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-01-16 18:31:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1088 transitions. [2020-01-16 18:31:13,759 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1088 transitions. Word has length 19 [2020-01-16 18:31:13,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:13,759 INFO L478 AbstractCegarLoop]: Abstraction has 340 states and 1088 transitions. [2020-01-16 18:31:13,759 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:13,760 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1088 transitions. [2020-01-16 18:31:13,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:13,760 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:13,760 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:13,760 INFO L426 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-01-16 18:31:13,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:13,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1910451096, now seen corresponding path program 79 times [2020-01-16 18:31:13,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:13,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839232525] [2020-01-16 18:31:13,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:13,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839232525] [2020-01-16 18:31:13,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:13,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:13,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595327155] [2020-01-16 18:31:13,965 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:13,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:13,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:13,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:13,965 INFO L87 Difference]: Start difference. First operand 340 states and 1088 transitions. Second operand 8 states. [2020-01-16 18:31:14,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:14,037 INFO L93 Difference]: Finished difference Result 614 states and 1683 transitions. [2020-01-16 18:31:14,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:14,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:14,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:14,039 INFO L225 Difference]: With dead ends: 614 [2020-01-16 18:31:14,039 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 18:31:14,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-01-16 18:31:14,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 18:31:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 346. [2020-01-16 18:31:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-01-16 18:31:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1102 transitions. [2020-01-16 18:31:14,047 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1102 transitions. Word has length 19 [2020-01-16 18:31:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:14,047 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 1102 transitions. [2020-01-16 18:31:14,047 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1102 transitions. [2020-01-16 18:31:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:14,048 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:14,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-01-16 18:31:14,048 INFO L426 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-01-16 18:31:14,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash 232789654, now seen corresponding path program 80 times [2020-01-16 18:31:14,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:14,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40380558] [2020-01-16 18:31:14,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:14,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40380558] [2020-01-16 18:31:14,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:14,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:14,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275667195] [2020-01-16 18:31:14,250 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:14,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:14,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:14,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:14,250 INFO L87 Difference]: Start difference. First operand 346 states and 1102 transitions. Second operand 8 states. [2020-01-16 18:31:14,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:14,333 INFO L93 Difference]: Finished difference Result 613 states and 1679 transitions. [2020-01-16 18:31:14,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:14,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:14,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:14,335 INFO L225 Difference]: With dead ends: 613 [2020-01-16 18:31:14,335 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 18:31:14,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-01-16 18:31:14,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 18:31:14,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 343. [2020-01-16 18:31:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-01-16 18:31:14,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1095 transitions. [2020-01-16 18:31:14,342 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1095 transitions. Word has length 19 [2020-01-16 18:31:14,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:14,342 INFO L478 AbstractCegarLoop]: Abstraction has 343 states and 1095 transitions. [2020-01-16 18:31:14,343 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:14,343 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1095 transitions. [2020-01-16 18:31:14,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:14,343 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:14,343 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:14,344 INFO L426 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-01-16 18:31:14,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:14,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1878169934, now seen corresponding path program 81 times [2020-01-16 18:31:14,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:14,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445418154] [2020-01-16 18:31:14,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:14,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445418154] [2020-01-16 18:31:14,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:14,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:14,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338839692] [2020-01-16 18:31:14,552 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:14,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:14,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:14,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:14,553 INFO L87 Difference]: Start difference. First operand 343 states and 1095 transitions. Second operand 8 states. [2020-01-16 18:31:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:14,633 INFO L93 Difference]: Finished difference Result 623 states and 1709 transitions. [2020-01-16 18:31:14,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:14,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:14,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:14,635 INFO L225 Difference]: With dead ends: 623 [2020-01-16 18:31:14,635 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 18:31:14,635 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:14,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 18:31:14,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 349. [2020-01-16 18:31:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:31:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1106 transitions. [2020-01-16 18:31:14,645 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1106 transitions. Word has length 19 [2020-01-16 18:31:14,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:14,645 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1106 transitions. [2020-01-16 18:31:14,645 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:14,645 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1106 transitions. [2020-01-16 18:31:14,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:14,646 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:14,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-01-16 18:31:14,646 INFO L426 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-01-16 18:31:14,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:14,647 INFO L82 PathProgramCache]: Analyzing trace with hash 901965184, now seen corresponding path program 82 times [2020-01-16 18:31:14,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:14,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675623087] [2020-01-16 18:31:14,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:14,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-01-16 18:31:14,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675623087] [2020-01-16 18:31:14,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:14,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:14,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842339162] [2020-01-16 18:31:14,889 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:14,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:14,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:14,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:14,890 INFO L87 Difference]: Start difference. First operand 349 states and 1106 transitions. Second operand 8 states. [2020-01-16 18:31:14,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:14,972 INFO L93 Difference]: Finished difference Result 628 states and 1721 transitions. [2020-01-16 18:31:14,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:14,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:14,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:14,974 INFO L225 Difference]: With dead ends: 628 [2020-01-16 18:31:14,974 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 18:31:14,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-01-16 18:31:14,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 18:31:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 343. [2020-01-16 18:31:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-01-16 18:31:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1092 transitions. [2020-01-16 18:31:14,986 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1092 transitions. Word has length 19 [2020-01-16 18:31:14,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:14,986 INFO L478 AbstractCegarLoop]: Abstraction has 343 states and 1092 transitions. [2020-01-16 18:31:14,986 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:14,987 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1092 transitions. [2020-01-16 18:31:14,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:14,987 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:14,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-01-16 18:31:14,988 INFO L426 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-01-16 18:31:14,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:14,988 INFO L82 PathProgramCache]: Analyzing trace with hash 348431156, now seen corresponding path program 83 times [2020-01-16 18:31:14,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:14,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70331624] [2020-01-16 18:31:14,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:15,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70331624] [2020-01-16 18:31:15,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:15,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:15,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959027051] [2020-01-16 18:31:15,186 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:15,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:15,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:15,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:15,187 INFO L87 Difference]: Start difference. First operand 343 states and 1092 transitions. Second operand 8 states. [2020-01-16 18:31:15,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:15,279 INFO L93 Difference]: Finished difference Result 620 states and 1702 transitions. [2020-01-16 18:31:15,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:15,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:15,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:15,281 INFO L225 Difference]: With dead ends: 620 [2020-01-16 18:31:15,281 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 18:31:15,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:15,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 18:31:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 348. [2020-01-16 18:31:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-01-16 18:31:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1102 transitions. [2020-01-16 18:31:15,291 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1102 transitions. Word has length 19 [2020-01-16 18:31:15,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:15,291 INFO L478 AbstractCegarLoop]: Abstraction has 348 states and 1102 transitions. [2020-01-16 18:31:15,291 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:15,291 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1102 transitions. [2020-01-16 18:31:15,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:15,292 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:15,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-01-16 18:31:15,293 INFO L426 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-01-16 18:31:15,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:15,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1380616178, now seen corresponding path program 84 times [2020-01-16 18:31:15,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:15,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065545353] [2020-01-16 18:31:15,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:15,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-01-16 18:31:15,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065545353] [2020-01-16 18:31:15,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:15,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:15,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010809458] [2020-01-16 18:31:15,509 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:15,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:15,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:15,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:15,509 INFO L87 Difference]: Start difference. First operand 348 states and 1102 transitions. Second operand 8 states. [2020-01-16 18:31:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:15,599 INFO L93 Difference]: Finished difference Result 626 states and 1716 transitions. [2020-01-16 18:31:15,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:15,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:15,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:15,601 INFO L225 Difference]: With dead ends: 626 [2020-01-16 18:31:15,601 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 18:31:15,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-01-16 18:31:15,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 18:31:15,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 340. [2020-01-16 18:31:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-01-16 18:31:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1085 transitions. [2020-01-16 18:31:15,610 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1085 transitions. Word has length 19 [2020-01-16 18:31:15,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:15,610 INFO L478 AbstractCegarLoop]: Abstraction has 340 states and 1085 transitions. [2020-01-16 18:31:15,611 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1085 transitions. [2020-01-16 18:31:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:15,611 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:15,611 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:15,612 INFO L426 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-01-16 18:31:15,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:15,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1259258648, now seen corresponding path program 85 times [2020-01-16 18:31:15,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:15,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203948536] [2020-01-16 18:31:15,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:15,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-01-16 18:31:15,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203948536] [2020-01-16 18:31:15,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:15,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:15,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540323325] [2020-01-16 18:31:15,822 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:15,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:15,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:15,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:15,822 INFO L87 Difference]: Start difference. First operand 340 states and 1085 transitions. Second operand 8 states. [2020-01-16 18:31:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:15,911 INFO L93 Difference]: Finished difference Result 629 states and 1736 transitions. [2020-01-16 18:31:15,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:15,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:15,912 INFO L225 Difference]: With dead ends: 629 [2020-01-16 18:31:15,913 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 18:31:15,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-01-16 18:31:15,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 18:31:15,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 350. [2020-01-16 18:31:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-01-16 18:31:15,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1113 transitions. [2020-01-16 18:31:15,920 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1113 transitions. Word has length 19 [2020-01-16 18:31:15,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:15,920 INFO L478 AbstractCegarLoop]: Abstraction has 350 states and 1113 transitions. [2020-01-16 18:31:15,920 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:15,920 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1113 transitions. [2020-01-16 18:31:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:15,921 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:15,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-01-16 18:31:15,921 INFO L426 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-01-16 18:31:15,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:15,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2010320742, now seen corresponding path program 86 times [2020-01-16 18:31:15,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:15,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607612274] [2020-01-16 18:31:15,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:16,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607612274] [2020-01-16 18:31:16,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:16,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:16,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930432990] [2020-01-16 18:31:16,123 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:16,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:16,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:16,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:16,123 INFO L87 Difference]: Start difference. First operand 350 states and 1113 transitions. Second operand 8 states. [2020-01-16 18:31:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:16,231 INFO L93 Difference]: Finished difference Result 631 states and 1740 transitions. [2020-01-16 18:31:16,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:16,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:16,233 INFO L225 Difference]: With dead ends: 631 [2020-01-16 18:31:16,233 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 18:31:16,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 18:31:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 345. [2020-01-16 18:31:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:31:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1099 transitions. [2020-01-16 18:31:16,241 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1099 transitions. Word has length 19 [2020-01-16 18:31:16,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:16,241 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1099 transitions. [2020-01-16 18:31:16,241 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:16,242 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1099 transitions. [2020-01-16 18:31:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:16,242 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31: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-01-16 18:31:16,242 INFO L426 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-01-16 18:31:16,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:16,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1435270794, now seen corresponding path program 87 times [2020-01-16 18:31:16,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:16,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769566873] [2020-01-16 18:31:16,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:16,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769566873] [2020-01-16 18:31:16,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:16,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:16,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023557251] [2020-01-16 18:31:16,444 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:16,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:16,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:16,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:16,445 INFO L87 Difference]: Start difference. First operand 345 states and 1099 transitions. Second operand 8 states. [2020-01-16 18:31:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:16,516 INFO L93 Difference]: Finished difference Result 633 states and 1743 transitions. [2020-01-16 18:31:16,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:16,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:16,518 INFO L225 Difference]: With dead ends: 633 [2020-01-16 18:31:16,518 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 18:31:16,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 18:31:16,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 351. [2020-01-16 18:31:16,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-01-16 18:31:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1110 transitions. [2020-01-16 18:31:16,526 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1110 transitions. Word has length 19 [2020-01-16 18:31:16,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:16,527 INFO L478 AbstractCegarLoop]: Abstraction has 351 states and 1110 transitions. [2020-01-16 18:31:16,527 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1110 transitions. [2020-01-16 18:31:16,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:16,528 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:16,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-01-16 18:31:16,528 INFO L426 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-01-16 18:31:16,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:16,529 INFO L82 PathProgramCache]: Analyzing trace with hash 459066044, now seen corresponding path program 88 times [2020-01-16 18:31:16,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:16,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182089422] [2020-01-16 18:31:16,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:16,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:16,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182089422] [2020-01-16 18:31:16,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:16,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:16,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356665577] [2020-01-16 18:31:16,761 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:16,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:16,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:16,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:16,761 INFO L87 Difference]: Start difference. First operand 351 states and 1110 transitions. Second operand 8 states. [2020-01-16 18:31:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:16,853 INFO L93 Difference]: Finished difference Result 638 states and 1755 transitions. [2020-01-16 18:31:16,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:16,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:16,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:16,855 INFO L225 Difference]: With dead ends: 638 [2020-01-16 18:31:16,855 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 18:31:16,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:16,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 18:31:16,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 345. [2020-01-16 18:31:16,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:31:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1094 transitions. [2020-01-16 18:31:16,864 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1094 transitions. Word has length 19 [2020-01-16 18:31:16,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:16,864 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1094 transitions. [2020-01-16 18:31:16,864 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1094 transitions. [2020-01-16 18:31:16,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:16,865 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:16,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-01-16 18:31:16,865 INFO L426 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-01-16 18:31:16,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:16,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2087070376, now seen corresponding path program 89 times [2020-01-16 18:31:16,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:16,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074505378] [2020-01-16 18:31:16,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:17,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074505378] [2020-01-16 18:31:17,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:17,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:17,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356653207] [2020-01-16 18:31:17,086 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:17,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:17,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:17,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:17,087 INFO L87 Difference]: Start difference. First operand 345 states and 1094 transitions. Second operand 8 states. [2020-01-16 18:31:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:17,187 INFO L93 Difference]: Finished difference Result 639 states and 1767 transitions. [2020-01-16 18:31:17,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:17,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:17,189 INFO L225 Difference]: With dead ends: 639 [2020-01-16 18:31:17,189 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 18:31:17,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-01-16 18:31:17,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 18:31:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 353. [2020-01-16 18:31:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-01-16 18:31:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1114 transitions. [2020-01-16 18:31:17,197 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1114 transitions. Word has length 19 [2020-01-16 18:31:17,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:17,197 INFO L478 AbstractCegarLoop]: Abstraction has 353 states and 1114 transitions. [2020-01-16 18:31:17,197 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:17,197 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1114 transitions. [2020-01-16 18:31:17,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:17,198 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:17,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:17,198 INFO L426 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-01-16 18:31:17,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:17,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1349022390, now seen corresponding path program 90 times [2020-01-16 18:31:17,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:17,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641629470] [2020-01-16 18:31:17,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:17,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-01-16 18:31:17,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641629470] [2020-01-16 18:31:17,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:17,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:17,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78275307] [2020-01-16 18:31:17,399 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:17,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:17,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:17,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:17,400 INFO L87 Difference]: Start difference. First operand 353 states and 1114 transitions. Second operand 8 states. [2020-01-16 18:31:17,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:17,489 INFO L93 Difference]: Finished difference Result 642 states and 1768 transitions. [2020-01-16 18:31:17,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:17,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:17,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:17,491 INFO L225 Difference]: With dead ends: 642 [2020-01-16 18:31:17,491 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 18:31:17,492 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:17,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 18:31:17,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 340. [2020-01-16 18:31:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-01-16 18:31:17,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1082 transitions. [2020-01-16 18:31:17,500 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1082 transitions. Word has length 19 [2020-01-16 18:31:17,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:17,500 INFO L478 AbstractCegarLoop]: Abstraction has 340 states and 1082 transitions. [2020-01-16 18:31:17,500 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1082 transitions. [2020-01-16 18:31:17,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:17,501 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:17,501 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:17,501 INFO L426 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-01-16 18:31:17,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:17,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1252078038, now seen corresponding path program 91 times [2020-01-16 18:31:17,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:17,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554123636] [2020-01-16 18:31:17,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:17,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554123636] [2020-01-16 18:31:17,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:17,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:17,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412555335] [2020-01-16 18:31:17,728 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:17,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:17,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:17,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:17,729 INFO L87 Difference]: Start difference. First operand 340 states and 1082 transitions. Second operand 8 states. [2020-01-16 18:31:17,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:17,821 INFO L93 Difference]: Finished difference Result 622 states and 1721 transitions. [2020-01-16 18:31:17,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:17,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:17,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:17,822 INFO L225 Difference]: With dead ends: 622 [2020-01-16 18:31:17,822 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 18:31:17,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-01-16 18:31:17,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 18:31:17,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 348. [2020-01-16 18:31:17,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-01-16 18:31:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1106 transitions. [2020-01-16 18:31:17,829 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1106 transitions. Word has length 19 [2020-01-16 18:31:17,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:17,829 INFO L478 AbstractCegarLoop]: Abstraction has 348 states and 1106 transitions. [2020-01-16 18:31:17,829 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:17,829 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1106 transitions. [2020-01-16 18:31:17,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:17,830 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:17,830 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:17,830 INFO L426 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-01-16 18:31:17,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:17,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1332275950, now seen corresponding path program 92 times [2020-01-16 18:31:17,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:17,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267620024] [2020-01-16 18:31:17,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:18,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267620024] [2020-01-16 18:31:18,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:18,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:18,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256974397] [2020-01-16 18:31:18,033 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:18,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:18,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:18,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:18,033 INFO L87 Difference]: Start difference. First operand 348 states and 1106 transitions. Second operand 8 states. [2020-01-16 18:31:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:18,120 INFO L93 Difference]: Finished difference Result 625 states and 1727 transitions. [2020-01-16 18:31:18,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:18,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:18,122 INFO L225 Difference]: With dead ends: 625 [2020-01-16 18:31:18,122 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 18:31:18,122 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:18,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 18:31:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 344. [2020-01-16 18:31:18,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-01-16 18:31:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1094 transitions. [2020-01-16 18:31:18,129 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1094 transitions. Word has length 19 [2020-01-16 18:31:18,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:18,130 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 1094 transitions. [2020-01-16 18:31:18,130 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1094 transitions. [2020-01-16 18:31:18,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:18,130 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:18,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-01-16 18:31:18,131 INFO L426 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-01-16 18:31:18,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:18,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1996780536, now seen corresponding path program 93 times [2020-01-16 18:31:18,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:18,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75957310] [2020-01-16 18:31:18,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:18,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:18,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75957310] [2020-01-16 18:31:18,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:18,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:18,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412863795] [2020-01-16 18:31:18,341 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:18,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:18,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:18,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:18,342 INFO L87 Difference]: Start difference. First operand 344 states and 1094 transitions. Second operand 8 states. [2020-01-16 18:31:18,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:18,450 INFO L93 Difference]: Finished difference Result 626 states and 1729 transitions. [2020-01-16 18:31:18,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:18,450 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:18,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:18,451 INFO L225 Difference]: With dead ends: 626 [2020-01-16 18:31:18,451 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 18:31:18,451 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:18,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 18:31:18,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 349. [2020-01-16 18:31:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:31:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1104 transitions. [2020-01-16 18:31:18,459 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1104 transitions. Word has length 19 [2020-01-16 18:31:18,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:18,459 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1104 transitions. [2020-01-16 18:31:18,459 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1104 transitions. [2020-01-16 18:31:18,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:18,460 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:18,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-01-16 18:31:18,460 INFO L426 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-01-16 18:31:18,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:18,461 INFO L82 PathProgramCache]: Analyzing trace with hash 267733202, now seen corresponding path program 94 times [2020-01-16 18:31:18,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:18,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500290195] [2020-01-16 18:31:18,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:18,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500290195] [2020-01-16 18:31:18,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:18,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:18,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444968366] [2020-01-16 18:31:18,645 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:18,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:18,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:18,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:18,646 INFO L87 Difference]: Start difference. First operand 349 states and 1104 transitions. Second operand 8 states. [2020-01-16 18:31:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:18,732 INFO L93 Difference]: Finished difference Result 632 states and 1743 transitions. [2020-01-16 18:31:18,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:18,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:18,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:18,733 INFO L225 Difference]: With dead ends: 632 [2020-01-16 18:31:18,734 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 18:31:18,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:18,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 18:31:18,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 344. [2020-01-16 18:31:18,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-01-16 18:31:18,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1090 transitions. [2020-01-16 18:31:18,741 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1090 transitions. Word has length 19 [2020-01-16 18:31:18,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:18,742 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 1090 transitions. [2020-01-16 18:31:18,742 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1090 transitions. [2020-01-16 18:31:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:18,742 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:18,742 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:18,742 INFO L426 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-01-16 18:31:18,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:18,743 INFO L82 PathProgramCache]: Analyzing trace with hash 901831544, now seen corresponding path program 95 times [2020-01-16 18:31:18,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:18,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277333886] [2020-01-16 18:31:18,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:18,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277333886] [2020-01-16 18:31:18,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:18,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:18,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280782662] [2020-01-16 18:31:18,974 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:18,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:18,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:18,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:18,974 INFO L87 Difference]: Start difference. First operand 344 states and 1090 transitions. Second operand 8 states. [2020-01-16 18:31:19,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:19,044 INFO L93 Difference]: Finished difference Result 635 states and 1758 transitions. [2020-01-16 18:31:19,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:19,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:19,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:19,046 INFO L225 Difference]: With dead ends: 635 [2020-01-16 18:31:19,046 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 18:31:19,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 18:31:19,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 352. [2020-01-16 18:31:19,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-01-16 18:31:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1110 transitions. [2020-01-16 18:31:19,055 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1110 transitions. Word has length 19 [2020-01-16 18:31:19,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:19,055 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 1110 transitions. [2020-01-16 18:31:19,055 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:19,055 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1110 transitions. [2020-01-16 18:31:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:19,056 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:19,056 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:19,056 INFO L426 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-01-16 18:31:19,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:19,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1757138198, now seen corresponding path program 96 times [2020-01-16 18:31:19,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:19,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097439231] [2020-01-16 18:31:19,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:19,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097439231] [2020-01-16 18:31:19,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:19,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:19,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632350505] [2020-01-16 18:31:19,283 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:19,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:19,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:19,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:19,284 INFO L87 Difference]: Start difference. First operand 352 states and 1110 transitions. Second operand 8 states. [2020-01-16 18:31:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:19,391 INFO L93 Difference]: Finished difference Result 638 states and 1759 transitions. [2020-01-16 18:31:19,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:19,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:19,393 INFO L225 Difference]: With dead ends: 638 [2020-01-16 18:31:19,393 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 18:31:19,393 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:19,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 18:31:19,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 337. [2020-01-16 18:31:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-01-16 18:31:19,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1075 transitions. [2020-01-16 18:31:19,403 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1075 transitions. Word has length 19 [2020-01-16 18:31:19,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:19,403 INFO L478 AbstractCegarLoop]: Abstraction has 337 states and 1075 transitions. [2020-01-16 18:31:19,403 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1075 transitions. [2020-01-16 18:31:19,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:19,404 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:19,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-01-16 18:31:19,405 INFO L426 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-01-16 18:31:19,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:19,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1665827752, now seen corresponding path program 97 times [2020-01-16 18:31:19,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:19,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384170476] [2020-01-16 18:31:19,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:19,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384170476] [2020-01-16 18:31:19,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:19,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:19,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506661126] [2020-01-16 18:31:19,575 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:19,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:19,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:19,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:19,576 INFO L87 Difference]: Start difference. First operand 337 states and 1075 transitions. Second operand 8 states. [2020-01-16 18:31:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:19,665 INFO L93 Difference]: Finished difference Result 676 states and 1927 transitions. [2020-01-16 18:31:19,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:19,665 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:19,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:19,667 INFO L225 Difference]: With dead ends: 676 [2020-01-16 18:31:19,667 INFO L226 Difference]: Without dead ends: 636 [2020-01-16 18:31:19,667 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-01-16 18:31:19,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-01-16 18:31:19,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 351. [2020-01-16 18:31:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-01-16 18:31:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1123 transitions. [2020-01-16 18:31:19,675 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1123 transitions. Word has length 19 [2020-01-16 18:31:19,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:19,675 INFO L478 AbstractCegarLoop]: Abstraction has 351 states and 1123 transitions. [2020-01-16 18:31:19,675 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1123 transitions. [2020-01-16 18:31:19,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:19,676 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:19,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-01-16 18:31:19,676 INFO L426 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-01-16 18:31:19,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:19,677 INFO L82 PathProgramCache]: Analyzing trace with hash 791492426, now seen corresponding path program 98 times [2020-01-16 18:31:19,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:19,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620441520] [2020-01-16 18:31:19,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:19,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620441520] [2020-01-16 18:31:19,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:19,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:19,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774291824] [2020-01-16 18:31:19,873 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:19,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:19,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:19,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:19,873 INFO L87 Difference]: Start difference. First operand 351 states and 1123 transitions. Second operand 8 states. [2020-01-16 18:31:19,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:19,957 INFO L93 Difference]: Finished difference Result 666 states and 1890 transitions. [2020-01-16 18:31:19,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:19,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:19,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:19,960 INFO L225 Difference]: With dead ends: 666 [2020-01-16 18:31:19,960 INFO L226 Difference]: Without dead ends: 630 [2020-01-16 18:31:19,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-01-16 18:31:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-01-16 18:31:19,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 345. [2020-01-16 18:31:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:31:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1107 transitions. [2020-01-16 18:31:19,969 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1107 transitions. Word has length 19 [2020-01-16 18:31:19,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:19,969 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1107 transitions. [2020-01-16 18:31:19,969 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1107 transitions. [2020-01-16 18:31:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:19,970 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:19,970 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:19,970 INFO L426 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-01-16 18:31:19,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:19,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1139734548, now seen corresponding path program 99 times [2020-01-16 18:31:19,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:19,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019512092] [2020-01-16 18:31:19,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:20,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019512092] [2020-01-16 18:31:20,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:20,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:20,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943808661] [2020-01-16 18:31:20,153 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:20,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:20,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:20,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:20,154 INFO L87 Difference]: Start difference. First operand 345 states and 1107 transitions. Second operand 8 states. [2020-01-16 18:31:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:20,243 INFO L93 Difference]: Finished difference Result 682 states and 1946 transitions. [2020-01-16 18:31:20,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:20,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:20,246 INFO L225 Difference]: With dead ends: 682 [2020-01-16 18:31:20,246 INFO L226 Difference]: Without dead ends: 642 [2020-01-16 18:31:20,246 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:20,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-01-16 18:31:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 354. [2020-01-16 18:31:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-01-16 18:31:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1129 transitions. [2020-01-16 18:31:20,255 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1129 transitions. Word has length 19 [2020-01-16 18:31:20,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:20,255 INFO L478 AbstractCegarLoop]: Abstraction has 354 states and 1129 transitions. [2020-01-16 18:31:20,255 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1129 transitions. [2020-01-16 18:31:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:20,256 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:20,256 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:20,256 INFO L426 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-01-16 18:31:20,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:20,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1885031692, now seen corresponding path program 100 times [2020-01-16 18:31:20,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:20,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774691204] [2020-01-16 18:31:20,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:20,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774691204] [2020-01-16 18:31:20,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:20,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:20,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027718790] [2020-01-16 18:31:20,451 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:20,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:20,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:20,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:20,452 INFO L87 Difference]: Start difference. First operand 354 states and 1129 transitions. Second operand 8 states. [2020-01-16 18:31:20,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:20,560 INFO L93 Difference]: Finished difference Result 675 states and 1916 transitions. [2020-01-16 18:31:20,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:20,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:20,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:20,562 INFO L225 Difference]: With dead ends: 675 [2020-01-16 18:31:20,562 INFO L226 Difference]: Without dead ends: 633 [2020-01-16 18:31:20,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-01-16 18:31:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 345. [2020-01-16 18:31:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:31:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1103 transitions. [2020-01-16 18:31:20,570 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1103 transitions. Word has length 19 [2020-01-16 18:31:20,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:20,570 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1103 transitions. [2020-01-16 18:31:20,570 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:20,570 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1103 transitions. [2020-01-16 18:31:20,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:20,571 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:20,571 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:20,571 INFO L426 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-01-16 18:31:20,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:20,571 INFO L82 PathProgramCache]: Analyzing trace with hash 220037620, now seen corresponding path program 101 times [2020-01-16 18:31:20,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:20,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729449447] [2020-01-16 18:31:20,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:20,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729449447] [2020-01-16 18:31:20,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:20,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:20,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786048508] [2020-01-16 18:31:20,757 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:20,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:20,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:20,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:20,757 INFO L87 Difference]: Start difference. First operand 345 states and 1103 transitions. Second operand 8 states. [2020-01-16 18:31:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:20,837 INFO L93 Difference]: Finished difference Result 657 states and 1861 transitions. [2020-01-16 18:31:20,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:20,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:20,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:20,839 INFO L225 Difference]: With dead ends: 657 [2020-01-16 18:31:20,839 INFO L226 Difference]: Without dead ends: 627 [2020-01-16 18:31:20,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:20,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-01-16 18:31:20,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 349. [2020-01-16 18:31:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:31:20,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1111 transitions. [2020-01-16 18:31:20,848 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1111 transitions. Word has length 19 [2020-01-16 18:31:20,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:20,848 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1111 transitions. [2020-01-16 18:31:20,848 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1111 transitions. [2020-01-16 18:31:20,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:20,849 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:20,849 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:20,849 INFO L426 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-01-16 18:31:20,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:20,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1930650928, now seen corresponding path program 102 times [2020-01-16 18:31:20,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:20,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985052423] [2020-01-16 18:31:20,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:21,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:21,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985052423] [2020-01-16 18:31:21,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:21,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:21,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194713205] [2020-01-16 18:31:21,037 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:21,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:21,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:21,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:21,037 INFO L87 Difference]: Start difference. First operand 349 states and 1111 transitions. Second operand 8 states. [2020-01-16 18:31:21,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:21,128 INFO L93 Difference]: Finished difference Result 660 states and 1867 transitions. [2020-01-16 18:31:21,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:21,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:21,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:21,131 INFO L225 Difference]: With dead ends: 660 [2020-01-16 18:31:21,131 INFO L226 Difference]: Without dead ends: 619 [2020-01-16 18:31:21,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:21,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-01-16 18:31:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 341. [2020-01-16 18:31:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:31:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1091 transitions. [2020-01-16 18:31:21,138 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1091 transitions. Word has length 19 [2020-01-16 18:31:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:21,138 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1091 transitions. [2020-01-16 18:31:21,138 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:21,138 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1091 transitions. [2020-01-16 18:31:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:21,139 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:21,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-01-16 18:31:21,139 INFO L426 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-01-16 18:31:21,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:21,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1018198586, now seen corresponding path program 103 times [2020-01-16 18:31:21,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:21,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599114572] [2020-01-16 18:31:21,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:21,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599114572] [2020-01-16 18:31:21,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:21,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:21,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060447604] [2020-01-16 18:31:21,309 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:21,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:21,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:21,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:21,309 INFO L87 Difference]: Start difference. First operand 341 states and 1091 transitions. Second operand 8 states. [2020-01-16 18:31:21,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:21,397 INFO L93 Difference]: Finished difference Result 684 states and 1951 transitions. [2020-01-16 18:31:21,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:21,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:21,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:21,399 INFO L225 Difference]: With dead ends: 684 [2020-01-16 18:31:21,399 INFO L226 Difference]: Without dead ends: 644 [2020-01-16 18:31:21,399 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-01-16 18:31:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-01-16 18:31:21,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 352. [2020-01-16 18:31:21,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-01-16 18:31:21,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1123 transitions. [2020-01-16 18:31:21,409 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1123 transitions. Word has length 19 [2020-01-16 18:31:21,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:21,409 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 1123 transitions. [2020-01-16 18:31:21,409 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:21,409 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1123 transitions. [2020-01-16 18:31:21,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:21,410 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:21,410 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:21,410 INFO L426 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-01-16 18:31:21,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:21,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1892533912, now seen corresponding path program 104 times [2020-01-16 18:31:21,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:21,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968627193] [2020-01-16 18:31:21,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:21,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-01-16 18:31:21,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968627193] [2020-01-16 18:31:21,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:21,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:21,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650087776] [2020-01-16 18:31:21,656 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:21,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:21,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:21,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:21,657 INFO L87 Difference]: Start difference. First operand 352 states and 1123 transitions. Second operand 8 states. [2020-01-16 18:31:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:21,765 INFO L93 Difference]: Finished difference Result 674 states and 1914 transitions. [2020-01-16 18:31:21,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:21,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:21,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:21,767 INFO L225 Difference]: With dead ends: 674 [2020-01-16 18:31:21,767 INFO L226 Difference]: Without dead ends: 638 [2020-01-16 18:31:21,767 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-01-16 18:31:21,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 346. [2020-01-16 18:31:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-01-16 18:31:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1106 transitions. [2020-01-16 18:31:21,781 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1106 transitions. Word has length 19 [2020-01-16 18:31:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:21,781 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 1106 transitions. [2020-01-16 18:31:21,781 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1106 transitions. [2020-01-16 18:31:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:21,787 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:21,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-01-16 18:31:21,789 INFO L426 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-01-16 18:31:21,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:21,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1215908908, now seen corresponding path program 105 times [2020-01-16 18:31:21,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:21,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678925307] [2020-01-16 18:31:21,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:22,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678925307] [2020-01-16 18:31:22,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:22,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:22,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584350341] [2020-01-16 18:31:22,036 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:22,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:22,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:22,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:22,037 INFO L87 Difference]: Start difference. First operand 346 states and 1106 transitions. Second operand 8 states. [2020-01-16 18:31:22,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:22,114 INFO L93 Difference]: Finished difference Result 696 states and 1990 transitions. [2020-01-16 18:31:22,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:22,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:22,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:22,116 INFO L225 Difference]: With dead ends: 696 [2020-01-16 18:31:22,116 INFO L226 Difference]: Without dead ends: 656 [2020-01-16 18:31:22,116 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-01-16 18:31:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 358. [2020-01-16 18:31:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2020-01-16 18:31:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1137 transitions. [2020-01-16 18:31:22,126 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 1137 transitions. Word has length 19 [2020-01-16 18:31:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:22,126 INFO L478 AbstractCegarLoop]: Abstraction has 358 states and 1137 transitions. [2020-01-16 18:31:22,126 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 1137 transitions. [2020-01-16 18:31:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:22,127 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:22,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-01-16 18:31:22,127 INFO L426 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-01-16 18:31:22,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:22,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2110174348, now seen corresponding path program 106 times [2020-01-16 18:31:22,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:22,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669331053] [2020-01-16 18:31:22,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:22,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669331053] [2020-01-16 18:31:22,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:22,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:22,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718800396] [2020-01-16 18:31:22,320 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:22,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:22,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:22,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:22,321 INFO L87 Difference]: Start difference. First operand 358 states and 1137 transitions. Second operand 8 states. [2020-01-16 18:31:22,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:22,409 INFO L93 Difference]: Finished difference Result 692 states and 1966 transitions. [2020-01-16 18:31:22,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:22,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:22,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:22,411 INFO L225 Difference]: With dead ends: 692 [2020-01-16 18:31:22,411 INFO L226 Difference]: Without dead ends: 644 [2020-01-16 18:31:22,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-01-16 18:31:22,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-01-16 18:31:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 346. [2020-01-16 18:31:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-01-16 18:31:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1101 transitions. [2020-01-16 18:31:22,419 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1101 transitions. Word has length 19 [2020-01-16 18:31:22,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:22,419 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 1101 transitions. [2020-01-16 18:31:22,419 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:22,419 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1101 transitions. [2020-01-16 18:31:22,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:22,420 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:22,420 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:22,420 INFO L426 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-01-16 18:31:22,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:22,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1719286220, now seen corresponding path program 107 times [2020-01-16 18:31:22,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:22,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858540903] [2020-01-16 18:31:22,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:22,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858540903] [2020-01-16 18:31:22,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:22,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:22,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726329329] [2020-01-16 18:31:22,607 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:22,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:22,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:22,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:22,607 INFO L87 Difference]: Start difference. First operand 346 states and 1101 transitions. Second operand 8 states. [2020-01-16 18:31:22,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:22,687 INFO L93 Difference]: Finished difference Result 669 states and 1895 transitions. [2020-01-16 18:31:22,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:22,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:22,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:22,688 INFO L225 Difference]: With dead ends: 669 [2020-01-16 18:31:22,689 INFO L226 Difference]: Without dead ends: 639 [2020-01-16 18:31:22,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-01-16 18:31:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-01-16 18:31:22,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 351. [2020-01-16 18:31:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-01-16 18:31:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1111 transitions. [2020-01-16 18:31:22,698 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1111 transitions. Word has length 19 [2020-01-16 18:31:22,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:22,698 INFO L478 AbstractCegarLoop]: Abstraction has 351 states and 1111 transitions. [2020-01-16 18:31:22,698 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:22,699 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1111 transitions. [2020-01-16 18:31:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:22,699 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:22,699 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:22,700 INFO L426 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-01-16 18:31:22,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:22,700 INFO L82 PathProgramCache]: Analyzing trace with hash 846633742, now seen corresponding path program 108 times [2020-01-16 18:31:22,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:22,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536705308] [2020-01-16 18:31:22,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:22,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536705308] [2020-01-16 18:31:22,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:22,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:22,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654010625] [2020-01-16 18:31:22,886 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:22,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:22,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:22,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:22,886 INFO L87 Difference]: Start difference. First operand 351 states and 1111 transitions. Second operand 8 states. [2020-01-16 18:31:22,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:22,966 INFO L93 Difference]: Finished difference Result 675 states and 1909 transitions. [2020-01-16 18:31:22,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:22,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:22,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:22,968 INFO L225 Difference]: With dead ends: 675 [2020-01-16 18:31:22,969 INFO L226 Difference]: Without dead ends: 629 [2020-01-16 18:31:22,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:22,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-01-16 18:31:22,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 341. [2020-01-16 18:31:22,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:31:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1087 transitions. [2020-01-16 18:31:22,977 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1087 transitions. Word has length 19 [2020-01-16 18:31:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:22,977 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1087 transitions. [2020-01-16 18:31:22,977 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1087 transitions. [2020-01-16 18:31:22,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:22,977 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:22,977 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:22,978 INFO L426 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-01-16 18:31:22,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:22,978 INFO L82 PathProgramCache]: Analyzing trace with hash -601878970, now seen corresponding path program 109 times [2020-01-16 18:31:22,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:22,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023021670] [2020-01-16 18:31:22,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:23,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:23,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023021670] [2020-01-16 18:31:23,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:23,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:23,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157597821] [2020-01-16 18:31:23,177 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:23,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:23,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:23,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:23,178 INFO L87 Difference]: Start difference. First operand 341 states and 1087 transitions. Second operand 8 states. [2020-01-16 18:31:23,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:23,260 INFO L93 Difference]: Finished difference Result 702 states and 2022 transitions. [2020-01-16 18:31:23,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:23,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:23,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:23,262 INFO L225 Difference]: With dead ends: 702 [2020-01-16 18:31:23,263 INFO L226 Difference]: Without dead ends: 662 [2020-01-16 18:31:23,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-01-16 18:31:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-01-16 18:31:23,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 358. [2020-01-16 18:31:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2020-01-16 18:31:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1145 transitions. [2020-01-16 18:31:23,270 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 1145 transitions. Word has length 19 [2020-01-16 18:31:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:23,270 INFO L478 AbstractCegarLoop]: Abstraction has 358 states and 1145 transitions. [2020-01-16 18:31:23,270 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:23,270 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 1145 transitions. [2020-01-16 18:31:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:23,271 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:23,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-01-16 18:31:23,271 INFO L426 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-01-16 18:31:23,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:23,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1347176114, now seen corresponding path program 110 times [2020-01-16 18:31:23,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:23,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205171359] [2020-01-16 18:31:23,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:23,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:23,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205171359] [2020-01-16 18:31:23,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:23,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:23,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010389363] [2020-01-16 18:31:23,461 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:23,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:23,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:23,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:23,462 INFO L87 Difference]: Start difference. First operand 358 states and 1145 transitions. Second operand 8 states. [2020-01-16 18:31:23,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:23,539 INFO L93 Difference]: Finished difference Result 695 states and 1992 transitions. [2020-01-16 18:31:23,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:23,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:23,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:23,541 INFO L225 Difference]: With dead ends: 695 [2020-01-16 18:31:23,541 INFO L226 Difference]: Without dead ends: 653 [2020-01-16 18:31:23,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-01-16 18:31:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 349. [2020-01-16 18:31:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:31:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1115 transitions. [2020-01-16 18:31:23,550 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1115 transitions. Word has length 19 [2020-01-16 18:31:23,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:23,550 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1115 transitions. [2020-01-16 18:31:23,550 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:23,550 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1115 transitions. [2020-01-16 18:31:23,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:23,551 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:23,551 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:23,551 INFO L426 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-01-16 18:31:23,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:23,551 INFO L82 PathProgramCache]: Analyzing trace with hash 142823528, now seen corresponding path program 111 times [2020-01-16 18:31:23,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:23,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573339793] [2020-01-16 18:31:23,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:23,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573339793] [2020-01-16 18:31:23,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:23,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:23,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669081299] [2020-01-16 18:31:23,765 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:23,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:23,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:23,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:23,765 INFO L87 Difference]: Start difference. First operand 349 states and 1115 transitions. Second operand 8 states. [2020-01-16 18:31:23,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:23,850 INFO L93 Difference]: Finished difference Result 708 states and 2035 transitions. [2020-01-16 18:31:23,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:23,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:23,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:23,852 INFO L225 Difference]: With dead ends: 708 [2020-01-16 18:31:23,852 INFO L226 Difference]: Without dead ends: 668 [2020-01-16 18:31:23,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-01-16 18:31:23,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-01-16 18:31:23,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 361. [2020-01-16 18:31:23,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2020-01-16 18:31:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 1146 transitions. [2020-01-16 18:31:23,860 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 1146 transitions. Word has length 19 [2020-01-16 18:31:23,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:23,860 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 1146 transitions. [2020-01-16 18:31:23,860 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 1146 transitions. [2020-01-16 18:31:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:23,861 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:23,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:23,861 INFO L426 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-01-16 18:31:23,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:23,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1111707568, now seen corresponding path program 112 times [2020-01-16 18:31:23,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:23,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459010385] [2020-01-16 18:31:23,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:24,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459010385] [2020-01-16 18:31:24,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:24,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:24,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439961158] [2020-01-16 18:31:24,120 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:24,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:24,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:24,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:24,121 INFO L87 Difference]: Start difference. First operand 361 states and 1146 transitions. Second operand 8 states. [2020-01-16 18:31:24,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:24,217 INFO L93 Difference]: Finished difference Result 704 states and 2011 transitions. [2020-01-16 18:31:24,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:24,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:24,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:24,219 INFO L225 Difference]: With dead ends: 704 [2020-01-16 18:31:24,219 INFO L226 Difference]: Without dead ends: 656 [2020-01-16 18:31:24,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-01-16 18:31:24,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 349. [2020-01-16 18:31:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:31:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1107 transitions. [2020-01-16 18:31:24,228 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1107 transitions. Word has length 19 [2020-01-16 18:31:24,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:24,229 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1107 transitions. [2020-01-16 18:31:24,229 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:24,229 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1107 transitions. [2020-01-16 18:31:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:24,230 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:24,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-01-16 18:31:24,230 INFO L426 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-01-16 18:31:24,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:24,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1376541946, now seen corresponding path program 113 times [2020-01-16 18:31:24,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:24,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918565711] [2020-01-16 18:31:24,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:24,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918565711] [2020-01-16 18:31:24,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:24,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:24,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561210142] [2020-01-16 18:31:24,431 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:24,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:24,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:24,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:24,431 INFO L87 Difference]: Start difference. First operand 349 states and 1107 transitions. Second operand 8 states. [2020-01-16 18:31:24,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:24,513 INFO L93 Difference]: Finished difference Result 690 states and 1970 transitions. [2020-01-16 18:31:24,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:24,513 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:24,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:24,515 INFO L225 Difference]: With dead ends: 690 [2020-01-16 18:31:24,515 INFO L226 Difference]: Without dead ends: 657 [2020-01-16 18:31:24,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-01-16 18:31:24,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-01-16 18:31:24,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 357. [2020-01-16 18:31:24,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2020-01-16 18:31:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1127 transitions. [2020-01-16 18:31:24,525 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1127 transitions. Word has length 19 [2020-01-16 18:31:24,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:24,526 INFO L478 AbstractCegarLoop]: Abstraction has 357 states and 1127 transitions. [2020-01-16 18:31:24,526 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1127 transitions. [2020-01-16 18:31:24,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:24,527 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:24,527 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:24,527 INFO L426 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-01-16 18:31:24,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:24,527 INFO L82 PathProgramCache]: Analyzing trace with hash -517667416, now seen corresponding path program 114 times [2020-01-16 18:31:24,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:24,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319325686] [2020-01-16 18:31:24,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:24,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-01-16 18:31:24,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319325686] [2020-01-16 18:31:24,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:24,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:24,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69460998] [2020-01-16 18:31:24,719 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:24,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:24,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:24,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:24,720 INFO L87 Difference]: Start difference. First operand 357 states and 1127 transitions. Second operand 8 states. [2020-01-16 18:31:24,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:24,802 INFO L93 Difference]: Finished difference Result 693 states and 1971 transitions. [2020-01-16 18:31:24,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:24,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:24,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:24,804 INFO L225 Difference]: With dead ends: 693 [2020-01-16 18:31:24,804 INFO L226 Difference]: Without dead ends: 641 [2020-01-16 18:31:24,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:24,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-01-16 18:31:24,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 341. [2020-01-16 18:31:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:31:24,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1083 transitions. [2020-01-16 18:31:24,812 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1083 transitions. Word has length 19 [2020-01-16 18:31:24,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:24,813 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1083 transitions. [2020-01-16 18:31:24,813 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:24,813 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1083 transitions. [2020-01-16 18:31:24,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:24,813 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:24,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-01-16 18:31:24,814 INFO L426 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-01-16 18:31:24,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:24,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1295748776, now seen corresponding path program 115 times [2020-01-16 18:31:24,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:24,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510329052] [2020-01-16 18:31:24,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:25,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510329052] [2020-01-16 18:31:25,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:25,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:25,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889353953] [2020-01-16 18:31:25,023 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:25,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:25,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:25,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:25,023 INFO L87 Difference]: Start difference. First operand 341 states and 1083 transitions. Second operand 8 states. [2020-01-16 18:31:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:25,104 INFO L93 Difference]: Finished difference Result 651 states and 1839 transitions. [2020-01-16 18:31:25,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:25,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:25,106 INFO L225 Difference]: With dead ends: 651 [2020-01-16 18:31:25,106 INFO L226 Difference]: Without dead ends: 621 [2020-01-16 18:31:25,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-01-16 18:31:25,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-01-16 18:31:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 349. [2020-01-16 18:31:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:31:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1107 transitions. [2020-01-16 18:31:25,113 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1107 transitions. Word has length 19 [2020-01-16 18:31:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:25,113 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1107 transitions. [2020-01-16 18:31:25,113 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1107 transitions. [2020-01-16 18:31:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:25,114 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:25,114 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:25,114 INFO L426 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-01-16 18:31:25,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:25,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1288605212, now seen corresponding path program 116 times [2020-01-16 18:31:25,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:25,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404786602] [2020-01-16 18:31:25,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:25,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404786602] [2020-01-16 18:31:25,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:25,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:25,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530996955] [2020-01-16 18:31:25,330 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:25,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:25,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:25,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:25,330 INFO L87 Difference]: Start difference. First operand 349 states and 1107 transitions. Second operand 8 states. [2020-01-16 18:31:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:25,407 INFO L93 Difference]: Finished difference Result 654 states and 1845 transitions. [2020-01-16 18:31:25,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:25,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:25,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:25,409 INFO L225 Difference]: With dead ends: 654 [2020-01-16 18:31:25,409 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 18:31:25,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-01-16 18:31:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 18:31:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 345. [2020-01-16 18:31:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:31:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1095 transitions. [2020-01-16 18:31:25,417 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1095 transitions. Word has length 19 [2020-01-16 18:31:25,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:25,418 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1095 transitions. [2020-01-16 18:31:25,418 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:25,418 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1095 transitions. [2020-01-16 18:31:25,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:25,418 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:25,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-01-16 18:31:25,419 INFO L426 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-01-16 18:31:25,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:25,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2040451274, now seen corresponding path program 117 times [2020-01-16 18:31:25,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:25,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980186167] [2020-01-16 18:31:25,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:25,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980186167] [2020-01-16 18:31:25,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:25,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:25,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887710197] [2020-01-16 18:31:25,620 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:25,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:25,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:25,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:25,620 INFO L87 Difference]: Start difference. First operand 345 states and 1095 transitions. Second operand 8 states. [2020-01-16 18:31:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:25,702 INFO L93 Difference]: Finished difference Result 655 states and 1847 transitions. [2020-01-16 18:31:25,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:25,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:25,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:25,704 INFO L225 Difference]: With dead ends: 655 [2020-01-16 18:31:25,704 INFO L226 Difference]: Without dead ends: 625 [2020-01-16 18:31:25,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-01-16 18:31:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-01-16 18:31:25,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 350. [2020-01-16 18:31:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-01-16 18:31:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1105 transitions. [2020-01-16 18:31:25,711 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1105 transitions. Word has length 19 [2020-01-16 18:31:25,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:25,711 INFO L478 AbstractCegarLoop]: Abstraction has 350 states and 1105 transitions. [2020-01-16 18:31:25,711 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:25,712 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1105 transitions. [2020-01-16 18:31:25,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:25,712 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:25,712 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:25,712 INFO L426 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-01-16 18:31:25,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:25,712 INFO L82 PathProgramCache]: Analyzing trace with hash 311403940, now seen corresponding path program 118 times [2020-01-16 18:31:25,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:25,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175540898] [2020-01-16 18:31:25,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:25,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175540898] [2020-01-16 18:31:25,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:25,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:25,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379473443] [2020-01-16 18:31:25,898 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:25,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:25,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:25,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:25,898 INFO L87 Difference]: Start difference. First operand 350 states and 1105 transitions. Second operand 8 states. [2020-01-16 18:31:25,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:25,979 INFO L93 Difference]: Finished difference Result 661 states and 1861 transitions. [2020-01-16 18:31:25,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:25,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:25,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:25,981 INFO L225 Difference]: With dead ends: 661 [2020-01-16 18:31:25,981 INFO L226 Difference]: Without dead ends: 620 [2020-01-16 18:31: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-01-16 18:31:25,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-01-16 18:31:25,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 345. [2020-01-16 18:31:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:31:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1091 transitions. [2020-01-16 18:31:25,988 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1091 transitions. Word has length 19 [2020-01-16 18:31:25,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:25,988 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1091 transitions. [2020-01-16 18:31:25,989 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1091 transitions. [2020-01-16 18:31:25,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:25,989 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:25,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-01-16 18:31:25,990 INFO L426 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-01-16 18:31:25,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:25,990 INFO L82 PathProgramCache]: Analyzing trace with hash 945502282, now seen corresponding path program 119 times [2020-01-16 18:31:25,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:25,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682766482] [2020-01-16 18:31:25,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:26,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682766482] [2020-01-16 18:31:26,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:26,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:26,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990406530] [2020-01-16 18:31:26,189 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:26,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:26,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:26,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:26,190 INFO L87 Difference]: Start difference. First operand 345 states and 1091 transitions. Second operand 8 states. [2020-01-16 18:31:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:26,266 INFO L93 Difference]: Finished difference Result 664 states and 1876 transitions. [2020-01-16 18:31:26,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:26,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:26,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:26,268 INFO L225 Difference]: With dead ends: 664 [2020-01-16 18:31:26,268 INFO L226 Difference]: Without dead ends: 631 [2020-01-16 18:31:26,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:26,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-01-16 18:31:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 353. [2020-01-16 18:31:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-01-16 18:31:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1111 transitions. [2020-01-16 18:31:26,276 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1111 transitions. Word has length 19 [2020-01-16 18:31:26,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:26,276 INFO L478 AbstractCegarLoop]: Abstraction has 353 states and 1111 transitions. [2020-01-16 18:31:26,276 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:26,276 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1111 transitions. [2020-01-16 18:31:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:26,277 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:26,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-01-16 18:31:26,277 INFO L426 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-01-16 18:31:26,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:26,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1800808936, now seen corresponding path program 120 times [2020-01-16 18:31:26,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:26,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094106871] [2020-01-16 18:31:26,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:26,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:26,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094106871] [2020-01-16 18:31:26,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:26,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:26,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660305470] [2020-01-16 18:31:26,518 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:26,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:26,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:26,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:26,519 INFO L87 Difference]: Start difference. First operand 353 states and 1111 transitions. Second operand 8 states. [2020-01-16 18:31:26,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:26,600 INFO L93 Difference]: Finished difference Result 667 states and 1877 transitions. [2020-01-16 18:31:26,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:26,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:26,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:26,601 INFO L225 Difference]: With dead ends: 667 [2020-01-16 18:31:26,601 INFO L226 Difference]: Without dead ends: 608 [2020-01-16 18:31:26,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-01-16 18:31:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-01-16 18:31:26,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 330. [2020-01-16 18:31:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-01-16 18:31:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1061 transitions. [2020-01-16 18:31:26,611 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1061 transitions. Word has length 19 [2020-01-16 18:31:26,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:26,611 INFO L478 AbstractCegarLoop]: Abstraction has 330 states and 1061 transitions. [2020-01-16 18:31:26,611 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1061 transitions. [2020-01-16 18:31:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:26,612 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:26,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-01-16 18:31:26,613 INFO L426 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-01-16 18:31:26,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:26,613 INFO L82 PathProgramCache]: Analyzing trace with hash 822861400, now seen corresponding path program 121 times [2020-01-16 18:31:26,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:26,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579087625] [2020-01-16 18:31:26,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:26,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579087625] [2020-01-16 18:31:26,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:26,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:26,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336550347] [2020-01-16 18:31:26,831 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:26,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:26,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:26,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:26,832 INFO L87 Difference]: Start difference. First operand 330 states and 1061 transitions. Second operand 8 states. [2020-01-16 18:31:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:26,902 INFO L93 Difference]: Finished difference Result 685 states and 1929 transitions. [2020-01-16 18:31:26,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:26,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:26,904 INFO L225 Difference]: With dead ends: 685 [2020-01-16 18:31:26,905 INFO L226 Difference]: Without dead ends: 654 [2020-01-16 18:31:26,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-01-16 18:31:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2020-01-16 18:31:26,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 346. [2020-01-16 18:31:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-01-16 18:31:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1101 transitions. [2020-01-16 18:31:26,914 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1101 transitions. Word has length 19 [2020-01-16 18:31:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:26,914 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 1101 transitions. [2020-01-16 18:31:26,914 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1101 transitions. [2020-01-16 18:31:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:26,915 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:26,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-01-16 18:31:26,916 INFO L426 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-01-16 18:31:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:26,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1197512586, now seen corresponding path program 122 times [2020-01-16 18:31:26,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:26,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253255429] [2020-01-16 18:31:26,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:27,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253255429] [2020-01-16 18:31:27,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:27,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:27,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070971270] [2020-01-16 18:31:27,141 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:27,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:27,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:27,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:27,141 INFO L87 Difference]: Start difference. First operand 346 states and 1101 transitions. Second operand 8 states. [2020-01-16 18:31:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:27,219 INFO L93 Difference]: Finished difference Result 694 states and 1952 transitions. [2020-01-16 18:31:27,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:27,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:27,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:27,221 INFO L225 Difference]: With dead ends: 694 [2020-01-16 18:31:27,221 INFO L226 Difference]: Without dead ends: 646 [2020-01-16 18:31:27,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-01-16 18:31:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 338. [2020-01-16 18:31:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-01-16 18:31:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1080 transitions. [2020-01-16 18:31:27,229 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1080 transitions. Word has length 19 [2020-01-16 18:31:27,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:27,229 INFO L478 AbstractCegarLoop]: Abstraction has 338 states and 1080 transitions. [2020-01-16 18:31:27,229 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1080 transitions. [2020-01-16 18:31:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:27,229 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:27,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-01-16 18:31:27,230 INFO L426 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-01-16 18:31:27,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:27,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2004251154, now seen corresponding path program 123 times [2020-01-16 18:31:27,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:27,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556364869] [2020-01-16 18:31:27,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:27,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556364869] [2020-01-16 18:31:27,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:27,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:27,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812889893] [2020-01-16 18:31:27,456 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:27,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:27,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:27,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:27,456 INFO L87 Difference]: Start difference. First operand 338 states and 1080 transitions. Second operand 8 states. [2020-01-16 18:31:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:27,524 INFO L93 Difference]: Finished difference Result 679 states and 1906 transitions. [2020-01-16 18:31:27,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:27,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:27,526 INFO L225 Difference]: With dead ends: 679 [2020-01-16 18:31:27,526 INFO L226 Difference]: Without dead ends: 648 [2020-01-16 18:31:27,526 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-01-16 18:31:27,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 344. [2020-01-16 18:31:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-01-16 18:31:27,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1091 transitions. [2020-01-16 18:31:27,533 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1091 transitions. Word has length 19 [2020-01-16 18:31:27,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:27,533 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 1091 transitions. [2020-01-16 18:31:27,533 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:27,533 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1091 transitions. [2020-01-16 18:31:27,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:27,534 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:27,534 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:27,534 INFO L426 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-01-16 18:31:27,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:27,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1028046404, now seen corresponding path program 124 times [2020-01-16 18:31:27,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:27,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078264499] [2020-01-16 18:31:27,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:27,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078264499] [2020-01-16 18:31:27,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:27,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:27,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031288267] [2020-01-16 18:31:27,762 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:27,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:27,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:27,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:27,762 INFO L87 Difference]: Start difference. First operand 344 states and 1091 transitions. Second operand 8 states. [2020-01-16 18:31:27,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:27,857 INFO L93 Difference]: Finished difference Result 684 states and 1918 transitions. [2020-01-16 18:31:27,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:27,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:27,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:27,859 INFO L225 Difference]: With dead ends: 684 [2020-01-16 18:31:27,859 INFO L226 Difference]: Without dead ends: 642 [2020-01-16 18:31:27,859 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:27,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-01-16 18:31:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 338. [2020-01-16 18:31:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-01-16 18:31:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1074 transitions. [2020-01-16 18:31:27,866 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1074 transitions. Word has length 19 [2020-01-16 18:31:27,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:27,866 INFO L478 AbstractCegarLoop]: Abstraction has 338 states and 1074 transitions. [2020-01-16 18:31:27,866 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1074 transitions. [2020-01-16 18:31:27,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:27,867 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:27,867 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:27,867 INFO L426 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-01-16 18:31:27,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:27,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1100948602, now seen corresponding path program 125 times [2020-01-16 18:31:27,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:27,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628165581] [2020-01-16 18:31:27,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:28,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628165581] [2020-01-16 18:31:28,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:28,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:28,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176193371] [2020-01-16 18:31:28,085 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:28,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:28,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:28,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:28,087 INFO L87 Difference]: Start difference. First operand 338 states and 1074 transitions. Second operand 8 states. [2020-01-16 18:31:28,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:28,169 INFO L93 Difference]: Finished difference Result 703 states and 1986 transitions. [2020-01-16 18:31:28,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:28,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:28,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:28,171 INFO L225 Difference]: With dead ends: 703 [2020-01-16 18:31:28,172 INFO L226 Difference]: Without dead ends: 663 [2020-01-16 18:31:28,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-01-16 18:31:28,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2020-01-16 18:31:28,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 350. [2020-01-16 18:31:28,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-01-16 18:31:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1105 transitions. [2020-01-16 18:31:28,180 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1105 transitions. Word has length 19 [2020-01-16 18:31:28,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:28,180 INFO L478 AbstractCegarLoop]: Abstraction has 350 states and 1105 transitions. [2020-01-16 18:31:28,180 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1105 transitions. [2020-01-16 18:31:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:28,181 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:28,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-01-16 18:31:28,181 INFO L426 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-01-16 18:31:28,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:28,182 INFO L82 PathProgramCache]: Analyzing trace with hash -242668718, now seen corresponding path program 126 times [2020-01-16 18:31:28,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:28,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359608961] [2020-01-16 18:31:28,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:28,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-01-16 18:31:28,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359608961] [2020-01-16 18:31:28,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:28,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:28,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434299080] [2020-01-16 18:31:28,400 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:28,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:28,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:28,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:28,400 INFO L87 Difference]: Start difference. First operand 350 states and 1105 transitions. Second operand 8 states. [2020-01-16 18:31:28,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:28,487 INFO L93 Difference]: Finished difference Result 699 states and 1962 transitions. [2020-01-16 18:31:28,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:28,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:28,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:28,489 INFO L225 Difference]: With dead ends: 699 [2020-01-16 18:31:28,489 INFO L226 Difference]: Without dead ends: 643 [2020-01-16 18:31:28,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-01-16 18:31:28,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-01-16 18:31:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 330. [2020-01-16 18:31:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-01-16 18:31:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1054 transitions. [2020-01-16 18:31:28,496 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1054 transitions. Word has length 19 [2020-01-16 18:31:28,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:28,497 INFO L478 AbstractCegarLoop]: Abstraction has 330 states and 1054 transitions. [2020-01-16 18:31:28,497 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:28,497 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1054 transitions. [2020-01-16 18:31:28,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:28,498 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:28,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:28,498 INFO L426 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-01-16 18:31:28,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:28,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1565948490, now seen corresponding path program 127 times [2020-01-16 18:31:28,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:28,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359310744] [2020-01-16 18:31:28,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:28,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359310744] [2020-01-16 18:31:28,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:28,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:28,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250337934] [2020-01-16 18:31:28,706 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:28,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:28,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:28,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:28,706 INFO L87 Difference]: Start difference. First operand 330 states and 1054 transitions. Second operand 8 states. [2020-01-16 18:31:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:28,767 INFO L93 Difference]: Finished difference Result 676 states and 1893 transitions. [2020-01-16 18:31:28,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:28,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:28,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:28,769 INFO L225 Difference]: With dead ends: 676 [2020-01-16 18:31:28,769 INFO L226 Difference]: Without dead ends: 645 [2020-01-16 18:31:28,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-01-16 18:31:28,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-01-16 18:31:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 344. [2020-01-16 18:31:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-01-16 18:31:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1089 transitions. [2020-01-16 18:31:28,776 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1089 transitions. Word has length 19 [2020-01-16 18:31:28,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:28,777 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 1089 transitions. [2020-01-16 18:31:28,777 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:28,777 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1089 transitions. [2020-01-16 18:31:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:28,777 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:28,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-01-16 18:31:28,777 INFO L426 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-01-16 18:31:28,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:28,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1940599676, now seen corresponding path program 128 times [2020-01-16 18:31:28,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:28,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048961696] [2020-01-16 18:31:28,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:28,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048961696] [2020-01-16 18:31:28,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:28,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:28,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817894150] [2020-01-16 18:31:28,985 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:28,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:28,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:28,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:28,986 INFO L87 Difference]: Start difference. First operand 344 states and 1089 transitions. Second operand 8 states. [2020-01-16 18:31:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:29,061 INFO L93 Difference]: Finished difference Result 685 states and 1916 transitions. [2020-01-16 18:31:29,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:29,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:29,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:29,063 INFO L225 Difference]: With dead ends: 685 [2020-01-16 18:31:29,063 INFO L226 Difference]: Without dead ends: 637 [2020-01-16 18:31:29,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:29,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-01-16 18:31:29,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 336. [2020-01-16 18:31:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-01-16 18:31:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1069 transitions. [2020-01-16 18:31:29,071 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1069 transitions. Word has length 19 [2020-01-16 18:31:29,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:29,072 INFO L478 AbstractCegarLoop]: Abstraction has 336 states and 1069 transitions. [2020-01-16 18:31:29,072 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1069 transitions. [2020-01-16 18:31:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:29,073 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:29,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-01-16 18:31:29,073 INFO L426 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-01-16 18:31:29,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:29,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1873225276, now seen corresponding path program 129 times [2020-01-16 18:31:29,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:29,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133539504] [2020-01-16 18:31:29,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:29,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133539504] [2020-01-16 18:31:29,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:29,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:29,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506748388] [2020-01-16 18:31:29,286 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:29,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:29,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:29,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:29,286 INFO L87 Difference]: Start difference. First operand 336 states and 1069 transitions. Second operand 8 states. [2020-01-16 18:31:29,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:29,348 INFO L93 Difference]: Finished difference Result 666 states and 1859 transitions. [2020-01-16 18:31:29,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:29,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:29,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:29,350 INFO L225 Difference]: With dead ends: 666 [2020-01-16 18:31:29,350 INFO L226 Difference]: Without dead ends: 635 [2020-01-16 18:31:29,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-01-16 18:31:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-01-16 18:31:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 341. [2020-01-16 18:31:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:31:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1078 transitions. [2020-01-16 18:31:29,358 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1078 transitions. Word has length 19 [2020-01-16 18:31:29,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:29,358 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1078 transitions. [2020-01-16 18:31:29,358 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1078 transitions. [2020-01-16 18:31:29,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:29,359 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:29,359 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:29,359 INFO L426 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-01-16 18:31:29,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:29,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1670679926, now seen corresponding path program 130 times [2020-01-16 18:31:29,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:29,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871520932] [2020-01-16 18:31:29,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:29,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871520932] [2020-01-16 18:31:29,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:29,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:29,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671861184] [2020-01-16 18:31:29,563 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:29,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:29,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:29,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:29,563 INFO L87 Difference]: Start difference. First operand 341 states and 1078 transitions. Second operand 8 states. [2020-01-16 18:31:29,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:29,643 INFO L93 Difference]: Finished difference Result 668 states and 1863 transitions. [2020-01-16 18:31:29,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:29,644 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:29,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:29,645 INFO L225 Difference]: With dead ends: 668 [2020-01-16 18:31:29,646 INFO L226 Difference]: Without dead ends: 630 [2020-01-16 18:31:29,646 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-01-16 18:31:29,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 336. [2020-01-16 18:31:29,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-01-16 18:31:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1064 transitions. [2020-01-16 18:31:29,655 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1064 transitions. Word has length 19 [2020-01-16 18:31:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:29,656 INFO L478 AbstractCegarLoop]: Abstraction has 336 states and 1064 transitions. [2020-01-16 18:31:29,656 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1064 transitions. [2020-01-16 18:31:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:29,657 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:29,657 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:29,657 INFO L426 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-01-16 18:31:29,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:29,657 INFO L82 PathProgramCache]: Analyzing trace with hash 400559450, now seen corresponding path program 131 times [2020-01-16 18:31:29,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:29,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160151033] [2020-01-16 18:31:29,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:29,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-01-16 18:31:29,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160151033] [2020-01-16 18:31:29,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:29,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:29,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585054763] [2020-01-16 18:31:29,878 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:29,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:29,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:29,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:29,878 INFO L87 Difference]: Start difference. First operand 336 states and 1064 transitions. Second operand 8 states. [2020-01-16 18:31:29,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:29,977 INFO L93 Difference]: Finished difference Result 688 states and 1931 transitions. [2020-01-16 18:31:29,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:29,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:29,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:29,979 INFO L225 Difference]: With dead ends: 688 [2020-01-16 18:31:29,979 INFO L226 Difference]: Without dead ends: 648 [2020-01-16 18:31:29,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-01-16 18:31:29,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 345. [2020-01-16 18:31:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:31:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1086 transitions. [2020-01-16 18:31:29,986 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1086 transitions. Word has length 19 [2020-01-16 18:31:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:29,986 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1086 transitions. [2020-01-16 18:31:29,986 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1086 transitions. [2020-01-16 18:31:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:29,988 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:29,989 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:29,989 INFO L426 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-01-16 18:31:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash 399964804, now seen corresponding path program 132 times [2020-01-16 18:31:29,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:29,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989432471] [2020-01-16 18:31:29,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:30,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989432471] [2020-01-16 18:31:30,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:30,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:30,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738078657] [2020-01-16 18:31:30,192 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:30,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:30,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:30,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:30,192 INFO L87 Difference]: Start difference. First operand 345 states and 1086 transitions. Second operand 8 states. [2020-01-16 18:31:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:30,274 INFO L93 Difference]: Finished difference Result 681 states and 1901 transitions. [2020-01-16 18:31:30,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:30,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:30,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:30,276 INFO L225 Difference]: With dead ends: 681 [2020-01-16 18:31:30,276 INFO L226 Difference]: Without dead ends: 633 [2020-01-16 18:31:30,277 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-01-16 18:31:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 330. [2020-01-16 18:31:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-01-16 18:31:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1048 transitions. [2020-01-16 18:31:30,285 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1048 transitions. Word has length 19 [2020-01-16 18:31:30,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:30,285 INFO L478 AbstractCegarLoop]: Abstraction has 330 states and 1048 transitions. [2020-01-16 18:31:30,285 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:30,285 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1048 transitions. [2020-01-16 18:31:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:30,286 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:30,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:30,286 INFO L426 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-01-16 18:31:30,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:30,287 INFO L82 PathProgramCache]: Analyzing trace with hash 390118730, now seen corresponding path program 133 times [2020-01-16 18:31:30,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:30,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076804144] [2020-01-16 18:31:30,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:30,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076804144] [2020-01-16 18:31:30,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:30,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:30,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508494894] [2020-01-16 18:31:30,547 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:30,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:30,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:30,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:30,547 INFO L87 Difference]: Start difference. First operand 330 states and 1048 transitions. Second operand 8 states. [2020-01-16 18:31:30,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:30,613 INFO L93 Difference]: Finished difference Result 658 states and 1838 transitions. [2020-01-16 18:31:30,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:30,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:30,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:30,614 INFO L225 Difference]: With dead ends: 658 [2020-01-16 18:31:30,614 INFO L226 Difference]: Without dead ends: 627 [2020-01-16 18:31:30,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-01-16 18:31:30,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-01-16 18:31:30,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 340. [2020-01-16 18:31:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-01-16 18:31:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1076 transitions. [2020-01-16 18:31:30,621 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1076 transitions. Word has length 19 [2020-01-16 18:31:30,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:30,621 INFO L478 AbstractCegarLoop]: Abstraction has 340 states and 1076 transitions. [2020-01-16 18:31:30,621 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1076 transitions. [2020-01-16 18:31:30,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:30,622 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:30,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:30,622 INFO L426 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-01-16 18:31:30,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:30,622 INFO L82 PathProgramCache]: Analyzing trace with hash -360943364, now seen corresponding path program 134 times [2020-01-16 18:31:30,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:30,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649538633] [2020-01-16 18:31:30,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:30,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649538633] [2020-01-16 18:31:30,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:30,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:30,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957901151] [2020-01-16 18:31:30,832 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:30,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:30,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:30,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:30,832 INFO L87 Difference]: Start difference. First operand 340 states and 1076 transitions. Second operand 8 states. [2020-01-16 18:31:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:30,919 INFO L93 Difference]: Finished difference Result 660 states and 1842 transitions. [2020-01-16 18:31:30,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:30,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:30,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:30,921 INFO L225 Difference]: With dead ends: 660 [2020-01-16 18:31:30,921 INFO L226 Difference]: Without dead ends: 622 [2020-01-16 18:31:30,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:30,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-01-16 18:31:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 335. [2020-01-16 18:31:30,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-01-16 18:31:30,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1062 transitions. [2020-01-16 18:31:30,928 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1062 transitions. Word has length 19 [2020-01-16 18:31:30,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:30,928 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 1062 transitions. [2020-01-16 18:31:30,929 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1062 transitions. [2020-01-16 18:31:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:30,929 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:30,929 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:30,929 INFO L426 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-01-16 18:31:30,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:30,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1210319124, now seen corresponding path program 135 times [2020-01-16 18:31:30,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:30,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140184611] [2020-01-16 18:31:30,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:31,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140184611] [2020-01-16 18:31:31,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:31,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:31,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424573846] [2020-01-16 18:31:31,140 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:31,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:31,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:31,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:31,141 INFO L87 Difference]: Start difference. First operand 335 states and 1062 transitions. Second operand 8 states. [2020-01-16 18:31:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:31,210 INFO L93 Difference]: Finished difference Result 662 states and 1845 transitions. [2020-01-16 18:31:31,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:31,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:31,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:31,212 INFO L225 Difference]: With dead ends: 662 [2020-01-16 18:31:31,212 INFO L226 Difference]: Without dead ends: 631 [2020-01-16 18:31:31,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-01-16 18:31:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 341. [2020-01-16 18:31:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:31:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1073 transitions. [2020-01-16 18:31:31,219 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1073 transitions. Word has length 19 [2020-01-16 18:31:31,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:31,219 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1073 transitions. [2020-01-16 18:31:31,220 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:31,220 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1073 transitions. [2020-01-16 18:31:31,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:31,220 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:31,220 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:31,220 INFO L426 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-01-16 18:31:31,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:31,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2108443422, now seen corresponding path program 136 times [2020-01-16 18:31:31,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:31,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748369501] [2020-01-16 18:31:31,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:31,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748369501] [2020-01-16 18:31:31,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:31,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:31,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362242286] [2020-01-16 18:31:31,426 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:31,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:31,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:31,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:31,426 INFO L87 Difference]: Start difference. First operand 341 states and 1073 transitions. Second operand 8 states. [2020-01-16 18:31:31,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:31,528 INFO L93 Difference]: Finished difference Result 667 states and 1857 transitions. [2020-01-16 18:31:31,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:31,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:31,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:31,530 INFO L225 Difference]: With dead ends: 667 [2020-01-16 18:31:31,530 INFO L226 Difference]: Without dead ends: 625 [2020-01-16 18:31:31,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:31,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-01-16 18:31:31,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 335. [2020-01-16 18:31:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-01-16 18:31:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1057 transitions. [2020-01-16 18:31:31,537 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1057 transitions. Word has length 19 [2020-01-16 18:31:31,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:31,537 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 1057 transitions. [2020-01-16 18:31:31,537 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1057 transitions. [2020-01-16 18:31:31,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:31,538 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:31,538 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:31,538 INFO L426 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-01-16 18:31:31,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:31,538 INFO L82 PathProgramCache]: Analyzing trace with hash -558519542, now seen corresponding path program 137 times [2020-01-16 18:31:31,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:31,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099024291] [2020-01-16 18:31:31,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:31,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099024291] [2020-01-16 18:31:31,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:31,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:31,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923109615] [2020-01-16 18:31:31,764 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:31,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:31,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:31,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:31,764 INFO L87 Difference]: Start difference. First operand 335 states and 1057 transitions. Second operand 8 states. [2020-01-16 18:31:31,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:31,862 INFO L93 Difference]: Finished difference Result 668 states and 1869 transitions. [2020-01-16 18:31:31,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:31,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:31,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:31,864 INFO L225 Difference]: With dead ends: 668 [2020-01-16 18:31:31,864 INFO L226 Difference]: Without dead ends: 635 [2020-01-16 18:31:31,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-01-16 18:31:31,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-01-16 18:31:31,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 343. [2020-01-16 18:31:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-01-16 18:31:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1077 transitions. [2020-01-16 18:31:31,872 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1077 transitions. Word has length 19 [2020-01-16 18:31:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:31,872 INFO L478 AbstractCegarLoop]: Abstraction has 343 states and 1077 transitions. [2020-01-16 18:31:31,872 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1077 transitions. [2020-01-16 18:31:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:31,873 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:31,873 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:31,873 INFO L426 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-01-16 18:31:31,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:31,873 INFO L82 PathProgramCache]: Analyzing trace with hash 300354988, now seen corresponding path program 138 times [2020-01-16 18:31:31,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:31,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234851504] [2020-01-16 18:31:31,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:32,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234851504] [2020-01-16 18:31:32,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:32,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:32,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297361642] [2020-01-16 18:31:32,082 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:32,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:32,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:32,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:32,082 INFO L87 Difference]: Start difference. First operand 343 states and 1077 transitions. Second operand 8 states. [2020-01-16 18:31:32,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:32,180 INFO L93 Difference]: Finished difference Result 671 states and 1870 transitions. [2020-01-16 18:31:32,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:32,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:32,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:32,182 INFO L225 Difference]: With dead ends: 671 [2020-01-16 18:31:32,183 INFO L226 Difference]: Without dead ends: 622 [2020-01-16 18:31:32,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-01-16 18:31:32,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-01-16 18:31:32,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 330. [2020-01-16 18:31:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-01-16 18:31:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1043 transitions. [2020-01-16 18:31:32,192 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1043 transitions. Word has length 19 [2020-01-16 18:31:32,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:32,192 INFO L478 AbstractCegarLoop]: Abstraction has 330 states and 1043 transitions. [2020-01-16 18:31:32,192 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:32,192 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1043 transitions. [2020-01-16 18:31:32,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:32,193 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:32,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-01-16 18:31:32,193 INFO L426 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-01-16 18:31:32,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:32,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2132260642, now seen corresponding path program 139 times [2020-01-16 18:31:32,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:32,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231280669] [2020-01-16 18:31:32,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:32,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231280669] [2020-01-16 18:31:32,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:32,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:32,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336698913] [2020-01-16 18:31:32,415 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:32,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:32,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:32,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:32,415 INFO L87 Difference]: Start difference. First operand 330 states and 1043 transitions. Second operand 8 states. [2020-01-16 18:31:32,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:32,499 INFO L93 Difference]: Finished difference Result 702 states and 2000 transitions. [2020-01-16 18:31:32,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:32,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:32,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:32,501 INFO L225 Difference]: With dead ends: 702 [2020-01-16 18:31:32,501 INFO L226 Difference]: Without dead ends: 662 [2020-01-16 18:31:32,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-01-16 18:31:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 347. [2020-01-16 18:31:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-01-16 18:31:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1101 transitions. [2020-01-16 18:31:32,509 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1101 transitions. Word has length 19 [2020-01-16 18:31:32,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:32,509 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 1101 transitions. [2020-01-16 18:31:32,509 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1101 transitions. [2020-01-16 18:31:32,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:32,509 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:32,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-01-16 18:31:32,510 INFO L426 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-01-16 18:31:32,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:32,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2132855288, now seen corresponding path program 140 times [2020-01-16 18:31:32,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:32,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600527880] [2020-01-16 18:31:32,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:32,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600527880] [2020-01-16 18:31:32,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:32,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:32,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742398544] [2020-01-16 18:31:32,720 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:32,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:32,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:32,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:32,721 INFO L87 Difference]: Start difference. First operand 347 states and 1101 transitions. Second operand 8 states. [2020-01-16 18:31:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:32,822 INFO L93 Difference]: Finished difference Result 695 states and 1970 transitions. [2020-01-16 18:31:32,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:32,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:32,824 INFO L225 Difference]: With dead ends: 695 [2020-01-16 18:31:32,824 INFO L226 Difference]: Without dead ends: 653 [2020-01-16 18:31:32,825 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:32,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-01-16 18:31:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 338. [2020-01-16 18:31:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-01-16 18:31:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1071 transitions. [2020-01-16 18:31:32,834 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1071 transitions. Word has length 19 [2020-01-16 18:31:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:32,834 INFO L478 AbstractCegarLoop]: Abstraction has 338 states and 1071 transitions. [2020-01-16 18:31:32,834 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:32,835 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1071 transitions. [2020-01-16 18:31:32,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:32,835 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:32,835 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:32,836 INFO L426 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-01-16 18:31:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:32,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1276953988, now seen corresponding path program 141 times [2020-01-16 18:31:32,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:32,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323050644] [2020-01-16 18:31:32,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:33,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323050644] [2020-01-16 18:31:33,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:33,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:33,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26954803] [2020-01-16 18:31:33,084 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:33,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:33,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:33,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:33,085 INFO L87 Difference]: Start difference. First operand 338 states and 1071 transitions. Second operand 8 states. [2020-01-16 18:31:33,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:33,194 INFO L93 Difference]: Finished difference Result 708 states and 2013 transitions. [2020-01-16 18:31:33,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:33,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:33,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:33,196 INFO L225 Difference]: With dead ends: 708 [2020-01-16 18:31:33,196 INFO L226 Difference]: Without dead ends: 668 [2020-01-16 18:31:33,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-01-16 18:31:33,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-01-16 18:31:33,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 350. [2020-01-16 18:31:33,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-01-16 18:31:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1102 transitions. [2020-01-16 18:31:33,211 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1102 transitions. Word has length 19 [2020-01-16 18:31:33,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:33,211 INFO L478 AbstractCegarLoop]: Abstraction has 350 states and 1102 transitions. [2020-01-16 18:31:33,212 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:33,212 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1102 transitions. [2020-01-16 18:31:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:33,213 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:33,213 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:33,213 INFO L426 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-01-16 18:31:33,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:33,214 INFO L82 PathProgramCache]: Analyzing trace with hash -418674104, now seen corresponding path program 142 times [2020-01-16 18:31:33,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:33,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610973829] [2020-01-16 18:31:33,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:33,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610973829] [2020-01-16 18:31:33,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:33,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:33,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402121821] [2020-01-16 18:31:33,459 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:33,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:33,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:33,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:33,459 INFO L87 Difference]: Start difference. First operand 350 states and 1102 transitions. Second operand 8 states. [2020-01-16 18:31:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:33,565 INFO L93 Difference]: Finished difference Result 704 states and 1989 transitions. [2020-01-16 18:31:33,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:33,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:33,566 INFO L225 Difference]: With dead ends: 704 [2020-01-16 18:31:33,566 INFO L226 Difference]: Without dead ends: 656 [2020-01-16 18:31:33,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-01-16 18:31:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-01-16 18:31:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 338. [2020-01-16 18:31:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-01-16 18:31:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1063 transitions. [2020-01-16 18:31:33,579 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1063 transitions. Word has length 19 [2020-01-16 18:31:33,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:33,580 INFO L478 AbstractCegarLoop]: Abstraction has 338 states and 1063 transitions. [2020-01-16 18:31:33,580 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:33,580 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1063 transitions. [2020-01-16 18:31:33,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:33,581 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:33,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-01-16 18:31:33,582 INFO L426 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-01-16 18:31:33,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:33,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1295982660, now seen corresponding path program 143 times [2020-01-16 18:31:33,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:33,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652488972] [2020-01-16 18:31:33,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:33,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-01-16 18:31:33,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652488972] [2020-01-16 18:31:33,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:33,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:33,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439589219] [2020-01-16 18:31:33,840 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:33,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:33,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:33,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:33,841 INFO L87 Difference]: Start difference. First operand 338 states and 1063 transitions. Second operand 8 states. [2020-01-16 18:31:33,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:33,947 INFO L93 Difference]: Finished difference Result 690 states and 1948 transitions. [2020-01-16 18:31:33,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:33,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:33,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:33,949 INFO L225 Difference]: With dead ends: 690 [2020-01-16 18:31:33,949 INFO L226 Difference]: Without dead ends: 657 [2020-01-16 18:31:33,949 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:33,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-01-16 18:31:33,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 346. [2020-01-16 18:31:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-01-16 18:31:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1083 transitions. [2020-01-16 18:31:33,960 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1083 transitions. Word has length 19 [2020-01-16 18:31:33,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:33,961 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 1083 transitions. [2020-01-16 18:31:33,961 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:33,961 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1083 transitions. [2020-01-16 18:31:33,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:33,962 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:33,962 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:33,962 INFO L426 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-01-16 18:31:33,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:33,963 INFO L82 PathProgramCache]: Analyzing trace with hash -437108130, now seen corresponding path program 144 times [2020-01-16 18:31:33,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:33,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522283312] [2020-01-16 18:31:33,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:34,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522283312] [2020-01-16 18:31:34,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:34,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:34,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407966893] [2020-01-16 18:31:34,157 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:34,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:34,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:34,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:34,158 INFO L87 Difference]: Start difference. First operand 346 states and 1083 transitions. Second operand 8 states. [2020-01-16 18:31:34,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:34,250 INFO L93 Difference]: Finished difference Result 693 states and 1949 transitions. [2020-01-16 18:31:34,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:34,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:34,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:34,252 INFO L225 Difference]: With dead ends: 693 [2020-01-16 18:31:34,252 INFO L226 Difference]: Without dead ends: 633 [2020-01-16 18:31:34,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-01-16 18:31:34,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-01-16 18:31:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 322. [2020-01-16 18:31:34,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-01-16 18:31:34,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 1025 transitions. [2020-01-16 18:31:34,260 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 1025 transitions. Word has length 19 [2020-01-16 18:31:34,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:34,260 INFO L478 AbstractCegarLoop]: Abstraction has 322 states and 1025 transitions. [2020-01-16 18:31:34,260 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:34,260 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 1025 transitions. [2020-01-16 18:31:34,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:34,261 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:34,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-01-16 18:31:34,261 INFO L426 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-01-16 18:31:34,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:34,261 INFO L82 PathProgramCache]: Analyzing trace with hash -570692880, now seen corresponding path program 145 times [2020-01-16 18:31:34,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:34,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654900008] [2020-01-16 18:31:34,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:34,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:34,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654900008] [2020-01-16 18:31:34,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:34,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:34,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695415933] [2020-01-16 18:31:34,483 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:34,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:34,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:34,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:34,484 INFO L87 Difference]: Start difference. First operand 322 states and 1025 transitions. Second operand 8 states. [2020-01-16 18:31:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:34,563 INFO L93 Difference]: Finished difference Result 656 states and 1808 transitions. [2020-01-16 18:31:34,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:34,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:34,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:34,564 INFO L225 Difference]: With dead ends: 656 [2020-01-16 18:31:34,564 INFO L226 Difference]: Without dead ends: 625 [2020-01-16 18:31:34,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-01-16 18:31:34,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-01-16 18:31:34,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 343. [2020-01-16 18:31:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-01-16 18:31:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1083 transitions. [2020-01-16 18:31:34,572 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1083 transitions. Word has length 19 [2020-01-16 18:31:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:34,572 INFO L478 AbstractCegarLoop]: Abstraction has 343 states and 1083 transitions. [2020-01-16 18:31:34,572 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1083 transitions. [2020-01-16 18:31:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:34,573 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:34,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-01-16 18:31:34,573 INFO L426 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-01-16 18:31:34,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:34,574 INFO L82 PathProgramCache]: Analyzing trace with hash -196041694, now seen corresponding path program 146 times [2020-01-16 18:31:34,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:34,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447070105] [2020-01-16 18:31:34,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:34,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447070105] [2020-01-16 18:31:34,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:34,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:34,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811808121] [2020-01-16 18:31:34,802 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:34,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:34,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:34,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:34,802 INFO L87 Difference]: Start difference. First operand 343 states and 1083 transitions. Second operand 8 states. [2020-01-16 18:31:34,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:34,889 INFO L93 Difference]: Finished difference Result 665 states and 1831 transitions. [2020-01-16 18:31:34,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:34,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:34,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:34,890 INFO L225 Difference]: With dead ends: 665 [2020-01-16 18:31:34,890 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 18:31:34,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:34,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 18:31:34,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 335. [2020-01-16 18:31:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-01-16 18:31:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1062 transitions. [2020-01-16 18:31:34,898 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1062 transitions. Word has length 19 [2020-01-16 18:31:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:34,898 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 1062 transitions. [2020-01-16 18:31:34,898 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1062 transitions. [2020-01-16 18:31:34,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:34,899 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:34,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-01-16 18:31:34,899 INFO L426 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-01-16 18:31:34,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:34,899 INFO L82 PathProgramCache]: Analyzing trace with hash 610696874, now seen corresponding path program 147 times [2020-01-16 18:31:34,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:34,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47016363] [2020-01-16 18:31:34,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:35,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47016363] [2020-01-16 18:31:35,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:35,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:35,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710101114] [2020-01-16 18:31:35,118 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:35,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:35,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:35,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:35,119 INFO L87 Difference]: Start difference. First operand 335 states and 1062 transitions. Second operand 8 states. [2020-01-16 18:31:35,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:35,190 INFO L93 Difference]: Finished difference Result 650 states and 1785 transitions. [2020-01-16 18:31:35,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:35,190 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:35,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:35,191 INFO L225 Difference]: With dead ends: 650 [2020-01-16 18:31:35,191 INFO L226 Difference]: Without dead ends: 619 [2020-01-16 18:31:35,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-01-16 18:31:35,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-01-16 18:31:35,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 341. [2020-01-16 18:31:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:31:35,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1073 transitions. [2020-01-16 18:31:35,198 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1073 transitions. Word has length 19 [2020-01-16 18:31:35,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:35,198 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1073 transitions. [2020-01-16 18:31:35,198 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:35,198 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1073 transitions. [2020-01-16 18:31:35,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:35,199 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:35,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-01-16 18:31:35,199 INFO L426 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-01-16 18:31:35,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:35,199 INFO L82 PathProgramCache]: Analyzing trace with hash -365507876, now seen corresponding path program 148 times [2020-01-16 18:31:35,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:35,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657143223] [2020-01-16 18:31:35,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:35,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-01-16 18:31:35,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657143223] [2020-01-16 18:31:35,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:35,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:35,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979667562] [2020-01-16 18:31:35,407 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:35,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:35,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:35,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:35,407 INFO L87 Difference]: Start difference. First operand 341 states and 1073 transitions. Second operand 8 states. [2020-01-16 18:31:35,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:35,514 INFO L93 Difference]: Finished difference Result 655 states and 1797 transitions. [2020-01-16 18:31:35,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:35,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:35,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:35,516 INFO L225 Difference]: With dead ends: 655 [2020-01-16 18:31:35,516 INFO L226 Difference]: Without dead ends: 613 [2020-01-16 18:31:35,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-01-16 18:31:35,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-01-16 18:31:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 335. [2020-01-16 18:31:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-01-16 18:31:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1056 transitions. [2020-01-16 18:31:35,525 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1056 transitions. Word has length 19 [2020-01-16 18:31:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:35,525 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 1056 transitions. [2020-01-16 18:31:35,525 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1056 transitions. [2020-01-16 18:31:35,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:35,526 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:35,526 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:35,526 INFO L426 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-01-16 18:31:35,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:35,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1800464414, now seen corresponding path program 149 times [2020-01-16 18:31:35,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:35,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945642082] [2020-01-16 18:31:35,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:35,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:35,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945642082] [2020-01-16 18:31:35,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:35,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:35,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594294081] [2020-01-16 18:31:35,777 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:35,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:35,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:35,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:35,777 INFO L87 Difference]: Start difference. First operand 335 states and 1056 transitions. Second operand 8 states. [2020-01-16 18:31:35,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:35,879 INFO L93 Difference]: Finished difference Result 674 states and 1865 transitions. [2020-01-16 18:31:35,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:35,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:35,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:35,881 INFO L225 Difference]: With dead ends: 674 [2020-01-16 18:31:35,881 INFO L226 Difference]: Without dead ends: 634 [2020-01-16 18:31:35,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-01-16 18:31:35,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-01-16 18:31:35,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 347. [2020-01-16 18:31:35,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-01-16 18:31:35,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1087 transitions. [2020-01-16 18:31:35,888 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1087 transitions. Word has length 19 [2020-01-16 18:31:35,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:35,888 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 1087 transitions. [2020-01-16 18:31:35,888 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:35,888 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1087 transitions. [2020-01-16 18:31:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:35,889 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:35,889 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:35,889 INFO L426 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-01-16 18:31:35,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:35,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1636222998, now seen corresponding path program 150 times [2020-01-16 18:31:35,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:35,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535858664] [2020-01-16 18:31:35,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:36,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535858664] [2020-01-16 18:31:36,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:36,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:36,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506110803] [2020-01-16 18:31:36,106 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:36,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:36,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:36,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:36,106 INFO L87 Difference]: Start difference. First operand 347 states and 1087 transitions. Second operand 8 states. [2020-01-16 18:31:36,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:36,204 INFO L93 Difference]: Finished difference Result 670 states and 1841 transitions. [2020-01-16 18:31:36,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:36,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:36,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:36,206 INFO L225 Difference]: With dead ends: 670 [2020-01-16 18:31:36,206 INFO L226 Difference]: Without dead ends: 614 [2020-01-16 18:31:36,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-01-16 18:31:36,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-01-16 18:31:36,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 327. [2020-01-16 18:31:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2020-01-16 18:31:36,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 1038 transitions. [2020-01-16 18:31:36,214 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 1038 transitions. Word has length 19 [2020-01-16 18:31:36,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:36,214 INFO L478 AbstractCegarLoop]: Abstraction has 327 states and 1038 transitions. [2020-01-16 18:31:36,214 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 1038 transitions. [2020-01-16 18:31:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:36,215 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:36,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-01-16 18:31:36,215 INFO L426 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-01-16 18:31:36,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:36,215 INFO L82 PathProgramCache]: Analyzing trace with hash 807035554, now seen corresponding path program 151 times [2020-01-16 18:31:36,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:36,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305180500] [2020-01-16 18:31:36,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:36,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305180500] [2020-01-16 18:31:36,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:36,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:36,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55944719] [2020-01-16 18:31:36,427 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:36,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:36,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:36,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:36,428 INFO L87 Difference]: Start difference. First operand 327 states and 1038 transitions. Second operand 8 states. [2020-01-16 18:31:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:36,497 INFO L93 Difference]: Finished difference Result 629 states and 1714 transitions. [2020-01-16 18:31:36,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:36,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:36,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:36,498 INFO L225 Difference]: With dead ends: 629 [2020-01-16 18:31:36,498 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 18:31:36,498 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:36,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 18:31:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 339. [2020-01-16 18:31:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-01-16 18:31:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 1064 transitions. [2020-01-16 18:31:36,505 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 1064 transitions. Word has length 19 [2020-01-16 18:31:36,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:36,505 INFO L478 AbstractCegarLoop]: Abstraction has 339 states and 1064 transitions. [2020-01-16 18:31:36,505 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:36,505 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 1064 transitions. [2020-01-16 18:31:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:36,506 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:36,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-01-16 18:31:36,506 INFO L426 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-01-16 18:31:36,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:36,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1181686740, now seen corresponding path program 152 times [2020-01-16 18:31:36,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:36,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038673421] [2020-01-16 18:31:36,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:36,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038673421] [2020-01-16 18:31:36,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:36,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:36,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727167538] [2020-01-16 18:31:36,740 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:36,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:36,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:36,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:36,741 INFO L87 Difference]: Start difference. First operand 339 states and 1064 transitions. Second operand 8 states. [2020-01-16 18:31:36,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:36,826 INFO L93 Difference]: Finished difference Result 638 states and 1737 transitions. [2020-01-16 18:31:36,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:36,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:36,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:36,827 INFO L225 Difference]: With dead ends: 638 [2020-01-16 18:31:36,827 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 18:31:36,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-01-16 18:31:36,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 18:31:36,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 331. [2020-01-16 18:31:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-01-16 18:31:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 1046 transitions. [2020-01-16 18:31:36,835 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 1046 transitions. Word has length 19 [2020-01-16 18:31:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:36,835 INFO L478 AbstractCegarLoop]: Abstraction has 331 states and 1046 transitions. [2020-01-16 18:31:36,835 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 1046 transitions. [2020-01-16 18:31:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:36,836 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31: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-01-16 18:31:36,836 INFO L426 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-01-16 18:31:36,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:36,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1337232860, now seen corresponding path program 153 times [2020-01-16 18:31:36,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:36,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232083172] [2020-01-16 18:31:36,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:37,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-01-16 18:31:37,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232083172] [2020-01-16 18:31:37,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:37,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:37,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848077437] [2020-01-16 18:31:37,025 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:37,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:37,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:37,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:37,026 INFO L87 Difference]: Start difference. First operand 331 states and 1046 transitions. Second operand 8 states. [2020-01-16 18:31:37,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:37,096 INFO L93 Difference]: Finished difference Result 606 states and 1650 transitions. [2020-01-16 18:31:37,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:37,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:37,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:37,097 INFO L225 Difference]: With dead ends: 606 [2020-01-16 18:31:37,097 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 18:31:37,098 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-01-16 18:31:37,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 18:31:37,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 334. [2020-01-16 18:31:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-01-16 18:31:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1050 transitions. [2020-01-16 18:31:37,104 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1050 transitions. Word has length 19 [2020-01-16 18:31:37,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:37,105 INFO L478 AbstractCegarLoop]: Abstraction has 334 states and 1050 transitions. [2020-01-16 18:31:37,105 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1050 transitions. [2020-01-16 18:31:37,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:37,105 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:37,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-01-16 18:31:37,105 INFO L426 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-01-16 18:31:37,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:37,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1693132272, now seen corresponding path program 1 times [2020-01-16 18:31:37,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:37,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942312381] [2020-01-16 18:31:37,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:37,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-01-16 18:31:37,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942312381] [2020-01-16 18:31:37,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:37,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:31:37,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506132556] [2020-01-16 18:31:37,117 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:31:37,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:37,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:31:37,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:31:37,117 INFO L87 Difference]: Start difference. First operand 334 states and 1050 transitions. Second operand 3 states. [2020-01-16 18:31:37,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:37,121 INFO L93 Difference]: Finished difference Result 220 states and 662 transitions. [2020-01-16 18:31:37,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:31:37,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-01-16 18:31:37,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:37,122 INFO L225 Difference]: With dead ends: 220 [2020-01-16 18:31:37,122 INFO L226 Difference]: Without dead ends: 220 [2020-01-16 18:31:37,122 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:31:37,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-01-16 18:31:37,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2020-01-16 18:31:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-01-16 18:31:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 662 transitions. [2020-01-16 18:31:37,126 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 662 transitions. Word has length 19 [2020-01-16 18:31:37,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:37,126 INFO L478 AbstractCegarLoop]: Abstraction has 220 states and 662 transitions. [2020-01-16 18:31:37,126 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:31:37,126 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 662 transitions. [2020-01-16 18:31:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:37,127 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:37,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-01-16 18:31:37,127 INFO L426 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-01-16 18:31:37,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:37,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1596291086, now seen corresponding path program 154 times [2020-01-16 18:31:37,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:37,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268179541] [2020-01-16 18:31:37,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:37,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268179541] [2020-01-16 18:31:37,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:37,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:37,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868942436] [2020-01-16 18:31:37,334 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:37,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:37,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:37,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:37,334 INFO L87 Difference]: Start difference. First operand 220 states and 662 transitions. Second operand 8 states. [2020-01-16 18:31:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:37,401 INFO L93 Difference]: Finished difference Result 336 states and 884 transitions. [2020-01-16 18:31:37,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:37,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:37,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:37,403 INFO L225 Difference]: With dead ends: 336 [2020-01-16 18:31:37,403 INFO L226 Difference]: Without dead ends: 323 [2020-01-16 18:31:37,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-01-16 18:31:37,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-01-16 18:31:37,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 217. [2020-01-16 18:31:37,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-01-16 18:31:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 655 transitions. [2020-01-16 18:31:37,408 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 655 transitions. Word has length 19 [2020-01-16 18:31:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:37,408 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 655 transitions. [2020-01-16 18:31:37,409 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 655 transitions. [2020-01-16 18:31:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:37,409 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:37,409 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:37,409 INFO L426 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-01-16 18:31:37,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:37,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1035428716, now seen corresponding path program 155 times [2020-01-16 18:31:37,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:37,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237874760] [2020-01-16 18:31:37,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:37,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-01-16 18:31:37,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237874760] [2020-01-16 18:31:37,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:37,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:37,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30043120] [2020-01-16 18:31:37,602 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:37,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:37,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:37,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:37,603 INFO L87 Difference]: Start difference. First operand 217 states and 655 transitions. Second operand 8 states. [2020-01-16 18:31:37,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:37,695 INFO L93 Difference]: Finished difference Result 348 states and 900 transitions. [2020-01-16 18:31:37,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:37,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:37,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:37,696 INFO L225 Difference]: With dead ends: 348 [2020-01-16 18:31:37,696 INFO L226 Difference]: Without dead ends: 334 [2020-01-16 18:31:37,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:37,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-01-16 18:31:37,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 219. [2020-01-16 18:31:37,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-01-16 18:31:37,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 658 transitions. [2020-01-16 18:31:37,702 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 658 transitions. Word has length 19 [2020-01-16 18:31:37,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:37,702 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 658 transitions. [2020-01-16 18:31:37,702 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 658 transitions. [2020-01-16 18:31:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:37,703 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:37,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-01-16 18:31:37,703 INFO L426 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-01-16 18:31:37,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:37,703 INFO L82 PathProgramCache]: Analyzing trace with hash 84701114, now seen corresponding path program 156 times [2020-01-16 18:31:37,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:37,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594939417] [2020-01-16 18:31:37,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:37,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594939417] [2020-01-16 18:31:37,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:37,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:37,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450182735] [2020-01-16 18:31:37,899 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:37,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:37,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:37,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:37,899 INFO L87 Difference]: Start difference. First operand 219 states and 658 transitions. Second operand 8 states. [2020-01-16 18:31:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:37,963 INFO L93 Difference]: Finished difference Result 335 states and 880 transitions. [2020-01-16 18:31:37,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:37,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:37,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:37,964 INFO L225 Difference]: With dead ends: 335 [2020-01-16 18:31:37,964 INFO L226 Difference]: Without dead ends: 319 [2020-01-16 18:31:37,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-01-16 18:31:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-01-16 18:31:37,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 213. [2020-01-16 18:31:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-01-16 18:31:37,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 646 transitions. [2020-01-16 18:31:37,970 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 646 transitions. Word has length 19 [2020-01-16 18:31:37,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:37,970 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 646 transitions. [2020-01-16 18:31:37,971 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:37,971 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 646 transitions. [2020-01-16 18:31:37,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:37,971 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:37,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-01-16 18:31:37,971 INFO L426 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-01-16 18:31:37,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:37,971 INFO L82 PathProgramCache]: Analyzing trace with hash -694390430, now seen corresponding path program 157 times [2020-01-16 18:31:37,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:37,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463956991] [2020-01-16 18:31:37,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:38,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463956991] [2020-01-16 18:31:38,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:38,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:38,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303106961] [2020-01-16 18:31:38,173 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:38,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:38,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:38,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:38,173 INFO L87 Difference]: Start difference. First operand 213 states and 646 transitions. Second operand 8 states. [2020-01-16 18:31:38,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:38,247 INFO L93 Difference]: Finished difference Result 363 states and 936 transitions. [2020-01-16 18:31:38,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:38,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:38,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:38,248 INFO L225 Difference]: With dead ends: 363 [2020-01-16 18:31:38,248 INFO L226 Difference]: Without dead ends: 347 [2020-01-16 18:31:38,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-01-16 18:31:38,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-01-16 18:31:38,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 219. [2020-01-16 18:31:38,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-01-16 18:31:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 660 transitions. [2020-01-16 18:31:38,253 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 660 transitions. Word has length 19 [2020-01-16 18:31:38,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:38,253 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 660 transitions. [2020-01-16 18:31:38,253 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 660 transitions. [2020-01-16 18:31:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:38,254 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:38,254 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:38,254 INFO L426 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-01-16 18:31:38,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:38,254 INFO L82 PathProgramCache]: Analyzing trace with hash -435332204, now seen corresponding path program 158 times [2020-01-16 18:31:38,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:38,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204486665] [2020-01-16 18:31:38,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:38,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204486665] [2020-01-16 18:31:38,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:38,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:38,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182549671] [2020-01-16 18:31:38,452 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:38,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:38,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:38,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:38,453 INFO L87 Difference]: Start difference. First operand 219 states and 660 transitions. Second operand 8 states. [2020-01-16 18:31:38,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:38,525 INFO L93 Difference]: Finished difference Result 357 states and 921 transitions. [2020-01-16 18:31:38,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:38,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:38,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:38,526 INFO L225 Difference]: With dead ends: 357 [2020-01-16 18:31:38,527 INFO L226 Difference]: Without dead ends: 344 [2020-01-16 18:31:38,527 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:38,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-01-16 18:31:38,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 216. [2020-01-16 18:31:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 18:31:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 653 transitions. [2020-01-16 18:31:38,532 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 653 transitions. Word has length 19 [2020-01-16 18:31:38,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:38,532 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 653 transitions. [2020-01-16 18:31:38,532 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 653 transitions. [2020-01-16 18:31:38,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:38,533 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:38,533 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:38,533 INFO L426 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-01-16 18:31:38,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:38,533 INFO L82 PathProgramCache]: Analyzing trace with hash 399701158, now seen corresponding path program 159 times [2020-01-16 18:31:38,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:38,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142185301] [2020-01-16 18:31:38,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:38,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-01-16 18:31:38,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142185301] [2020-01-16 18:31:38,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:38,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:38,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271821566] [2020-01-16 18:31:38,736 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:38,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:38,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:38,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:38,736 INFO L87 Difference]: Start difference. First operand 216 states and 653 transitions. Second operand 8 states. [2020-01-16 18:31:38,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:38,806 INFO L93 Difference]: Finished difference Result 363 states and 933 transitions. [2020-01-16 18:31:38,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:38,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:38,807 INFO L225 Difference]: With dead ends: 363 [2020-01-16 18:31:38,807 INFO L226 Difference]: Without dead ends: 347 [2020-01-16 18:31:38,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-01-16 18:31:38,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-01-16 18:31:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 222. [2020-01-16 18:31:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-01-16 18:31:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 664 transitions. [2020-01-16 18:31:38,812 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 664 transitions. Word has length 19 [2020-01-16 18:31:38,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:38,812 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 664 transitions. [2020-01-16 18:31:38,812 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:38,812 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 664 transitions. [2020-01-16 18:31:38,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:38,813 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:38,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-01-16 18:31:38,813 INFO L426 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-01-16 18:31:38,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:38,813 INFO L82 PathProgramCache]: Analyzing trace with hash -576503592, now seen corresponding path program 160 times [2020-01-16 18:31:38,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:38,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991686593] [2020-01-16 18:31:38,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31: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-01-16 18:31:39,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991686593] [2020-01-16 18:31:39,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:39,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:39,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830083086] [2020-01-16 18:31:39,013 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:39,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:39,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:39,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:39,013 INFO L87 Difference]: Start difference. First operand 222 states and 664 transitions. Second operand 8 states. [2020-01-16 18:31:39,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:39,103 INFO L93 Difference]: Finished difference Result 360 states and 922 transitions. [2020-01-16 18:31:39,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:39,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:39,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:39,105 INFO L225 Difference]: With dead ends: 360 [2020-01-16 18:31:39,105 INFO L226 Difference]: Without dead ends: 341 [2020-01-16 18:31:39,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-01-16 18:31:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-01-16 18:31:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 216. [2020-01-16 18:31:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 18:31:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 650 transitions. [2020-01-16 18:31:39,111 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 650 transitions. Word has length 19 [2020-01-16 18:31:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:39,111 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 650 transitions. [2020-01-16 18:31:39,111 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 650 transitions. [2020-01-16 18:31:39,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:39,112 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:39,112 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:39,112 INFO L426 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-01-16 18:31:39,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:39,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1883903552, now seen corresponding path program 161 times [2020-01-16 18:31:39,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:39,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845698030] [2020-01-16 18:31:39,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:39,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845698030] [2020-01-16 18:31:39,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:39,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:39,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680710645] [2020-01-16 18:31:39,317 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:39,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:39,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:39,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:39,317 INFO L87 Difference]: Start difference. First operand 216 states and 650 transitions. Second operand 8 states. [2020-01-16 18:31:39,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:39,382 INFO L93 Difference]: Finished difference Result 347 states and 894 transitions. [2020-01-16 18:31:39,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:39,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:39,384 INFO L225 Difference]: With dead ends: 347 [2020-01-16 18:31:39,384 INFO L226 Difference]: Without dead ends: 337 [2020-01-16 18:31:39,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-01-16 18:31:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-01-16 18:31:39,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 218. [2020-01-16 18:31:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 18:31:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 653 transitions. [2020-01-16 18:31:39,389 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 653 transitions. Word has length 19 [2020-01-16 18:31:39,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:39,390 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 653 transitions. [2020-01-16 18:31:39,390 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 653 transitions. [2020-01-16 18:31:39,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:39,390 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:39,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-01-16 18:31:39,390 INFO L426 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-01-16 18:31:39,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:39,391 INFO L82 PathProgramCache]: Analyzing trace with hash -394498556, now seen corresponding path program 162 times [2020-01-16 18:31:39,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:39,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841696932] [2020-01-16 18:31:39,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:39,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-01-16 18:31:39,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841696932] [2020-01-16 18:31:39,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:39,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:39,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958287225] [2020-01-16 18:31:39,603 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:39,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:39,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:39,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:39,603 INFO L87 Difference]: Start difference. First operand 218 states and 653 transitions. Second operand 8 states. [2020-01-16 18:31:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:39,697 INFO L93 Difference]: Finished difference Result 345 states and 889 transitions. [2020-01-16 18:31:39,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:39,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:39,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:39,698 INFO L225 Difference]: With dead ends: 345 [2020-01-16 18:31:39,698 INFO L226 Difference]: Without dead ends: 327 [2020-01-16 18:31:39,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-01-16 18:31:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-01-16 18:31:39,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 213. [2020-01-16 18:31:39,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-01-16 18:31:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 643 transitions. [2020-01-16 18:31:39,704 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 643 transitions. Word has length 19 [2020-01-16 18:31:39,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:39,704 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 643 transitions. [2020-01-16 18:31:39,704 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 643 transitions. [2020-01-16 18:31:39,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:39,705 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:39,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-01-16 18:31:39,705 INFO L426 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-01-16 18:31:39,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:39,705 INFO L82 PathProgramCache]: Analyzing trace with hash 600573882, now seen corresponding path program 163 times [2020-01-16 18:31:39,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:39,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325600065] [2020-01-16 18:31:39,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:39,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325600065] [2020-01-16 18:31:39,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:39,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:39,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148747670] [2020-01-16 18:31:39,896 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:39,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:39,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:39,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:39,897 INFO L87 Difference]: Start difference. First operand 213 states and 643 transitions. Second operand 8 states. [2020-01-16 18:31:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:39,982 INFO L93 Difference]: Finished difference Result 353 states and 915 transitions. [2020-01-16 18:31:39,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:39,982 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:39,983 INFO L225 Difference]: With dead ends: 353 [2020-01-16 18:31:39,983 INFO L226 Difference]: Without dead ends: 339 [2020-01-16 18:31:39,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-01-16 18:31:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-01-16 18:31:39,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 217. [2020-01-16 18:31:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-01-16 18:31:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 653 transitions. [2020-01-16 18:31:39,988 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 653 transitions. Word has length 19 [2020-01-16 18:31:39,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:39,988 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 653 transitions. [2020-01-16 18:31:39,988 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:39,988 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 653 transitions. [2020-01-16 18:31:39,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:39,989 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:39,989 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:39,989 INFO L426 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-01-16 18:31:39,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:39,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1720703712, now seen corresponding path program 164 times [2020-01-16 18:31:39,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:39,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235584285] [2020-01-16 18:31:39,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:40,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235584285] [2020-01-16 18:31:40,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:40,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:40,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417656840] [2020-01-16 18:31:40,203 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:40,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:40,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:40,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:40,203 INFO L87 Difference]: Start difference. First operand 217 states and 653 transitions. Second operand 8 states. [2020-01-16 18:31:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:40,283 INFO L93 Difference]: Finished difference Result 349 states and 904 transitions. [2020-01-16 18:31:40,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:40,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:40,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:40,285 INFO L225 Difference]: With dead ends: 349 [2020-01-16 18:31:40,285 INFO L226 Difference]: Without dead ends: 337 [2020-01-16 18:31:40,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:40,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-01-16 18:31:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 215. [2020-01-16 18:31:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-01-16 18:31:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 648 transitions. [2020-01-16 18:31:40,290 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 648 transitions. Word has length 19 [2020-01-16 18:31:40,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:40,290 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 648 transitions. [2020-01-16 18:31:40,290 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:40,290 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 648 transitions. [2020-01-16 18:31:40,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:40,291 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:40,291 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:40,291 INFO L426 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-01-16 18:31:40,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:40,291 INFO L82 PathProgramCache]: Analyzing trace with hash -472511498, now seen corresponding path program 165 times [2020-01-16 18:31:40,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:40,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713773493] [2020-01-16 18:31:40,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:40,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713773493] [2020-01-16 18:31:40,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:40,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:40,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579431322] [2020-01-16 18:31:40,491 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:40,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:40,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:40,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:40,491 INFO L87 Difference]: Start difference. First operand 215 states and 648 transitions. Second operand 8 states. [2020-01-16 18:31:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:40,572 INFO L93 Difference]: Finished difference Result 354 states and 915 transitions. [2020-01-16 18:31:40,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:40,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:40,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:40,574 INFO L225 Difference]: With dead ends: 354 [2020-01-16 18:31:40,574 INFO L226 Difference]: Without dead ends: 340 [2020-01-16 18:31:40,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-01-16 18:31:40,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-01-16 18:31:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 220. [2020-01-16 18:31:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-01-16 18:31:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 658 transitions. [2020-01-16 18:31:40,579 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 658 transitions. Word has length 19 [2020-01-16 18:31:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:40,579 INFO L478 AbstractCegarLoop]: Abstraction has 220 states and 658 transitions. [2020-01-16 18:31:40,579 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 658 transitions. [2020-01-16 18:31:40,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:40,580 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:40,580 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:40,580 INFO L426 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-01-16 18:31:40,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:40,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1114568416, now seen corresponding path program 166 times [2020-01-16 18:31:40,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:40,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544472995] [2020-01-16 18:31:40,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:40,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544472995] [2020-01-16 18:31:40,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:40,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:40,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665430757] [2020-01-16 18:31:40,778 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:40,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:40,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:40,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:40,778 INFO L87 Difference]: Start difference. First operand 220 states and 658 transitions. Second operand 8 states. [2020-01-16 18:31:40,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:40,864 INFO L93 Difference]: Finished difference Result 353 states and 908 transitions. [2020-01-16 18:31:40,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:40,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:40,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:40,865 INFO L225 Difference]: With dead ends: 353 [2020-01-16 18:31:40,865 INFO L226 Difference]: Without dead ends: 335 [2020-01-16 18:31:40,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-01-16 18:31:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 215. [2020-01-16 18:31:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-01-16 18:31:40,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 646 transitions. [2020-01-16 18:31:40,871 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 646 transitions. Word has length 19 [2020-01-16 18:31:40,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:40,871 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 646 transitions. [2020-01-16 18:31:40,871 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 646 transitions. [2020-01-16 18:31:40,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:40,872 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:40,872 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:40,872 INFO L426 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-01-16 18:31:40,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:40,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1498552428, now seen corresponding path program 167 times [2020-01-16 18:31:40,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:40,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092567828] [2020-01-16 18:31:40,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:41,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092567828] [2020-01-16 18:31:41,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:41,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:41,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427927747] [2020-01-16 18:31:41,073 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:41,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:41,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:41,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:41,073 INFO L87 Difference]: Start difference. First operand 215 states and 646 transitions. Second operand 8 states. [2020-01-16 18:31:41,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:41,150 INFO L93 Difference]: Finished difference Result 343 states and 885 transitions. [2020-01-16 18:31:41,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:41,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:41,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:41,152 INFO L225 Difference]: With dead ends: 343 [2020-01-16 18:31:41,152 INFO L226 Difference]: Without dead ends: 333 [2020-01-16 18:31:41,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:41,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-01-16 18:31:41,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 217. [2020-01-16 18:31:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-01-16 18:31:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 649 transitions. [2020-01-16 18:31:41,157 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 649 transitions. Word has length 19 [2020-01-16 18:31:41,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:41,157 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 649 transitions. [2020-01-16 18:31:41,157 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 649 transitions. [2020-01-16 18:31:41,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:41,158 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:41,158 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:41,158 INFO L426 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-01-16 18:31:41,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:41,158 INFO L82 PathProgramCache]: Analyzing trace with hash -9147432, now seen corresponding path program 168 times [2020-01-16 18:31:41,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:41,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406579456] [2020-01-16 18:31:41,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:41,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406579456] [2020-01-16 18:31:41,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:41,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:41,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575675829] [2020-01-16 18:31:41,364 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:41,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:41,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:41,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:41,364 INFO L87 Difference]: Start difference. First operand 217 states and 649 transitions. Second operand 8 states. [2020-01-16 18:31:41,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:41,448 INFO L93 Difference]: Finished difference Result 341 states and 880 transitions. [2020-01-16 18:31:41,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:41,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:41,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:41,449 INFO L225 Difference]: With dead ends: 341 [2020-01-16 18:31:41,449 INFO L226 Difference]: Without dead ends: 319 [2020-01-16 18:31:41,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:41,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-01-16 18:31:41,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 208. [2020-01-16 18:31:41,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-01-16 18:31:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 632 transitions. [2020-01-16 18:31:41,454 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 632 transitions. Word has length 19 [2020-01-16 18:31:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:41,454 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 632 transitions. [2020-01-16 18:31:41,454 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 632 transitions. [2020-01-16 18:31:41,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:41,454 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:41,454 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:41,455 INFO L426 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-01-16 18:31:41,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:41,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1927068432, now seen corresponding path program 169 times [2020-01-16 18:31:41,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:41,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998492054] [2020-01-16 18:31:41,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:41,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998492054] [2020-01-16 18:31:41,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:41,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:41,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716661483] [2020-01-16 18:31:41,727 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:41,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:41,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:41,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:41,727 INFO L87 Difference]: Start difference. First operand 208 states and 632 transitions. Second operand 8 states. [2020-01-16 18:31:41,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:41,795 INFO L93 Difference]: Finished difference Result 378 states and 982 transitions. [2020-01-16 18:31:41,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:41,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:41,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:41,797 INFO L225 Difference]: With dead ends: 378 [2020-01-16 18:31:41,797 INFO L226 Difference]: Without dead ends: 362 [2020-01-16 18:31:41,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-01-16 18:31:41,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-01-16 18:31:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 224. [2020-01-16 18:31:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-01-16 18:31:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 674 transitions. [2020-01-16 18:31:41,806 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 674 transitions. Word has length 19 [2020-01-16 18:31:41,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:41,807 INFO L478 AbstractCegarLoop]: Abstraction has 224 states and 674 transitions. [2020-01-16 18:31:41,807 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:41,807 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 674 transitions. [2020-01-16 18:31:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:41,808 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:41,808 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:41,809 INFO L426 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-01-16 18:31:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:41,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1552417246, now seen corresponding path program 170 times [2020-01-16 18:31:41,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:41,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823797966] [2020-01-16 18:31:41,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:42,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823797966] [2020-01-16 18:31:42,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:42,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:42,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020949409] [2020-01-16 18:31:42,014 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:42,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:42,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:42,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:42,015 INFO L87 Difference]: Start difference. First operand 224 states and 674 transitions. Second operand 8 states. [2020-01-16 18:31:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:42,092 INFO L93 Difference]: Finished difference Result 376 states and 972 transitions. [2020-01-16 18:31:42,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:42,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:42,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:42,093 INFO L225 Difference]: With dead ends: 376 [2020-01-16 18:31:42,094 INFO L226 Difference]: Without dead ends: 354 [2020-01-16 18:31:42,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-01-16 18:31:42,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-01-16 18:31:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 216. [2020-01-16 18:31:42,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 18:31:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 656 transitions. [2020-01-16 18:31:42,099 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 656 transitions. Word has length 19 [2020-01-16 18:31:42,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:42,100 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 656 transitions. [2020-01-16 18:31:42,100 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 656 transitions. [2020-01-16 18:31:42,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:42,100 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:42,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-01-16 18:31:42,100 INFO L426 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-01-16 18:31:42,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:42,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1396871126, now seen corresponding path program 171 times [2020-01-16 18:31:42,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:42,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455768453] [2020-01-16 18:31:42,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:42,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455768453] [2020-01-16 18:31:42,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:42,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:42,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312189778] [2020-01-16 18:31:42,320 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:42,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:42,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:42,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:42,320 INFO L87 Difference]: Start difference. First operand 216 states and 656 transitions. Second operand 8 states. [2020-01-16 18:31:42,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:42,407 INFO L93 Difference]: Finished difference Result 369 states and 955 transitions. [2020-01-16 18:31:42,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:42,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:42,408 INFO L225 Difference]: With dead ends: 369 [2020-01-16 18:31:42,408 INFO L226 Difference]: Without dead ends: 353 [2020-01-16 18:31:42,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-01-16 18:31:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-01-16 18:31:42,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 219. [2020-01-16 18:31:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-01-16 18:31:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 660 transitions. [2020-01-16 18:31:42,414 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 660 transitions. Word has length 19 [2020-01-16 18:31:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:42,414 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 660 transitions. [2020-01-16 18:31:42,414 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 660 transitions. [2020-01-16 18:31:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:42,415 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:42,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-01-16 18:31:42,415 INFO L426 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-01-16 18:31:42,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:42,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1137812900, now seen corresponding path program 172 times [2020-01-16 18:31:42,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:42,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963568951] [2020-01-16 18:31:42,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:42,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963568951] [2020-01-16 18:31:42,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:42,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:42,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746874277] [2020-01-16 18:31:42,605 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:42,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:42,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:42,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:42,606 INFO L87 Difference]: Start difference. First operand 219 states and 660 transitions. Second operand 8 states. [2020-01-16 18:31:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:42,701 INFO L93 Difference]: Finished difference Result 363 states and 940 transitions. [2020-01-16 18:31:42,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:42,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:42,702 INFO L225 Difference]: With dead ends: 363 [2020-01-16 18:31:42,702 INFO L226 Difference]: Without dead ends: 350 [2020-01-16 18:31:42,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-01-16 18:31:42,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-01-16 18:31:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 216. [2020-01-16 18:31:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 18:31:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 653 transitions. [2020-01-16 18:31:42,708 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 653 transitions. Word has length 19 [2020-01-16 18:31:42,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:42,708 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 653 transitions. [2020-01-16 18:31:42,708 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:42,708 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 653 transitions. [2020-01-16 18:31:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:42,708 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:42,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-01-16 18:31:42,709 INFO L426 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-01-16 18:31:42,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:42,709 INFO L82 PathProgramCache]: Analyzing trace with hash 525434594, now seen corresponding path program 173 times [2020-01-16 18:31:42,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:42,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896863391] [2020-01-16 18:31:42,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:42,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896863391] [2020-01-16 18:31:42,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:42,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:42,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381133057] [2020-01-16 18:31:42,898 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:42,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:42,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:42,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:42,899 INFO L87 Difference]: Start difference. First operand 216 states and 653 transitions. Second operand 8 states. [2020-01-16 18:31:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:42,998 INFO L93 Difference]: Finished difference Result 364 states and 944 transitions. [2020-01-16 18:31:42,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:42,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:42,999 INFO L225 Difference]: With dead ends: 364 [2020-01-16 18:31:42,999 INFO L226 Difference]: Without dead ends: 350 [2020-01-16 18:31:43,000 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:43,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-01-16 18:31:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 218. [2020-01-16 18:31:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 18:31:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 656 transitions. [2020-01-16 18:31:43,004 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 656 transitions. Word has length 19 [2020-01-16 18:31:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:43,005 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 656 transitions. [2020-01-16 18:31:43,005 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 656 transitions. [2020-01-16 18:31:43,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:43,005 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:43,005 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:43,005 INFO L426 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-01-16 18:31:43,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:43,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1645564424, now seen corresponding path program 174 times [2020-01-16 18:31:43,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:43,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266377859] [2020-01-16 18:31:43,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:43,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266377859] [2020-01-16 18:31:43,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:43,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:43,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887672141] [2020-01-16 18:31:43,201 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:43,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:43,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:43,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:43,202 INFO L87 Difference]: Start difference. First operand 218 states and 656 transitions. Second operand 8 states. [2020-01-16 18:31:43,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:43,271 INFO L93 Difference]: Finished difference Result 360 states and 933 transitions. [2020-01-16 18:31:43,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:43,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:43,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:43,272 INFO L225 Difference]: With dead ends: 360 [2020-01-16 18:31:43,272 INFO L226 Difference]: Without dead ends: 344 [2020-01-16 18:31:43,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-01-16 18:31:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-01-16 18:31:43,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 212. [2020-01-16 18:31:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 18:31:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 644 transitions. [2020-01-16 18:31:43,278 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 644 transitions. Word has length 19 [2020-01-16 18:31:43,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:43,278 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 644 transitions. [2020-01-16 18:31:43,278 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:43,279 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 644 transitions. [2020-01-16 18:31:43,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:43,279 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:43,279 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:43,279 INFO L426 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-01-16 18:31:43,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:43,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1945413138, now seen corresponding path program 175 times [2020-01-16 18:31:43,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:43,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341122379] [2020-01-16 18:31:43,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:43,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341122379] [2020-01-16 18:31:43,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:43,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:43,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045405750] [2020-01-16 18:31:43,483 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:43,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:43,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:43,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:43,483 INFO L87 Difference]: Start difference. First operand 212 states and 644 transitions. Second operand 8 states. [2020-01-16 18:31:43,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:43,546 INFO L93 Difference]: Finished difference Result 380 states and 985 transitions. [2020-01-16 18:31:43,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:43,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:43,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:43,548 INFO L225 Difference]: With dead ends: 380 [2020-01-16 18:31:43,548 INFO L226 Difference]: Without dead ends: 364 [2020-01-16 18:31:43,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-01-16 18:31:43,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-01-16 18:31:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 226. [2020-01-16 18:31:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-01-16 18:31:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 679 transitions. [2020-01-16 18:31:43,554 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 679 transitions. Word has length 19 [2020-01-16 18:31:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:43,554 INFO L478 AbstractCegarLoop]: Abstraction has 226 states and 679 transitions. [2020-01-16 18:31:43,554 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 679 transitions. [2020-01-16 18:31:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:43,555 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:43,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-01-16 18:31:43,555 INFO L426 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-01-16 18:31:43,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:43,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1974902972, now seen corresponding path program 176 times [2020-01-16 18:31:43,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:43,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73441921] [2020-01-16 18:31:43,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:43,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73441921] [2020-01-16 18:31:43,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:43,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:43,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911703407] [2020-01-16 18:31:43,771 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:43,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:43,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:43,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:43,772 INFO L87 Difference]: Start difference. First operand 226 states and 679 transitions. Second operand 8 states. [2020-01-16 18:31:43,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:43,865 INFO L93 Difference]: Finished difference Result 378 states and 975 transitions. [2020-01-16 18:31:43,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:43,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:43,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:43,866 INFO L225 Difference]: With dead ends: 378 [2020-01-16 18:31:43,866 INFO L226 Difference]: Without dead ends: 356 [2020-01-16 18:31:43,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-01-16 18:31:43,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2020-01-16 18:31:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 218. [2020-01-16 18:31:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 18:31:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 659 transitions. [2020-01-16 18:31:43,872 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 659 transitions. Word has length 19 [2020-01-16 18:31:43,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:43,873 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 659 transitions. [2020-01-16 18:31:43,873 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:43,873 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 659 transitions. [2020-01-16 18:31:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:43,873 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:43,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-01-16 18:31:43,874 INFO L426 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-01-16 18:31:43,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1493760628, now seen corresponding path program 177 times [2020-01-16 18:31:43,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:43,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083024972] [2020-01-16 18:31:43,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:44,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083024972] [2020-01-16 18:31:44,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:44,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:44,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849577444] [2020-01-16 18:31:44,081 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:44,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:44,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:44,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:44,081 INFO L87 Difference]: Start difference. First operand 218 states and 659 transitions. Second operand 8 states. [2020-01-16 18:31:44,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:44,150 INFO L93 Difference]: Finished difference Result 375 states and 968 transitions. [2020-01-16 18:31:44,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:44,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:44,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:44,152 INFO L225 Difference]: With dead ends: 375 [2020-01-16 18:31:44,152 INFO L226 Difference]: Without dead ends: 359 [2020-01-16 18:31:44,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-01-16 18:31:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-01-16 18:31:44,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 223. [2020-01-16 18:31:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-01-16 18:31:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 668 transitions. [2020-01-16 18:31:44,158 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 668 transitions. Word has length 19 [2020-01-16 18:31:44,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:44,158 INFO L478 AbstractCegarLoop]: Abstraction has 223 states and 668 transitions. [2020-01-16 18:31:44,158 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:44,158 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 668 transitions. [2020-01-16 18:31:44,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:44,159 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:44,159 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:44,159 INFO L426 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-01-16 18:31:44,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:44,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2050144574, now seen corresponding path program 178 times [2020-01-16 18:31:44,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:44,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141275354] [2020-01-16 18:31:44,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:44,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141275354] [2020-01-16 18:31:44,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:44,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:44,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908631388] [2020-01-16 18:31:44,360 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:44,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:44,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:44,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:44,361 INFO L87 Difference]: Start difference. First operand 223 states and 668 transitions. Second operand 8 states. [2020-01-16 18:31:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:44,445 INFO L93 Difference]: Finished difference Result 371 states and 956 transitions. [2020-01-16 18:31:44,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:44,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:44,447 INFO L225 Difference]: With dead ends: 371 [2020-01-16 18:31:44,447 INFO L226 Difference]: Without dead ends: 354 [2020-01-16 18:31:44,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:44,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-01-16 18:31:44,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 218. [2020-01-16 18:31:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 18:31:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 654 transitions. [2020-01-16 18:31:44,452 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 654 transitions. Word has length 19 [2020-01-16 18:31:44,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:44,452 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 654 transitions. [2020-01-16 18:31:44,453 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 654 transitions. [2020-01-16 18:31:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:44,453 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:44,453 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:44,453 INFO L426 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-01-16 18:31:44,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:44,453 INFO L82 PathProgramCache]: Analyzing trace with hash 780024098, now seen corresponding path program 179 times [2020-01-16 18:31:44,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:44,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699361268] [2020-01-16 18:31:44,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:44,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699361268] [2020-01-16 18:31:44,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:44,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:44,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908732459] [2020-01-16 18:31:44,643 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:44,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:44,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:44,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:44,643 INFO L87 Difference]: Start difference. First operand 218 states and 654 transitions. Second operand 8 states. [2020-01-16 18:31:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:44,731 INFO L93 Difference]: Finished difference Result 370 states and 955 transitions. [2020-01-16 18:31:44,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:44,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:44,732 INFO L225 Difference]: With dead ends: 370 [2020-01-16 18:31:44,732 INFO L226 Difference]: Without dead ends: 356 [2020-01-16 18:31:44,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-01-16 18:31:44,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2020-01-16 18:31:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 222. [2020-01-16 18:31:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-01-16 18:31:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 662 transitions. [2020-01-16 18:31:44,738 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 662 transitions. Word has length 19 [2020-01-16 18:31:44,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:44,738 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 662 transitions. [2020-01-16 18:31:44,738 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 662 transitions. [2020-01-16 18:31:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:44,738 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:44,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-01-16 18:31:44,739 INFO L426 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-01-16 18:31:44,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:44,739 INFO L82 PathProgramCache]: Analyzing trace with hash 779429452, now seen corresponding path program 180 times [2020-01-16 18:31:44,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:44,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059720071] [2020-01-16 18:31:44,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:44,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-01-16 18:31:44,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059720071] [2020-01-16 18:31:44,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:44,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:44,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515721718] [2020-01-16 18:31:44,929 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:44,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:44,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:44,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:44,930 INFO L87 Difference]: Start difference. First operand 222 states and 662 transitions. Second operand 8 states. [2020-01-16 18:31:45,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:45,021 INFO L93 Difference]: Finished difference Result 368 states and 947 transitions. [2020-01-16 18:31:45,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:45,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:45,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:45,022 INFO L225 Difference]: With dead ends: 368 [2020-01-16 18:31:45,022 INFO L226 Difference]: Without dead ends: 346 [2020-01-16 18:31:45,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:45,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-01-16 18:31:45,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 212. [2020-01-16 18:31:45,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 18:31:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 640 transitions. [2020-01-16 18:31:45,027 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 640 transitions. Word has length 19 [2020-01-16 18:31:45,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:45,027 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 640 transitions. [2020-01-16 18:31:45,027 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:45,027 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 640 transitions. [2020-01-16 18:31:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:45,027 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:45,027 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:45,028 INFO L426 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-01-16 18:31:45,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:45,028 INFO L82 PathProgramCache]: Analyzing trace with hash -637075472, now seen corresponding path program 181 times [2020-01-16 18:31:45,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:45,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635705464] [2020-01-16 18:31:45,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:45,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-01-16 18:31:45,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635705464] [2020-01-16 18:31:45,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:45,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:45,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980625474] [2020-01-16 18:31:45,219 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:45,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:45,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:45,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:45,220 INFO L87 Difference]: Start difference. First operand 212 states and 640 transitions. Second operand 8 states. [2020-01-16 18:31:45,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:45,295 INFO L93 Difference]: Finished difference Result 357 states and 917 transitions. [2020-01-16 18:31:45,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:45,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:45,296 INFO L225 Difference]: With dead ends: 357 [2020-01-16 18:31:45,296 INFO L226 Difference]: Without dead ends: 341 [2020-01-16 18:31:45,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-01-16 18:31:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-01-16 18:31:45,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 218. [2020-01-16 18:31:45,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 18:31:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 654 transitions. [2020-01-16 18:31:45,301 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 654 transitions. Word has length 19 [2020-01-16 18:31:45,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:45,301 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 654 transitions. [2020-01-16 18:31:45,301 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:45,301 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 654 transitions. [2020-01-16 18:31:45,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:45,302 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:45,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-01-16 18:31:45,302 INFO L426 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-01-16 18:31:45,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:45,302 INFO L82 PathProgramCache]: Analyzing trace with hash -378017246, now seen corresponding path program 182 times [2020-01-16 18:31:45,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:45,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471763108] [2020-01-16 18:31:45,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:45,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-01-16 18:31:45,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471763108] [2020-01-16 18:31:45,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:45,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:45,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269418303] [2020-01-16 18:31:45,500 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:45,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:45,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:45,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:45,500 INFO L87 Difference]: Start difference. First operand 218 states and 654 transitions. Second operand 8 states. [2020-01-16 18:31:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:45,567 INFO L93 Difference]: Finished difference Result 351 states and 902 transitions. [2020-01-16 18:31:45,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:45,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:45,569 INFO L225 Difference]: With dead ends: 351 [2020-01-16 18:31:45,569 INFO L226 Difference]: Without dead ends: 338 [2020-01-16 18:31:45,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:45,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-01-16 18:31:45,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 215. [2020-01-16 18:31:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-01-16 18:31:45,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 647 transitions. [2020-01-16 18:31:45,574 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 647 transitions. Word has length 19 [2020-01-16 18:31:45,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:45,574 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 647 transitions. [2020-01-16 18:31:45,574 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 647 transitions. [2020-01-16 18:31:45,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:45,575 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:45,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-01-16 18:31:45,575 INFO L426 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-01-16 18:31:45,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:45,575 INFO L82 PathProgramCache]: Analyzing trace with hash 2057453970, now seen corresponding path program 183 times [2020-01-16 18:31:45,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:45,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69987868] [2020-01-16 18:31:45,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:45,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-01-16 18:31:45,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69987868] [2020-01-16 18:31:45,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:45,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:45,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068620416] [2020-01-16 18:31:45,772 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:45,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:45,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:45,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:45,773 INFO L87 Difference]: Start difference. First operand 215 states and 647 transitions. Second operand 8 states. [2020-01-16 18:31:45,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:45,843 INFO L93 Difference]: Finished difference Result 356 states and 912 transitions. [2020-01-16 18:31:45,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:45,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:45,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:45,844 INFO L225 Difference]: With dead ends: 356 [2020-01-16 18:31:45,844 INFO L226 Difference]: Without dead ends: 340 [2020-01-16 18:31:45,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:45,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-01-16 18:31:45,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 220. [2020-01-16 18:31:45,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-01-16 18:31:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 656 transitions. [2020-01-16 18:31:45,850 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 656 transitions. Word has length 19 [2020-01-16 18:31:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:45,850 INFO L478 AbstractCegarLoop]: Abstraction has 220 states and 656 transitions. [2020-01-16 18:31:45,851 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 656 transitions. [2020-01-16 18:31:45,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:45,851 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:45,851 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:45,851 INFO L426 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-01-16 18:31:45,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:45,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1306391876, now seen corresponding path program 184 times [2020-01-16 18:31:45,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:45,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132736226] [2020-01-16 18:31:45,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:46,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132736226] [2020-01-16 18:31:46,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:46,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:46,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841861173] [2020-01-16 18:31:46,123 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:46,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:46,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:46,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:46,124 INFO L87 Difference]: Start difference. First operand 220 states and 656 transitions. Second operand 8 states. [2020-01-16 18:31:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:46,251 INFO L93 Difference]: Finished difference Result 352 states and 900 transitions. [2020-01-16 18:31:46,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:46,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:46,253 INFO L225 Difference]: With dead ends: 352 [2020-01-16 18:31:46,253 INFO L226 Difference]: Without dead ends: 335 [2020-01-16 18:31:46,253 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-01-16 18:31:46,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-01-16 18:31:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 215. [2020-01-16 18:31:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-01-16 18:31:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 644 transitions. [2020-01-16 18:31:46,262 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 644 transitions. Word has length 19 [2020-01-16 18:31:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:46,263 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 644 transitions. [2020-01-16 18:31:46,263 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 644 transitions. [2020-01-16 18:31:46,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:46,264 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:46,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-01-16 18:31:46,264 INFO L426 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-01-16 18:31:46,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:46,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1837091698, now seen corresponding path program 185 times [2020-01-16 18:31:46,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:46,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584471950] [2020-01-16 18:31:46,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:46,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584471950] [2020-01-16 18:31:46,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:46,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:46,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142502156] [2020-01-16 18:31:46,542 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:46,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:46,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:46,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:46,543 INFO L87 Difference]: Start difference. First operand 215 states and 644 transitions. Second operand 8 states. [2020-01-16 18:31:46,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:46,629 INFO L93 Difference]: Finished difference Result 341 states and 876 transitions. [2020-01-16 18:31:46,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:46,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:46,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:46,631 INFO L225 Difference]: With dead ends: 341 [2020-01-16 18:31:46,631 INFO L226 Difference]: Without dead ends: 331 [2020-01-16 18:31:46,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-01-16 18:31:46,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-01-16 18:31:46,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 217. [2020-01-16 18:31:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-01-16 18:31:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 647 transitions. [2020-01-16 18:31:46,641 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 647 transitions. Word has length 19 [2020-01-16 18:31:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:46,641 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 647 transitions. [2020-01-16 18:31:46,641 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:46,641 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 647 transitions. [2020-01-16 18:31:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:46,642 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:46,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-01-16 18:31:46,643 INFO L426 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-01-16 18:31:46,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:46,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1602568944, now seen corresponding path program 186 times [2020-01-16 18:31:46,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:46,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392546618] [2020-01-16 18:31:46,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:46,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392546618] [2020-01-16 18:31:46,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:46,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:46,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279632158] [2020-01-16 18:31:46,916 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:46,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:46,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:46,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:46,917 INFO L87 Difference]: Start difference. First operand 217 states and 647 transitions. Second operand 8 states. [2020-01-16 18:31:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:47,031 INFO L93 Difference]: Finished difference Result 339 states and 871 transitions. [2020-01-16 18:31:47,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:47,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:47,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:47,033 INFO L225 Difference]: With dead ends: 339 [2020-01-16 18:31:47,033 INFO L226 Difference]: Without dead ends: 322 [2020-01-16 18:31:47,034 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-01-16 18:31:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-01-16 18:31:47,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 212. [2020-01-16 18:31:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 18:31:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 637 transitions. [2020-01-16 18:31:47,043 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 637 transitions. Word has length 19 [2020-01-16 18:31:47,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:47,043 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 637 transitions. [2020-01-16 18:31:47,043 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:47,043 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 637 transitions. [2020-01-16 18:31:47,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:47,044 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:47,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-01-16 18:31:47,045 INFO L426 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-01-16 18:31:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:47,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2036640602, now seen corresponding path program 187 times [2020-01-16 18:31:47,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:47,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734951617] [2020-01-16 18:31:47,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:47,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734951617] [2020-01-16 18:31:47,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:47,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:47,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596954746] [2020-01-16 18:31:47,287 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:47,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:47,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:47,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:47,287 INFO L87 Difference]: Start difference. First operand 212 states and 637 transitions. Second operand 8 states. [2020-01-16 18:31:47,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:47,439 INFO L93 Difference]: Finished difference Result 347 states and 896 transitions. [2020-01-16 18:31:47,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:47,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:47,441 INFO L225 Difference]: With dead ends: 347 [2020-01-16 18:31:47,441 INFO L226 Difference]: Without dead ends: 333 [2020-01-16 18:31:47,442 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-01-16 18:31:47,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-01-16 18:31:47,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 216. [2020-01-16 18:31:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 18:31:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 647 transitions. [2020-01-16 18:31:47,451 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 647 transitions. Word has length 19 [2020-01-16 18:31:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:47,451 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 647 transitions. [2020-01-16 18:31:47,451 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:47,451 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 647 transitions. [2020-01-16 18:31:47,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:47,452 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:47,453 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:47,453 INFO L426 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-01-16 18:31:47,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:47,453 INFO L82 PathProgramCache]: Analyzing trace with hash -916510772, now seen corresponding path program 188 times [2020-01-16 18:31:47,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:47,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19768206] [2020-01-16 18:31:47,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:47,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19768206] [2020-01-16 18:31:47,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:47,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:47,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919100467] [2020-01-16 18:31:47,733 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:47,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:47,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:47,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:47,733 INFO L87 Difference]: Start difference. First operand 216 states and 647 transitions. Second operand 8 states. [2020-01-16 18:31:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:47,833 INFO L93 Difference]: Finished difference Result 343 states and 885 transitions. [2020-01-16 18:31:47,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:47,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:47,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:47,835 INFO L225 Difference]: With dead ends: 343 [2020-01-16 18:31:47,835 INFO L226 Difference]: Without dead ends: 331 [2020-01-16 18:31:47,835 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:47,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-01-16 18:31:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 214. [2020-01-16 18:31:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 18:31:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-01-16 18:31:47,843 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-01-16 18:31:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:47,843 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-01-16 18:31:47,843 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-01-16 18:31:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:47,844 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:47,844 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:47,844 INFO L426 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-01-16 18:31:47,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:47,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1513624196, now seen corresponding path program 189 times [2020-01-16 18:31:47,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:47,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505457978] [2020-01-16 18:31:47,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:48,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505457978] [2020-01-16 18:31:48,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:48,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:48,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627720968] [2020-01-16 18:31:48,119 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:48,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:48,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:48,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:48,120 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-01-16 18:31:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:48,259 INFO L93 Difference]: Finished difference Result 347 states and 894 transitions. [2020-01-16 18:31:48,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:48,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:48,261 INFO L225 Difference]: With dead ends: 347 [2020-01-16 18:31:48,261 INFO L226 Difference]: Without dead ends: 333 [2020-01-16 18:31:48,261 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-01-16 18:31:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-01-16 18:31:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 218. [2020-01-16 18:31:48,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 18:31:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 650 transitions. [2020-01-16 18:31:48,270 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 650 transitions. Word has length 19 [2020-01-16 18:31:48,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:48,270 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 650 transitions. [2020-01-16 18:31:48,270 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:48,271 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 650 transitions. [2020-01-16 18:31:48,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:48,271 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:48,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-01-16 18:31:48,272 INFO L426 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-01-16 18:31:48,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:48,272 INFO L82 PathProgramCache]: Analyzing trace with hash 768327052, now seen corresponding path program 190 times [2020-01-16 18:31:48,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:48,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702963321] [2020-01-16 18:31:48,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:48,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702963321] [2020-01-16 18:31:48,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:48,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:48,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788325835] [2020-01-16 18:31:48,463 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:48,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:48,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:48,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:48,463 INFO L87 Difference]: Start difference. First operand 218 states and 650 transitions. Second operand 8 states. [2020-01-16 18:31:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:48,545 INFO L93 Difference]: Finished difference Result 345 states and 886 transitions. [2020-01-16 18:31:48,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:48,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:48,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:48,547 INFO L225 Difference]: With dead ends: 345 [2020-01-16 18:31:48,547 INFO L226 Difference]: Without dead ends: 329 [2020-01-16 18:31:48,547 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-01-16 18:31:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 214. [2020-01-16 18:31:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 18:31:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 640 transitions. [2020-01-16 18:31:48,552 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 640 transitions. Word has length 19 [2020-01-16 18:31:48,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:48,552 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 640 transitions. [2020-01-16 18:31:48,553 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:48,553 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 640 transitions. [2020-01-16 18:31:48,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:48,553 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:48,553 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:48,553 INFO L426 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-01-16 18:31:48,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:48,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1451740574, now seen corresponding path program 191 times [2020-01-16 18:31:48,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:48,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740468868] [2020-01-16 18:31:48,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:48,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740468868] [2020-01-16 18:31:48,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:48,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:48,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508064746] [2020-01-16 18:31:48,747 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:48,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:48,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:48,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:48,748 INFO L87 Difference]: Start difference. First operand 214 states and 640 transitions. Second operand 8 states. [2020-01-16 18:31:48,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:48,808 INFO L93 Difference]: Finished difference Result 337 states and 867 transitions. [2020-01-16 18:31:48,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:48,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:48,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:48,810 INFO L225 Difference]: With dead ends: 337 [2020-01-16 18:31:48,810 INFO L226 Difference]: Without dead ends: 327 [2020-01-16 18:31:48,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-01-16 18:31:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-01-16 18:31:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 216. [2020-01-16 18:31:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 18:31:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 643 transitions. [2020-01-16 18:31:48,815 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 643 transitions. Word has length 19 [2020-01-16 18:31:48,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:48,815 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 643 transitions. [2020-01-16 18:31:48,815 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:48,816 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 643 transitions. [2020-01-16 18:31:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:48,816 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:48,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-01-16 18:31:48,816 INFO L426 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-01-16 18:31:48,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:48,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1987920068, now seen corresponding path program 192 times [2020-01-16 18:31:48,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:48,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550323415] [2020-01-16 18:31:48,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:49,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550323415] [2020-01-16 18:31:49,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:49,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:49,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578283321] [2020-01-16 18:31:49,002 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:49,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:49,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:49,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:49,002 INFO L87 Difference]: Start difference. First operand 216 states and 643 transitions. Second operand 8 states. [2020-01-16 18:31:49,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:49,084 INFO L93 Difference]: Finished difference Result 335 states and 862 transitions. [2020-01-16 18:31:49,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:49,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:49,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:49,085 INFO L225 Difference]: With dead ends: 335 [2020-01-16 18:31:49,085 INFO L226 Difference]: Without dead ends: 315 [2020-01-16 18:31:49,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:49,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-01-16 18:31:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 208. [2020-01-16 18:31:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-01-16 18:31:49,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 628 transitions. [2020-01-16 18:31:49,091 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 628 transitions. Word has length 19 [2020-01-16 18:31:49,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:49,092 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 628 transitions. [2020-01-16 18:31:49,092 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:49,092 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 628 transitions. [2020-01-16 18:31:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:49,092 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:49,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-01-16 18:31:49,093 INFO L426 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-01-16 18:31:49,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:49,093 INFO L82 PathProgramCache]: Analyzing trace with hash 807111978, now seen corresponding path program 193 times [2020-01-16 18:31:49,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:49,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129329741] [2020-01-16 18:31:49,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:49,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:49,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129329741] [2020-01-16 18:31:49,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:49,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:49,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319920760] [2020-01-16 18:31:49,333 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:49,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:49,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:49,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:49,334 INFO L87 Difference]: Start difference. First operand 208 states and 628 transitions. Second operand 8 states. [2020-01-16 18:31:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:49,398 INFO L93 Difference]: Finished difference Result 357 states and 929 transitions. [2020-01-16 18:31:49,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:49,398 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:49,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:49,399 INFO L225 Difference]: With dead ends: 357 [2020-01-16 18:31:49,399 INFO L226 Difference]: Without dead ends: 341 [2020-01-16 18:31:49,400 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-01-16 18:31:49,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 217. [2020-01-16 18:31:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-01-16 18:31:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 655 transitions. [2020-01-16 18:31:49,405 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 655 transitions. Word has length 19 [2020-01-16 18:31:49,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:49,405 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 655 transitions. [2020-01-16 18:31:49,405 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 655 transitions. [2020-01-16 18:31:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:49,405 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:49,406 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:49,406 INFO L426 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-01-16 18:31:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:49,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1066170204, now seen corresponding path program 194 times [2020-01-16 18:31:49,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:49,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025425157] [2020-01-16 18:31:49,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:49,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025425157] [2020-01-16 18:31:49,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:49,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:49,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078967154] [2020-01-16 18:31:49,615 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:49,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:49,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:49,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:49,616 INFO L87 Difference]: Start difference. First operand 217 states and 655 transitions. Second operand 8 states. [2020-01-16 18:31:49,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:49,683 INFO L93 Difference]: Finished difference Result 351 states and 914 transitions. [2020-01-16 18:31:49,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:49,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:49,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:49,685 INFO L225 Difference]: With dead ends: 351 [2020-01-16 18:31:49,685 INFO L226 Difference]: Without dead ends: 338 [2020-01-16 18:31:49,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-01-16 18:31:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-01-16 18:31:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 214. [2020-01-16 18:31:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 18:31:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 648 transitions. [2020-01-16 18:31:49,691 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 648 transitions. Word has length 19 [2020-01-16 18:31:49,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:49,691 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 648 transitions. [2020-01-16 18:31:49,691 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:49,691 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 648 transitions. [2020-01-16 18:31:49,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:49,691 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:49,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-01-16 18:31:49,692 INFO L426 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-01-16 18:31:49,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:49,692 INFO L82 PathProgramCache]: Analyzing trace with hash -793325876, now seen corresponding path program 195 times [2020-01-16 18:31:49,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:49,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398450117] [2020-01-16 18:31:49,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:49,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398450117] [2020-01-16 18:31:49,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:49,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:49,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712881965] [2020-01-16 18:31:49,895 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:49,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:49,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:49,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:49,896 INFO L87 Difference]: Start difference. First operand 214 states and 648 transitions. Second operand 8 states. [2020-01-16 18:31:49,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:49,974 INFO L93 Difference]: Finished difference Result 361 states and 938 transitions. [2020-01-16 18:31:49,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:49,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:49,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:49,975 INFO L225 Difference]: With dead ends: 361 [2020-01-16 18:31:49,976 INFO L226 Difference]: Without dead ends: 345 [2020-01-16 18:31:49,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2020-01-16 18:31:49,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 219. [2020-01-16 18:31:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-01-16 18:31:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 657 transitions. [2020-01-16 18:31:49,981 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 657 transitions. Word has length 19 [2020-01-16 18:31:49,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:49,982 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 657 transitions. [2020-01-16 18:31:49,982 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 657 transitions. [2020-01-16 18:31:49,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:49,982 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:49,982 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:49,982 INFO L426 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-01-16 18:31:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:49,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1544387970, now seen corresponding path program 196 times [2020-01-16 18:31:49,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:49,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609824957] [2020-01-16 18:31:49,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:50,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609824957] [2020-01-16 18:31:50,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:50,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:50,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507878912] [2020-01-16 18:31:50,207 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:50,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:50,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:50,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:50,207 INFO L87 Difference]: Start difference. First operand 219 states and 657 transitions. Second operand 8 states. [2020-01-16 18:31:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:50,301 INFO L93 Difference]: Finished difference Result 357 states and 926 transitions. [2020-01-16 18:31:50,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:50,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:50,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:50,302 INFO L225 Difference]: With dead ends: 357 [2020-01-16 18:31:50,302 INFO L226 Difference]: Without dead ends: 340 [2020-01-16 18:31:50,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-01-16 18:31:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-01-16 18:31:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 214. [2020-01-16 18:31:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 18:31:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 645 transitions. [2020-01-16 18:31:50,307 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 645 transitions. Word has length 19 [2020-01-16 18:31:50,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:50,307 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 645 transitions. [2020-01-16 18:31:50,307 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:50,308 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 645 transitions. [2020-01-16 18:31:50,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:50,308 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:50,308 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:50,308 INFO L426 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-01-16 18:31:50,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:50,308 INFO L82 PathProgramCache]: Analyzing trace with hash -392904248, now seen corresponding path program 197 times [2020-01-16 18:31:50,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:50,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977371489] [2020-01-16 18:31:50,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:50,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977371489] [2020-01-16 18:31:50,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:50,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:50,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258032153] [2020-01-16 18:31:50,607 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:50,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:50,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:50,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:50,608 INFO L87 Difference]: Start difference. First operand 214 states and 645 transitions. Second operand 8 states. [2020-01-16 18:31:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:50,683 INFO L93 Difference]: Finished difference Result 346 states and 902 transitions. [2020-01-16 18:31:50,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:50,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:50,684 INFO L225 Difference]: With dead ends: 346 [2020-01-16 18:31:50,684 INFO L226 Difference]: Without dead ends: 336 [2020-01-16 18:31:50,684 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-01-16 18:31:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-01-16 18:31:50,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 216. [2020-01-16 18:31:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 18:31:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 648 transitions. [2020-01-16 18:31:50,689 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 648 transitions. Word has length 19 [2020-01-16 18:31:50,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:50,689 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 648 transitions. [2020-01-16 18:31:50,689 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:50,689 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 648 transitions. [2020-01-16 18:31:50,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:50,689 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:50,690 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:50,694 INFO L426 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-01-16 18:31:50,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:50,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1248210902, now seen corresponding path program 198 times [2020-01-16 18:31:50,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:50,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380929494] [2020-01-16 18:31:50,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:50,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380929494] [2020-01-16 18:31:50,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:50,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:50,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521804000] [2020-01-16 18:31:50,890 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:50,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:50,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:50,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:50,891 INFO L87 Difference]: Start difference. First operand 216 states and 648 transitions. Second operand 8 states. [2020-01-16 18:31:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:50,980 INFO L93 Difference]: Finished difference Result 348 states and 905 transitions. [2020-01-16 18:31:50,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:50,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:50,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:50,981 INFO L225 Difference]: With dead ends: 348 [2020-01-16 18:31:50,982 INFO L226 Difference]: Without dead ends: 331 [2020-01-16 18:31:50,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-01-16 18:31:50,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-01-16 18:31:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 211. [2020-01-16 18:31:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-01-16 18:31:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 638 transitions. [2020-01-16 18:31:50,987 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 638 transitions. Word has length 19 [2020-01-16 18:31:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:50,987 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 638 transitions. [2020-01-16 18:31:50,987 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 638 transitions. [2020-01-16 18:31:50,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:50,988 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:50,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-01-16 18:31:50,988 INFO L426 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-01-16 18:31:50,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:50,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1561821240, now seen corresponding path program 199 times [2020-01-16 18:31:50,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:50,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481920309] [2020-01-16 18:31:50,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:51,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481920309] [2020-01-16 18:31:51,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:51,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:51,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525028585] [2020-01-16 18:31:51,195 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:51,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:51,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:51,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:51,196 INFO L87 Difference]: Start difference. First operand 211 states and 638 transitions. Second operand 8 states. [2020-01-16 18:31:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:51,253 INFO L93 Difference]: Finished difference Result 359 states and 931 transitions. [2020-01-16 18:31:51,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:51,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:51,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:51,254 INFO L225 Difference]: With dead ends: 359 [2020-01-16 18:31:51,254 INFO L226 Difference]: Without dead ends: 343 [2020-01-16 18:31:51,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-01-16 18:31:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-01-16 18:31:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 217. [2020-01-16 18:31:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-01-16 18:31:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 652 transitions. [2020-01-16 18:31:51,260 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 652 transitions. Word has length 19 [2020-01-16 18:31:51,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:51,260 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 652 transitions. [2020-01-16 18:31:51,260 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 652 transitions. [2020-01-16 18:31:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:51,260 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:51,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-01-16 18:31:51,261 INFO L426 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-01-16 18:31:51,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:51,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1302763014, now seen corresponding path program 200 times [2020-01-16 18:31:51,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:51,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192640095] [2020-01-16 18:31:51,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:51,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192640095] [2020-01-16 18:31:51,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:51,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:51,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290475150] [2020-01-16 18:31:51,456 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:51,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:51,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:51,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:51,456 INFO L87 Difference]: Start difference. First operand 217 states and 652 transitions. Second operand 8 states. [2020-01-16 18:31:51,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:51,515 INFO L93 Difference]: Finished difference Result 353 states and 916 transitions. [2020-01-16 18:31:51,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:51,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:51,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:51,516 INFO L225 Difference]: With dead ends: 353 [2020-01-16 18:31:51,516 INFO L226 Difference]: Without dead ends: 340 [2020-01-16 18:31:51,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-01-16 18:31:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-01-16 18:31:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 214. [2020-01-16 18:31:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 18:31:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 645 transitions. [2020-01-16 18:31:51,522 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 645 transitions. Word has length 19 [2020-01-16 18:31:51,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:51,522 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 645 transitions. [2020-01-16 18:31:51,522 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 645 transitions. [2020-01-16 18:31:51,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:51,522 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31: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-01-16 18:31:51,523 INFO L426 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-01-16 18:31:51,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:51,523 INFO L82 PathProgramCache]: Analyzing trace with hash -467729652, now seen corresponding path program 201 times [2020-01-16 18:31:51,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:51,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864146705] [2020-01-16 18:31:51,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:51,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-01-16 18:31:51,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864146705] [2020-01-16 18:31:51,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:51,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:51,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30703594] [2020-01-16 18:31:51,717 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:51,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:51,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:51,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:51,718 INFO L87 Difference]: Start difference. First operand 214 states and 645 transitions. Second operand 8 states. [2020-01-16 18:31:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:51,782 INFO L93 Difference]: Finished difference Result 365 states and 945 transitions. [2020-01-16 18:31:51,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:51,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:51,783 INFO L225 Difference]: With dead ends: 365 [2020-01-16 18:31:51,783 INFO L226 Difference]: Without dead ends: 349 [2020-01-16 18:31:51,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-01-16 18:31:51,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-01-16 18:31:51,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 220. [2020-01-16 18:31:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-01-16 18:31:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 656 transitions. [2020-01-16 18:31:51,788 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 656 transitions. Word has length 19 [2020-01-16 18:31:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:51,788 INFO L478 AbstractCegarLoop]: Abstraction has 220 states and 656 transitions. [2020-01-16 18:31:51,788 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 656 transitions. [2020-01-16 18:31:51,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:51,789 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:51,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-01-16 18:31:51,789 INFO L426 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-01-16 18:31:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:51,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1443934402, now seen corresponding path program 202 times [2020-01-16 18:31:51,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:51,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353940251] [2020-01-16 18:31:51,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:52,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-01-16 18:31:52,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353940251] [2020-01-16 18:31:52,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:52,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:52,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140698017] [2020-01-16 18:31:52,001 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:52,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:52,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:52,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:52,002 INFO L87 Difference]: Start difference. First operand 220 states and 656 transitions. Second operand 8 states. [2020-01-16 18:31:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:52,091 INFO L93 Difference]: Finished difference Result 362 states and 934 transitions. [2020-01-16 18:31:52,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:52,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:52,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:52,093 INFO L225 Difference]: With dead ends: 362 [2020-01-16 18:31:52,093 INFO L226 Difference]: Without dead ends: 343 [2020-01-16 18:31:52,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-01-16 18:31:52,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-01-16 18:31:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 214. [2020-01-16 18:31:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 18:31:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-01-16 18:31:52,098 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-01-16 18:31:52,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:52,099 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-01-16 18:31:52,099 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:52,099 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-01-16 18:31:52,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:52,099 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:52,099 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:52,099 INFO L426 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-01-16 18:31:52,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:52,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1543632934, now seen corresponding path program 203 times [2020-01-16 18:31:52,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:52,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914988728] [2020-01-16 18:31:52,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:52,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:52,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914988728] [2020-01-16 18:31:52,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:52,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:52,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870758084] [2020-01-16 18:31:52,296 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:52,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:52,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:52,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:52,297 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-01-16 18:31:52,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:52,368 INFO L93 Difference]: Finished difference Result 349 states and 906 transitions. [2020-01-16 18:31:52,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:52,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:52,370 INFO L225 Difference]: With dead ends: 349 [2020-01-16 18:31:52,370 INFO L226 Difference]: Without dead ends: 339 [2020-01-16 18:31:52,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:52,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-01-16 18:31:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 216. [2020-01-16 18:31:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 18:31:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 645 transitions. [2020-01-16 18:31:52,375 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 645 transitions. Word has length 19 [2020-01-16 18:31:52,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:52,375 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 645 transitions. [2020-01-16 18:31:52,375 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 645 transitions. [2020-01-16 18:31:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:52,376 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:52,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-01-16 18:31:52,376 INFO L426 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-01-16 18:31:52,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:52,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1261929366, now seen corresponding path program 204 times [2020-01-16 18:31:52,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:52,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154728144] [2020-01-16 18:31:52,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:52,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-01-16 18:31:52,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154728144] [2020-01-16 18:31:52,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:52,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:52,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224368471] [2020-01-16 18:31:52,566 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:52,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:52,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:52,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:52,567 INFO L87 Difference]: Start difference. First operand 216 states and 645 transitions. Second operand 8 states. [2020-01-16 18:31:52,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:52,647 INFO L93 Difference]: Finished difference Result 352 states and 911 transitions. [2020-01-16 18:31:52,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:52,648 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:52,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:52,649 INFO L225 Difference]: With dead ends: 352 [2020-01-16 18:31:52,649 INFO L226 Difference]: Without dead ends: 334 [2020-01-16 18:31:52,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-01-16 18:31:52,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 211. [2020-01-16 18:31:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-01-16 18:31:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 635 transitions. [2020-01-16 18:31:52,654 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 635 transitions. Word has length 19 [2020-01-16 18:31:52,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:52,654 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 635 transitions. [2020-01-16 18:31:52,655 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 635 transitions. [2020-01-16 18:31:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:52,655 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:52,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:52,655 INFO L426 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-01-16 18:31:52,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:52,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1236225016, now seen corresponding path program 205 times [2020-01-16 18:31:52,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:52,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485971209] [2020-01-16 18:31:52,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:52,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485971209] [2020-01-16 18:31:52,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:52,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:52,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261530644] [2020-01-16 18:31:52,858 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:52,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:52,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:52,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:52,858 INFO L87 Difference]: Start difference. First operand 211 states and 635 transitions. Second operand 8 states. [2020-01-16 18:31:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:52,917 INFO L93 Difference]: Finished difference Result 366 states and 949 transitions. [2020-01-16 18:31:52,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:52,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:52,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:52,918 INFO L225 Difference]: With dead ends: 366 [2020-01-16 18:31:52,918 INFO L226 Difference]: Without dead ends: 350 [2020-01-16 18:31:52,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-01-16 18:31:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 221. [2020-01-16 18:31:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-01-16 18:31:52,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 663 transitions. [2020-01-16 18:31:52,924 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 663 transitions. Word has length 19 [2020-01-16 18:31:52,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:52,924 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 663 transitions. [2020-01-16 18:31:52,924 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 663 transitions. [2020-01-16 18:31:52,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:52,925 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:52,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-01-16 18:31:52,925 INFO L426 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-01-16 18:31:52,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:52,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1987287110, now seen corresponding path program 206 times [2020-01-16 18:31:52,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:52,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075648591] [2020-01-16 18:31:52,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:53,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075648591] [2020-01-16 18:31:53,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:53,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:53,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220384682] [2020-01-16 18:31:53,125 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:53,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:53,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:53,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:53,126 INFO L87 Difference]: Start difference. First operand 221 states and 663 transitions. Second operand 8 states. [2020-01-16 18:31:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:53,204 INFO L93 Difference]: Finished difference Result 362 states and 937 transitions. [2020-01-16 18:31:53,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:53,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:53,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:53,206 INFO L225 Difference]: With dead ends: 362 [2020-01-16 18:31:53,206 INFO L226 Difference]: Without dead ends: 345 [2020-01-16 18:31:53,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-01-16 18:31:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2020-01-16 18:31:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 216. [2020-01-16 18:31:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 18:31:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 649 transitions. [2020-01-16 18:31:53,211 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 649 transitions. Word has length 19 [2020-01-16 18:31:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:53,212 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 649 transitions. [2020-01-16 18:31:53,212 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 649 transitions. [2020-01-16 18:31:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:53,212 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:53,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:53,212 INFO L426 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-01-16 18:31:53,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:53,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1458304426, now seen corresponding path program 207 times [2020-01-16 18:31:53,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:53,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4433164] [2020-01-16 18:31:53,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:53,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4433164] [2020-01-16 18:31:53,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:53,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:53,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732398873] [2020-01-16 18:31:53,440 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:53,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:53,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:53,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:53,441 INFO L87 Difference]: Start difference. First operand 216 states and 649 transitions. Second operand 8 states. [2020-01-16 18:31:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:53,505 INFO L93 Difference]: Finished difference Result 368 states and 949 transitions. [2020-01-16 18:31:53,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:53,505 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:53,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:53,506 INFO L225 Difference]: With dead ends: 368 [2020-01-16 18:31:53,506 INFO L226 Difference]: Without dead ends: 352 [2020-01-16 18:31:53,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-01-16 18:31:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2020-01-16 18:31:53,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 222. [2020-01-16 18:31:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-01-16 18:31:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 660 transitions. [2020-01-16 18:31:53,512 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 660 transitions. Word has length 19 [2020-01-16 18:31:53,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:53,512 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 660 transitions. [2020-01-16 18:31:53,512 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:53,512 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 660 transitions. [2020-01-16 18:31:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:53,512 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:53,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-01-16 18:31:53,512 INFO L426 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-01-16 18:31:53,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:53,513 INFO L82 PathProgramCache]: Analyzing trace with hash 482099676, now seen corresponding path program 208 times [2020-01-16 18:31:53,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:53,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355751636] [2020-01-16 18:31:53,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:53,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355751636] [2020-01-16 18:31:53,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:53,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:53,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018896621] [2020-01-16 18:31:53,720 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:53,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:53,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:53,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:53,721 INFO L87 Difference]: Start difference. First operand 222 states and 660 transitions. Second operand 8 states. [2020-01-16 18:31:53,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:53,805 INFO L93 Difference]: Finished difference Result 365 states and 938 transitions. [2020-01-16 18:31:53,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:53,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:53,806 INFO L225 Difference]: With dead ends: 365 [2020-01-16 18:31:53,806 INFO L226 Difference]: Without dead ends: 346 [2020-01-16 18:31:53,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-01-16 18:31:53,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-01-16 18:31:53,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 216. [2020-01-16 18:31:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 18:31:53,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 644 transitions. [2020-01-16 18:31:53,811 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 644 transitions. Word has length 19 [2020-01-16 18:31:53,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:53,811 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 644 transitions. [2020-01-16 18:31:53,811 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:53,811 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 644 transitions. [2020-01-16 18:31:53,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:53,812 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:53,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-01-16 18:31:53,812 INFO L426 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-01-16 18:31:53,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:53,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2110104008, now seen corresponding path program 209 times [2020-01-16 18:31:53,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:53,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50357794] [2020-01-16 18:31:53,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:54,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-01-16 18:31:54,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50357794] [2020-01-16 18:31:54,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:54,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:54,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090129921] [2020-01-16 18:31:54,008 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:54,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:54,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:54,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:54,008 INFO L87 Difference]: Start difference. First operand 216 states and 644 transitions. Second operand 8 states. [2020-01-16 18:31:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:54,085 INFO L93 Difference]: Finished difference Result 358 states and 925 transitions. [2020-01-16 18:31:54,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:54,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:54,087 INFO L225 Difference]: With dead ends: 358 [2020-01-16 18:31:54,087 INFO L226 Difference]: Without dead ends: 346 [2020-01-16 18:31:54,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-01-16 18:31:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-01-16 18:31:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 220. [2020-01-16 18:31:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-01-16 18:31:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 652 transitions. [2020-01-16 18:31:54,092 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 652 transitions. Word has length 19 [2020-01-16 18:31:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:54,092 INFO L478 AbstractCegarLoop]: Abstraction has 220 states and 652 transitions. [2020-01-16 18:31:54,092 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 652 transitions. [2020-01-16 18:31:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:54,092 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:54,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-01-16 18:31:54,093 INFO L426 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-01-16 18:31:54,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:54,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1325988758, now seen corresponding path program 210 times [2020-01-16 18:31:54,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:54,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534693454] [2020-01-16 18:31:54,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:54,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534693454] [2020-01-16 18:31:54,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:54,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:54,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496633598] [2020-01-16 18:31:54,292 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:54,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:54,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:54,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:54,292 INFO L87 Difference]: Start difference. First operand 220 states and 652 transitions. Second operand 8 states. [2020-01-16 18:31:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:54,374 INFO L93 Difference]: Finished difference Result 359 states and 923 transitions. [2020-01-16 18:31:54,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:54,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:54,375 INFO L225 Difference]: With dead ends: 359 [2020-01-16 18:31:54,375 INFO L226 Difference]: Without dead ends: 337 [2020-01-16 18:31:54,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-01-16 18:31:54,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-01-16 18:31:54,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 211. [2020-01-16 18:31:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-01-16 18:31:54,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 632 transitions. [2020-01-16 18:31:54,381 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 632 transitions. Word has length 19 [2020-01-16 18:31:54,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:54,381 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 632 transitions. [2020-01-16 18:31:54,381 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:54,382 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 632 transitions. [2020-01-16 18:31:54,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:54,382 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:54,382 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:54,382 INFO L426 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-01-16 18:31:54,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:54,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1946024220, now seen corresponding path program 211 times [2020-01-16 18:31:54,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:54,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889850304] [2020-01-16 18:31:54,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:54,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889850304] [2020-01-16 18:31:54,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:54,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:54,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858214160] [2020-01-16 18:31:54,588 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:54,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:54,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:54,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:54,588 INFO L87 Difference]: Start difference. First operand 211 states and 632 transitions. Second operand 8 states. [2020-01-16 18:31:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:54,648 INFO L93 Difference]: Finished difference Result 335 states and 868 transitions. [2020-01-16 18:31:54,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:54,648 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:54,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:54,649 INFO L225 Difference]: With dead ends: 335 [2020-01-16 18:31:54,649 INFO L226 Difference]: Without dead ends: 325 [2020-01-16 18:31:54,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-01-16 18:31:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-01-16 18:31:54,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 215. [2020-01-16 18:31:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-01-16 18:31:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 642 transitions. [2020-01-16 18:31:54,655 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 642 transitions. Word has length 19 [2020-01-16 18:31:54,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:54,655 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 642 transitions. [2020-01-16 18:31:54,655 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 642 transitions. [2020-01-16 18:31:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:54,656 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:54,656 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:54,656 INFO L426 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-01-16 18:31:54,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:54,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1090717566, now seen corresponding path program 212 times [2020-01-16 18:31:54,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:54,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358713505] [2020-01-16 18:31:54,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:54,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358713505] [2020-01-16 18:31:54,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:54,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:54,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344467536] [2020-01-16 18:31:54,866 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:54,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:54,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:54,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:54,866 INFO L87 Difference]: Start difference. First operand 215 states and 642 transitions. Second operand 8 states. [2020-01-16 18:31:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:54,960 INFO L93 Difference]: Finished difference Result 337 states and 871 transitions. [2020-01-16 18:31:54,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:54,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:54,962 INFO L225 Difference]: With dead ends: 337 [2020-01-16 18:31:54,962 INFO L226 Difference]: Without dead ends: 323 [2020-01-16 18:31:54,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-01-16 18:31:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 213. [2020-01-16 18:31:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-01-16 18:31:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 637 transitions. [2020-01-16 18:31:54,967 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 637 transitions. Word has length 19 [2020-01-16 18:31:54,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:54,967 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 637 transitions. [2020-01-16 18:31:54,967 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:54,967 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 637 transitions. [2020-01-16 18:31:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:54,968 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:54,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:54,968 INFO L426 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-01-16 18:31:54,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:54,968 INFO L82 PathProgramCache]: Analyzing trace with hash -738002118, now seen corresponding path program 213 times [2020-01-16 18:31:54,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:54,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888004912] [2020-01-16 18:31:54,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31: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-01-16 18:31:55,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888004912] [2020-01-16 18:31:55,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:55,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:55,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211640438] [2020-01-16 18:31:55,253 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:55,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:55,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:55,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:55,254 INFO L87 Difference]: Start difference. First operand 213 states and 637 transitions. Second operand 8 states. [2020-01-16 18:31:55,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:55,335 INFO L93 Difference]: Finished difference Result 336 states and 868 transitions. [2020-01-16 18:31:55,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:55,336 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:55,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:55,337 INFO L225 Difference]: With dead ends: 336 [2020-01-16 18:31:55,338 INFO L226 Difference]: Without dead ends: 326 [2020-01-16 18:31:55,338 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:55,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-01-16 18:31:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 215. [2020-01-16 18:31:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-01-16 18:31:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 640 transitions. [2020-01-16 18:31:55,347 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 640 transitions. Word has length 19 [2020-01-16 18:31:55,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:55,347 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 640 transitions. [2020-01-16 18:31:55,347 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 640 transitions. [2020-01-16 18:31:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:55,348 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:55,348 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:55,349 INFO L426 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-01-16 18:31:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:55,349 INFO L82 PathProgramCache]: Analyzing trace with hash 751402878, now seen corresponding path program 214 times [2020-01-16 18:31:55,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:55,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539001930] [2020-01-16 18:31:55,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:55,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:55,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539001930] [2020-01-16 18:31:55,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:55,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:55,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722029729] [2020-01-16 18:31:55,639 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:55,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:55,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:55,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:55,639 INFO L87 Difference]: Start difference. First operand 215 states and 640 transitions. Second operand 8 states. [2020-01-16 18:31:55,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:55,762 INFO L93 Difference]: Finished difference Result 339 states and 873 transitions. [2020-01-16 18:31:55,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:55,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:55,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:55,764 INFO L225 Difference]: With dead ends: 339 [2020-01-16 18:31:55,764 INFO L226 Difference]: Without dead ends: 324 [2020-01-16 18:31:55,765 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-01-16 18:31:55,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-01-16 18:31:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 213. [2020-01-16 18:31:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-01-16 18:31:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 635 transitions. [2020-01-16 18:31:55,772 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 635 transitions. Word has length 19 [2020-01-16 18:31:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:55,772 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 635 transitions. [2020-01-16 18:31:55,772 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 635 transitions. [2020-01-16 18:31:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:55,773 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:55,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-01-16 18:31:55,773 INFO L426 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-01-16 18:31:55,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:55,774 INFO L82 PathProgramCache]: Analyzing trace with hash 17632186, now seen corresponding path program 215 times [2020-01-16 18:31:55,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:55,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959096830] [2020-01-16 18:31:55,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:56,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959096830] [2020-01-16 18:31:56,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:56,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:56,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953785967] [2020-01-16 18:31:56,055 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:56,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:56,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:56,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:56,055 INFO L87 Difference]: Start difference. First operand 213 states and 635 transitions. Second operand 8 states. [2020-01-16 18:31:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:56,138 INFO L93 Difference]: Finished difference Result 338 states and 871 transitions. [2020-01-16 18:31:56,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:56,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:56,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:56,139 INFO L225 Difference]: With dead ends: 338 [2020-01-16 18:31:56,139 INFO L226 Difference]: Without dead ends: 326 [2020-01-16 18:31:56,139 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-01-16 18:31:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-01-16 18:31:56,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 217. [2020-01-16 18:31:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-01-16 18:31:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 643 transitions. [2020-01-16 18:31:56,145 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 643 transitions. Word has length 19 [2020-01-16 18:31:56,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:56,145 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 643 transitions. [2020-01-16 18:31:56,145 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 643 transitions. [2020-01-16 18:31:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:56,146 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:56,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-01-16 18:31:56,146 INFO L426 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-01-16 18:31:56,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:56,146 INFO L82 PathProgramCache]: Analyzing trace with hash -738002118, now seen corresponding path program 216 times [2020-01-16 18:31:56,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:56,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887761740] [2020-01-16 18:31:56,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:56,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887761740] [2020-01-16 18:31:56,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:56,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:56,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572275270] [2020-01-16 18:31:56,346 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:56,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:56,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:56,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:56,346 INFO L87 Difference]: Start difference. First operand 217 states and 643 transitions. Second operand 8 states. [2020-01-16 18:31:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:56,429 INFO L93 Difference]: Finished difference Result 339 states and 869 transitions. [2020-01-16 18:31:56,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:56,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:56,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:56,430 INFO L225 Difference]: With dead ends: 339 [2020-01-16 18:31:56,431 INFO L226 Difference]: Without dead ends: 317 [2020-01-16 18:31:56,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-01-16 18:31:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 208. [2020-01-16 18:31:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-01-16 18:31:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 625 transitions. [2020-01-16 18:31:56,436 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 625 transitions. Word has length 19 [2020-01-16 18:31:56,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:56,436 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 625 transitions. [2020-01-16 18:31:56,436 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:56,436 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 625 transitions. [2020-01-16 18:31:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:56,437 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:56,437 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:56,437 INFO L426 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-01-16 18:31:56,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:56,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1434799680, now seen corresponding path program 217 times [2020-01-16 18:31:56,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:56,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900251832] [2020-01-16 18:31:56,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:56,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900251832] [2020-01-16 18:31:56,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:56,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:56,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219319587] [2020-01-16 18:31:56,610 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:56,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:56,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:56,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:56,611 INFO L87 Difference]: Start difference. First operand 208 states and 625 transitions. Second operand 8 states. [2020-01-16 18:31:56,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:56,687 INFO L93 Difference]: Finished difference Result 338 states and 886 transitions. [2020-01-16 18:31:56,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:56,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:56,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:56,688 INFO L225 Difference]: With dead ends: 338 [2020-01-16 18:31:56,688 INFO L226 Difference]: Without dead ends: 324 [2020-01-16 18:31:56,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-01-16 18:31:56,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-01-16 18:31:56,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 214. [2020-01-16 18:31:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 18:31:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 644 transitions. [2020-01-16 18:31:56,693 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 644 transitions. Word has length 19 [2020-01-16 18:31:56,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:56,694 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 644 transitions. [2020-01-16 18:31:56,694 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 644 transitions. [2020-01-16 18:31:56,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:56,694 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:56,694 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:56,694 INFO L426 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-01-16 18:31:56,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:56,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1740037786, now seen corresponding path program 218 times [2020-01-16 18:31:56,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:56,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237186177] [2020-01-16 18:31:56,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:56,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-01-16 18:31:56,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237186177] [2020-01-16 18:31:56,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:56,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:56,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046542653] [2020-01-16 18:31:56,878 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:56,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:56,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:56,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:56,878 INFO L87 Difference]: Start difference. First operand 214 states and 644 transitions. Second operand 8 states. [2020-01-16 18:31:56,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:56,936 INFO L93 Difference]: Finished difference Result 334 states and 875 transitions. [2020-01-16 18:31:56,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:56,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:56,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:56,938 INFO L225 Difference]: With dead ends: 334 [2020-01-16 18:31:56,938 INFO L226 Difference]: Without dead ends: 322 [2020-01-16 18:31:56,938 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-01-16 18:31:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-01-16 18:31:56,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 212. [2020-01-16 18:31:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 18:31:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 639 transitions. [2020-01-16 18:31:56,943 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 639 transitions. Word has length 19 [2020-01-16 18:31:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:56,943 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 639 transitions. [2020-01-16 18:31:56,943 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 639 transitions. [2020-01-16 18:31:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:56,944 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:56,944 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:56,944 INFO L426 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-01-16 18:31:56,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:56,944 INFO L82 PathProgramCache]: Analyzing trace with hash 690097182, now seen corresponding path program 219 times [2020-01-16 18:31:56,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:56,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868277455] [2020-01-16 18:31:56,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:57,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868277455] [2020-01-16 18:31:57,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:57,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:57,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449527921] [2020-01-16 18:31:57,147 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:57,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:57,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:57,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:57,148 INFO L87 Difference]: Start difference. First operand 212 states and 639 transitions. Second operand 8 states. [2020-01-16 18:31:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:57,221 INFO L93 Difference]: Finished difference Result 342 states and 896 transitions. [2020-01-16 18:31:57,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:57,221 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:57,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:57,221 INFO L225 Difference]: With dead ends: 342 [2020-01-16 18:31:57,222 INFO L226 Difference]: Without dead ends: 328 [2020-01-16 18:31:57,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:57,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-01-16 18:31:57,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 216. [2020-01-16 18:31:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 18:31:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 647 transitions. [2020-01-16 18:31:57,226 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 647 transitions. Word has length 19 [2020-01-16 18:31:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:57,227 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 647 transitions. [2020-01-16 18:31:57,227 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 647 transitions. [2020-01-16 18:31:57,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:57,227 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:57,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-01-16 18:31:57,227 INFO L426 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-01-16 18:31:57,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:57,228 INFO L82 PathProgramCache]: Analyzing trace with hash -55199962, now seen corresponding path program 220 times [2020-01-16 18:31:57,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:57,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408851802] [2020-01-16 18:31:57,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:57,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408851802] [2020-01-16 18:31:57,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:57,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:57,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464658631] [2020-01-16 18:31:57,405 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:57,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:57,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:57,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:57,405 INFO L87 Difference]: Start difference. First operand 216 states and 647 transitions. Second operand 8 states. [2020-01-16 18:31:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:57,486 INFO L93 Difference]: Finished difference Result 340 states and 888 transitions. [2020-01-16 18:31:57,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:57,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:57,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:57,487 INFO L225 Difference]: With dead ends: 340 [2020-01-16 18:31:57,487 INFO L226 Difference]: Without dead ends: 324 [2020-01-16 18:31:57,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-01-16 18:31:57,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-01-16 18:31:57,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 212. [2020-01-16 18:31:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 18:31:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 637 transitions. [2020-01-16 18:31:57,492 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 637 transitions. Word has length 19 [2020-01-16 18:31:57,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:57,492 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 637 transitions. [2020-01-16 18:31:57,492 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:57,492 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 637 transitions. [2020-01-16 18:31:57,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:57,493 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:57,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-01-16 18:31:57,493 INFO L426 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-01-16 18:31:57,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:57,493 INFO L82 PathProgramCache]: Analyzing trace with hash 2019699708, now seen corresponding path program 221 times [2020-01-16 18:31:57,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:57,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774572522] [2020-01-16 18:31:57,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:57,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774572522] [2020-01-16 18:31:57,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:57,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:57,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119028821] [2020-01-16 18:31:57,678 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:57,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:57,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:57,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:57,679 INFO L87 Difference]: Start difference. First operand 212 states and 637 transitions. Second operand 8 states. [2020-01-16 18:31:57,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:57,739 INFO L93 Difference]: Finished difference Result 332 states and 869 transitions. [2020-01-16 18:31:57,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:57,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:57,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:57,740 INFO L225 Difference]: With dead ends: 332 [2020-01-16 18:31:57,741 INFO L226 Difference]: Without dead ends: 322 [2020-01-16 18:31:57,741 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-01-16 18:31:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-01-16 18:31:57,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 214. [2020-01-16 18:31:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 18:31:57,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 640 transitions. [2020-01-16 18:31:57,746 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 640 transitions. Word has length 19 [2020-01-16 18:31:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:57,746 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 640 transitions. [2020-01-16 18:31:57,746 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 640 transitions. [2020-01-16 18:31:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:57,747 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:57,747 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:57,747 INFO L426 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-01-16 18:31:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:57,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1164393054, now seen corresponding path program 222 times [2020-01-16 18:31:57,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:57,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534407157] [2020-01-16 18:31:57,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:57,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-01-16 18:31:57,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534407157] [2020-01-16 18:31:57,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:57,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:57,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689160769] [2020-01-16 18:31:57,930 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:57,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:57,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:57,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:57,930 INFO L87 Difference]: Start difference. First operand 214 states and 640 transitions. Second operand 8 states. [2020-01-16 18:31:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:58,013 INFO L93 Difference]: Finished difference Result 334 states and 872 transitions. [2020-01-16 18:31:58,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:58,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:58,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:58,015 INFO L225 Difference]: With dead ends: 334 [2020-01-16 18:31:58,015 INFO L226 Difference]: Without dead ends: 318 [2020-01-16 18:31:58,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-01-16 18:31:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-01-16 18:31:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 210. [2020-01-16 18:31:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-01-16 18:31:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 632 transitions. [2020-01-16 18:31:58,021 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 632 transitions. Word has length 19 [2020-01-16 18:31:58,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:58,021 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 632 transitions. [2020-01-16 18:31:58,021 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 632 transitions. [2020-01-16 18:31:58,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:58,021 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:58,021 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:58,021 INFO L426 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-01-16 18:31:58,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:58,022 INFO L82 PathProgramCache]: Analyzing trace with hash -165638174, now seen corresponding path program 223 times [2020-01-16 18:31:58,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:58,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356416902] [2020-01-16 18:31:58,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:58,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356416902] [2020-01-16 18:31:58,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:58,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:58,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234507730] [2020-01-16 18:31:58,200 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:58,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:58,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:58,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:58,200 INFO L87 Difference]: Start difference. First operand 210 states and 632 transitions. Second operand 8 states. [2020-01-16 18:31:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:58,273 INFO L93 Difference]: Finished difference Result 340 states and 889 transitions. [2020-01-16 18:31:58,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:58,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:58,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:58,275 INFO L225 Difference]: With dead ends: 340 [2020-01-16 18:31:58,275 INFO L226 Difference]: Without dead ends: 326 [2020-01-16 18:31:58,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-01-16 18:31:58,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-01-16 18:31:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 214. [2020-01-16 18:31:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 18:31:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-01-16 18:31:58,280 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-01-16 18:31:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:58,280 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-01-16 18:31:58,281 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-01-16 18:31:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:58,281 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:58,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-01-16 18:31:58,281 INFO L426 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-01-16 18:31:58,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:58,281 INFO L82 PathProgramCache]: Analyzing trace with hash 954491656, now seen corresponding path program 224 times [2020-01-16 18:31:58,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:58,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842252663] [2020-01-16 18:31:58,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:58,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842252663] [2020-01-16 18:31:58,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:58,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:58,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812843467] [2020-01-16 18:31:58,473 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:58,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:58,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:58,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:58,474 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-01-16 18:31:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:58,542 INFO L93 Difference]: Finished difference Result 336 states and 878 transitions. [2020-01-16 18:31:58,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:58,543 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:58,544 INFO L225 Difference]: With dead ends: 336 [2020-01-16 18:31:58,544 INFO L226 Difference]: Without dead ends: 324 [2020-01-16 18:31:58,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-01-16 18:31:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-01-16 18:31:58,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 212. [2020-01-16 18:31:58,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 18:31:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 637 transitions. [2020-01-16 18:31:58,551 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 637 transitions. Word has length 19 [2020-01-16 18:31:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:58,551 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 637 transitions. [2020-01-16 18:31:58,551 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 637 transitions. [2020-01-16 18:31:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:58,552 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:58,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-01-16 18:31:58,552 INFO L426 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-01-16 18:31:58,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1238723554, now seen corresponding path program 225 times [2020-01-16 18:31:58,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:58,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343817226] [2020-01-16 18:31:58,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:58,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343817226] [2020-01-16 18:31:58,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:58,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:58,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309794535] [2020-01-16 18:31:58,769 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:58,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:58,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:58,769 INFO L87 Difference]: Start difference. First operand 212 states and 637 transitions. Second operand 8 states. [2020-01-16 18:31:58,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:58,842 INFO L93 Difference]: Finished difference Result 346 states and 904 transitions. [2020-01-16 18:31:58,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:58,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:58,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:58,844 INFO L225 Difference]: With dead ends: 346 [2020-01-16 18:31:58,844 INFO L226 Difference]: Without dead ends: 332 [2020-01-16 18:31:58,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-01-16 18:31:58,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-01-16 18:31:58,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 217. [2020-01-16 18:31:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-01-16 18:31:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 647 transitions. [2020-01-16 18:31:58,850 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 647 transitions. Word has length 19 [2020-01-16 18:31:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:58,850 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 647 transitions. [2020-01-16 18:31:58,850 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:58,850 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 647 transitions. [2020-01-16 18:31:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:58,851 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:58,851 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:58,851 INFO L426 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-01-16 18:31:58,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:58,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1880780472, now seen corresponding path program 226 times [2020-01-16 18:31:58,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:58,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325039797] [2020-01-16 18:31:58,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:59,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325039797] [2020-01-16 18:31:59,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:59,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:59,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000822441] [2020-01-16 18:31:59,043 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:59,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:59,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:59,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:59,044 INFO L87 Difference]: Start difference. First operand 217 states and 647 transitions. Second operand 8 states. [2020-01-16 18:31:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:59,129 INFO L93 Difference]: Finished difference Result 345 states and 897 transitions. [2020-01-16 18:31:59,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:59,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:59,130 INFO L225 Difference]: With dead ends: 345 [2020-01-16 18:31:59,130 INFO L226 Difference]: Without dead ends: 327 [2020-01-16 18:31:59,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-01-16 18:31:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 212. [2020-01-16 18:31:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 18:31:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 635 transitions. [2020-01-16 18:31:59,136 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 635 transitions. Word has length 19 [2020-01-16 18:31:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:59,136 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 635 transitions. [2020-01-16 18:31:59,136 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 635 transitions. [2020-01-16 18:31:59,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:59,136 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:59,136 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:59,137 INFO L426 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-01-16 18:31:59,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:59,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2030202812, now seen corresponding path program 227 times [2020-01-16 18:31:59,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:59,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220572443] [2020-01-16 18:31:59,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:59,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:59,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220572443] [2020-01-16 18:31:59,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:59,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:59,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872576337] [2020-01-16 18:31:59,393 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:59,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:59,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:59,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:59,393 INFO L87 Difference]: Start difference. First operand 212 states and 635 transitions. Second operand 8 states. [2020-01-16 18:31:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:59,468 INFO L93 Difference]: Finished difference Result 335 states and 874 transitions. [2020-01-16 18:31:59,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:59,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:59,469 INFO L225 Difference]: With dead ends: 335 [2020-01-16 18:31:59,469 INFO L226 Difference]: Without dead ends: 325 [2020-01-16 18:31:59,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-01-16 18:31:59,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-01-16 18:31:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 214. [2020-01-16 18:31:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 18:31:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 638 transitions. [2020-01-16 18:31:59,478 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 638 transitions. Word has length 19 [2020-01-16 18:31:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:59,479 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 638 transitions. [2020-01-16 18:31:59,479 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 638 transitions. [2020-01-16 18:31:59,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:59,480 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:59,480 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:59,480 INFO L426 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-01-16 18:31:59,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:59,480 INFO L82 PathProgramCache]: Analyzing trace with hash -775359488, now seen corresponding path program 228 times [2020-01-16 18:31:59,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:59,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950298577] [2020-01-16 18:31:59,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:31:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:31:59,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950298577] [2020-01-16 18:31:59,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:31:59,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:31:59,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709452187] [2020-01-16 18:31:59,729 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:31:59,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:31:59,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:31:59,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:31:59,730 INFO L87 Difference]: Start difference. First operand 214 states and 638 transitions. Second operand 8 states. [2020-01-16 18:31:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:31:59,823 INFO L93 Difference]: Finished difference Result 338 states and 879 transitions. [2020-01-16 18:31:59,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:31:59,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:31:59,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:31:59,824 INFO L225 Difference]: With dead ends: 338 [2020-01-16 18:31:59,824 INFO L226 Difference]: Without dead ends: 321 [2020-01-16 18:31:59,825 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:31:59,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-01-16 18:31:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 210. [2020-01-16 18:31:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-01-16 18:31:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 630 transitions. [2020-01-16 18:31:59,832 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 630 transitions. Word has length 19 [2020-01-16 18:31:59,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:31:59,832 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 630 transitions. [2020-01-16 18:31:59,832 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:31:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 630 transitions. [2020-01-16 18:31:59,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:31:59,833 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:31:59,833 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:31:59,833 INFO L426 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-01-16 18:31:59,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:31:59,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1784188770, now seen corresponding path program 229 times [2020-01-16 18:31:59,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:31:59,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846583651] [2020-01-16 18:31:59,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:31:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:00,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-01-16 18:32:00,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846583651] [2020-01-16 18:32:00,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:00,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:00,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449423599] [2020-01-16 18:32:00,022 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:00,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:00,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:00,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:00,023 INFO L87 Difference]: Start difference. First operand 210 states and 630 transitions. Second operand 8 states. [2020-01-16 18:32:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:00,094 INFO L93 Difference]: Finished difference Result 348 states and 911 transitions. [2020-01-16 18:32:00,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:00,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:00,095 INFO L225 Difference]: With dead ends: 348 [2020-01-16 18:32:00,095 INFO L226 Difference]: Without dead ends: 334 [2020-01-16 18:32:00,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-01-16 18:32:00,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-01-16 18:32:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 218. [2020-01-16 18:32:00,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 18:32:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 654 transitions. [2020-01-16 18:32:00,102 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 654 transitions. Word has length 19 [2020-01-16 18:32:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:00,102 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 654 transitions. [2020-01-16 18:32:00,102 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 654 transitions. [2020-01-16 18:32:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:00,103 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:00,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-01-16 18:32:00,103 INFO L426 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-01-16 18:32:00,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:00,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1038891626, now seen corresponding path program 230 times [2020-01-16 18:32:00,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:00,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474386139] [2020-01-16 18:32:00,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:00,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474386139] [2020-01-16 18:32:00,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:00,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:00,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200248689] [2020-01-16 18:32:00,292 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:00,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:00,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:00,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:00,293 INFO L87 Difference]: Start difference. First operand 218 states and 654 transitions. Second operand 8 states. [2020-01-16 18:32:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:00,368 INFO L93 Difference]: Finished difference Result 346 states and 903 transitions. [2020-01-16 18:32:00,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:00,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:00,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:00,370 INFO L225 Difference]: With dead ends: 346 [2020-01-16 18:32:00,370 INFO L226 Difference]: Without dead ends: 330 [2020-01-16 18:32:00,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:00,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-01-16 18:32:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 214. [2020-01-16 18:32:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 18:32:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-01-16 18:32:00,375 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-01-16 18:32:00,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:00,375 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-01-16 18:32:00,375 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:00,375 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-01-16 18:32:00,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:00,375 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:00,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-01-16 18:32:00,376 INFO L426 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-01-16 18:32:00,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:00,376 INFO L82 PathProgramCache]: Analyzing trace with hash -165638174, now seen corresponding path program 231 times [2020-01-16 18:32:00,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:00,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122648266] [2020-01-16 18:32:00,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:00,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122648266] [2020-01-16 18:32:00,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:00,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:00,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35758229] [2020-01-16 18:32:00,576 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:00,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:00,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:00,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:00,576 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-01-16 18:32:00,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:00,651 INFO L93 Difference]: Finished difference Result 350 states and 912 transitions. [2020-01-16 18:32:00,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:00,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:00,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:00,652 INFO L225 Difference]: With dead ends: 350 [2020-01-16 18:32:00,652 INFO L226 Difference]: Without dead ends: 336 [2020-01-16 18:32:00,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-01-16 18:32:00,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-01-16 18:32:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 219. [2020-01-16 18:32:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-01-16 18:32:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 652 transitions. [2020-01-16 18:32:00,658 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 652 transitions. Word has length 19 [2020-01-16 18:32:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:00,658 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 652 transitions. [2020-01-16 18:32:00,658 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 652 transitions. [2020-01-16 18:32:00,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:00,659 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:00,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-01-16 18:32:00,659 INFO L426 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-01-16 18:32:00,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:00,659 INFO L82 PathProgramCache]: Analyzing trace with hash 803245866, now seen corresponding path program 232 times [2020-01-16 18:32:00,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:00,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949331423] [2020-01-16 18:32:00,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:00,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-01-16 18:32:00,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949331423] [2020-01-16 18:32:00,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:00,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:00,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389701623] [2020-01-16 18:32:00,856 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:00,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:00,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:00,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:00,856 INFO L87 Difference]: Start difference. First operand 219 states and 652 transitions. Second operand 8 states. [2020-01-16 18:32:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:00,939 INFO L93 Difference]: Finished difference Result 349 states and 905 transitions. [2020-01-16 18:32:00,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:00,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:00,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:00,940 INFO L225 Difference]: With dead ends: 349 [2020-01-16 18:32:00,940 INFO L226 Difference]: Without dead ends: 331 [2020-01-16 18:32:00,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:00,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-01-16 18:32:00,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 214. [2020-01-16 18:32:00,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 18:32:00,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 638 transitions. [2020-01-16 18:32:00,945 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 638 transitions. Word has length 19 [2020-01-16 18:32:00,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:00,946 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 638 transitions. [2020-01-16 18:32:00,946 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:00,946 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 638 transitions. [2020-01-16 18:32:00,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:00,946 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32: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-01-16 18:32:00,946 INFO L426 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-01-16 18:32:00,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:00,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1685003648, now seen corresponding path program 233 times [2020-01-16 18:32:00,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:00,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077207315] [2020-01-16 18:32:00,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:01,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077207315] [2020-01-16 18:32:01,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:01,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:01,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533952845] [2020-01-16 18:32:01,140 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:01,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:01,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:01,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:01,140 INFO L87 Difference]: Start difference. First operand 214 states and 638 transitions. Second operand 8 states. [2020-01-16 18:32:01,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:01,213 INFO L93 Difference]: Finished difference Result 345 states and 897 transitions. [2020-01-16 18:32:01,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:01,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:01,214 INFO L225 Difference]: With dead ends: 345 [2020-01-16 18:32:01,214 INFO L226 Difference]: Without dead ends: 333 [2020-01-16 18:32:01,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:01,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-01-16 18:32:01,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 218. [2020-01-16 18:32:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 18:32:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 646 transitions. [2020-01-16 18:32:01,220 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 646 transitions. Word has length 19 [2020-01-16 18:32:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:01,220 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 646 transitions. [2020-01-16 18:32:01,220 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 646 transitions. [2020-01-16 18:32:01,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:01,221 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:01,221 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:01,221 INFO L426 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-01-16 18:32:01,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:01,221 INFO L82 PathProgramCache]: Analyzing trace with hash -826129118, now seen corresponding path program 234 times [2020-01-16 18:32:01,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:01,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684493862] [2020-01-16 18:32:01,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:01,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684493862] [2020-01-16 18:32:01,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:01,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:01,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092002541] [2020-01-16 18:32:01,419 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:01,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:01,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:01,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:01,420 INFO L87 Difference]: Start difference. First operand 218 states and 646 transitions. Second operand 8 states. [2020-01-16 18:32:01,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:01,501 INFO L93 Difference]: Finished difference Result 346 states and 895 transitions. [2020-01-16 18:32:01,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:01,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:01,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:01,503 INFO L225 Difference]: With dead ends: 346 [2020-01-16 18:32:01,503 INFO L226 Difference]: Without dead ends: 325 [2020-01-16 18:32:01,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-01-16 18:32:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-01-16 18:32:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2020-01-16 18:32:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-01-16 18:32:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 628 transitions. [2020-01-16 18:32:01,508 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 628 transitions. Word has length 19 [2020-01-16 18:32:01,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:01,508 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 628 transitions. [2020-01-16 18:32:01,508 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:01,508 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 628 transitions. [2020-01-16 18:32:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:01,509 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:01,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-01-16 18:32:01,509 INFO L426 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-01-16 18:32:01,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:01,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1007007176, now seen corresponding path program 235 times [2020-01-16 18:32:01,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:01,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986309405] [2020-01-16 18:32:01,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:01,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986309405] [2020-01-16 18:32:01,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:01,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:01,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483509872] [2020-01-16 18:32:01,708 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:01,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:01,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:01,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:01,709 INFO L87 Difference]: Start difference. First operand 210 states and 628 transitions. Second operand 8 states. [2020-01-16 18:32:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:01,763 INFO L93 Difference]: Finished difference Result 327 states and 849 transitions. [2020-01-16 18:32:01,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:01,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:01,765 INFO L225 Difference]: With dead ends: 327 [2020-01-16 18:32:01,765 INFO L226 Difference]: Without dead ends: 317 [2020-01-16 18:32:01,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-01-16 18:32:01,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 214. [2020-01-16 18:32:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 18:32:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 638 transitions. [2020-01-16 18:32:01,770 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 638 transitions. Word has length 19 [2020-01-16 18:32:01,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:01,770 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 638 transitions. [2020-01-16 18:32:01,770 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:01,770 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 638 transitions. [2020-01-16 18:32:01,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:01,771 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:01,771 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:01,771 INFO L426 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-01-16 18:32:01,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:01,771 INFO L82 PathProgramCache]: Analyzing trace with hash 151700522, now seen corresponding path program 236 times [2020-01-16 18:32:01,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:01,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752374035] [2020-01-16 18:32:01,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:01,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-01-16 18:32:01,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752374035] [2020-01-16 18:32:01,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:01,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:01,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496727790] [2020-01-16 18:32:01,964 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:01,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:01,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:01,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:01,964 INFO L87 Difference]: Start difference. First operand 214 states and 638 transitions. Second operand 8 states. [2020-01-16 18:32:02,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:02,049 INFO L93 Difference]: Finished difference Result 329 states and 852 transitions. [2020-01-16 18:32:02,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:02,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:02,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:02,050 INFO L225 Difference]: With dead ends: 329 [2020-01-16 18:32:02,050 INFO L226 Difference]: Without dead ends: 315 [2020-01-16 18:32:02,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-01-16 18:32:02,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-01-16 18:32:02,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 212. [2020-01-16 18:32:02,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 18:32:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 633 transitions. [2020-01-16 18:32:02,055 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 633 transitions. Word has length 19 [2020-01-16 18:32:02,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:02,056 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 633 transitions. [2020-01-16 18:32:02,056 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 633 transitions. [2020-01-16 18:32:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:02,056 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:02,056 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:02,056 INFO L426 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-01-16 18:32:02,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:02,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1677019162, now seen corresponding path program 237 times [2020-01-16 18:32:02,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:02,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054649222] [2020-01-16 18:32:02,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:02,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054649222] [2020-01-16 18:32:02,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:02,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:02,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019334011] [2020-01-16 18:32:02,313 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:02,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:02,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:02,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:02,314 INFO L87 Difference]: Start difference. First operand 212 states and 633 transitions. Second operand 8 states. [2020-01-16 18:32:02,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:02,395 INFO L93 Difference]: Finished difference Result 328 states and 849 transitions. [2020-01-16 18:32:02,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:02,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:02,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:02,397 INFO L225 Difference]: With dead ends: 328 [2020-01-16 18:32:02,397 INFO L226 Difference]: Without dead ends: 318 [2020-01-16 18:32:02,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-01-16 18:32:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-01-16 18:32:02,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 214. [2020-01-16 18:32:02,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 18:32:02,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 636 transitions. [2020-01-16 18:32:02,407 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 636 transitions. Word has length 19 [2020-01-16 18:32:02,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:02,407 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 636 transitions. [2020-01-16 18:32:02,407 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:02,407 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 636 transitions. [2020-01-16 18:32:02,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:02,408 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:02,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-01-16 18:32:02,409 INFO L426 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-01-16 18:32:02,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:02,409 INFO L82 PathProgramCache]: Analyzing trace with hash -187614166, now seen corresponding path program 238 times [2020-01-16 18:32:02,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:02,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678303927] [2020-01-16 18:32:02,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:02,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678303927] [2020-01-16 18:32:02,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:02,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:02,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126062870] [2020-01-16 18:32:02,665 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:02,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:02,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:02,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:02,665 INFO L87 Difference]: Start difference. First operand 214 states and 636 transitions. Second operand 8 states. [2020-01-16 18:32:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:02,745 INFO L93 Difference]: Finished difference Result 331 states and 854 transitions. [2020-01-16 18:32:02,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:02,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:02,746 INFO L225 Difference]: With dead ends: 331 [2020-01-16 18:32:02,746 INFO L226 Difference]: Without dead ends: 316 [2020-01-16 18:32:02,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-01-16 18:32:02,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-01-16 18:32:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 212. [2020-01-16 18:32:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 18:32:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 631 transitions. [2020-01-16 18:32:02,752 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 631 transitions. Word has length 19 [2020-01-16 18:32:02,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:02,752 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 631 transitions. [2020-01-16 18:32:02,752 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:02,752 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 631 transitions. [2020-01-16 18:32:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:02,753 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:02,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-01-16 18:32:02,753 INFO L426 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-01-16 18:32:02,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:02,754 INFO L82 PathProgramCache]: Analyzing trace with hash -921384858, now seen corresponding path program 239 times [2020-01-16 18:32:02,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:02,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716131973] [2020-01-16 18:32:02,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:02,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:02,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716131973] [2020-01-16 18:32:02,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:02,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:02,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394301193] [2020-01-16 18:32:02,955 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:02,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:02,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:02,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:02,955 INFO L87 Difference]: Start difference. First operand 212 states and 631 transitions. Second operand 8 states. [2020-01-16 18:32:03,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:03,029 INFO L93 Difference]: Finished difference Result 330 states and 852 transitions. [2020-01-16 18:32:03,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:03,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:03,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:03,031 INFO L225 Difference]: With dead ends: 330 [2020-01-16 18:32:03,031 INFO L226 Difference]: Without dead ends: 318 [2020-01-16 18:32:03,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-01-16 18:32:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-01-16 18:32:03,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 216. [2020-01-16 18:32:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 18:32:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 639 transitions. [2020-01-16 18:32:03,036 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 639 transitions. Word has length 19 [2020-01-16 18:32:03,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:03,036 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 639 transitions. [2020-01-16 18:32:03,036 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:03,036 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 639 transitions. [2020-01-16 18:32:03,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:03,037 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:03,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-01-16 18:32:03,037 INFO L426 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-01-16 18:32:03,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:03,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1677019162, now seen corresponding path program 240 times [2020-01-16 18:32:03,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:03,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428113874] [2020-01-16 18:32:03,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:03,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:03,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428113874] [2020-01-16 18:32:03,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:03,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:03,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750574275] [2020-01-16 18:32:03,238 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:03,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:03,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:03,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:03,239 INFO L87 Difference]: Start difference. First operand 216 states and 639 transitions. Second operand 8 states. [2020-01-16 18:32:03,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:03,320 INFO L93 Difference]: Finished difference Result 331 states and 850 transitions. [2020-01-16 18:32:03,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:03,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:03,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:03,322 INFO L225 Difference]: With dead ends: 331 [2020-01-16 18:32:03,322 INFO L226 Difference]: Without dead ends: 304 [2020-01-16 18:32:03,322 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:03,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-01-16 18:32:03,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 202. [2020-01-16 18:32:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-01-16 18:32:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 613 transitions. [2020-01-16 18:32:03,327 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 613 transitions. Word has length 19 [2020-01-16 18:32:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:03,327 INFO L478 AbstractCegarLoop]: Abstraction has 202 states and 613 transitions. [2020-01-16 18:32:03,327 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 613 transitions. [2020-01-16 18:32:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:03,328 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:03,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-01-16 18:32:03,328 INFO L426 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-01-16 18:32:03,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:03,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1614896374, now seen corresponding path program 241 times [2020-01-16 18:32:03,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:03,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404302986] [2020-01-16 18:32:03,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:03,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404302986] [2020-01-16 18:32:03,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:03,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:03,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570138195] [2020-01-16 18:32:03,536 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:03,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:03,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:03,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:03,537 INFO L87 Difference]: Start difference. First operand 202 states and 613 transitions. Second operand 8 states. [2020-01-16 18:32:03,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:03,597 INFO L93 Difference]: Finished difference Result 378 states and 975 transitions. [2020-01-16 18:32:03,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:03,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:03,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:03,598 INFO L225 Difference]: With dead ends: 378 [2020-01-16 18:32:03,598 INFO L226 Difference]: Without dead ends: 362 [2020-01-16 18:32:03,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:03,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-01-16 18:32:03,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 218. [2020-01-16 18:32:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 18:32:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 653 transitions. [2020-01-16 18:32:03,605 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 653 transitions. Word has length 19 [2020-01-16 18:32:03,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:03,605 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 653 transitions. [2020-01-16 18:32:03,605 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:03,605 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 653 transitions. [2020-01-16 18:32:03,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:03,606 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:03,606 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:03,606 INFO L426 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-01-16 18:32:03,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:03,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1989547560, now seen corresponding path program 242 times [2020-01-16 18:32:03,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:03,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313546970] [2020-01-16 18:32:03,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:03,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313546970] [2020-01-16 18:32:03,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:03,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:03,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208225845] [2020-01-16 18:32:03,832 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:03,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:03,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:03,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:03,832 INFO L87 Difference]: Start difference. First operand 218 states and 653 transitions. Second operand 8 states. [2020-01-16 18:32:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:03,909 INFO L93 Difference]: Finished difference Result 376 states and 965 transitions. [2020-01-16 18:32:03,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:03,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:03,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:03,911 INFO L225 Difference]: With dead ends: 376 [2020-01-16 18:32:03,911 INFO L226 Difference]: Without dead ends: 354 [2020-01-16 18:32:03,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-01-16 18:32:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-01-16 18:32:03,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 210. [2020-01-16 18:32:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-01-16 18:32:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 632 transitions. [2020-01-16 18:32:03,915 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 632 transitions. Word has length 19 [2020-01-16 18:32:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:03,916 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 632 transitions. [2020-01-16 18:32:03,916 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:03,916 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 632 transitions. [2020-01-16 18:32:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:03,916 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:03,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-01-16 18:32:03,916 INFO L426 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-01-16 18:32:03,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:03,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1498681168, now seen corresponding path program 243 times [2020-01-16 18:32:03,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:03,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510186073] [2020-01-16 18:32:03,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:04,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510186073] [2020-01-16 18:32:04,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:04,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:04,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946476469] [2020-01-16 18:32:04,119 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:04,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:04,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:04,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:04,119 INFO L87 Difference]: Start difference. First operand 210 states and 632 transitions. Second operand 8 states. [2020-01-16 18:32:04,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:04,188 INFO L93 Difference]: Finished difference Result 375 states and 962 transitions. [2020-01-16 18:32:04,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:04,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:04,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:04,189 INFO L225 Difference]: With dead ends: 375 [2020-01-16 18:32:04,190 INFO L226 Difference]: Without dead ends: 359 [2020-01-16 18:32:04,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-01-16 18:32:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 216. [2020-01-16 18:32:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 18:32:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 643 transitions. [2020-01-16 18:32:04,195 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 643 transitions. Word has length 19 [2020-01-16 18:32:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:04,195 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 643 transitions. [2020-01-16 18:32:04,195 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 643 transitions. [2020-01-16 18:32:04,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:04,195 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:04,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-01-16 18:32:04,195 INFO L426 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-01-16 18:32:04,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:04,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1820081378, now seen corresponding path program 244 times [2020-01-16 18:32:04,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:04,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971143873] [2020-01-16 18:32:04,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:04,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971143873] [2020-01-16 18:32:04,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:04,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:04,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788656932] [2020-01-16 18:32:04,397 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:04,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:04,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:04,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:04,397 INFO L87 Difference]: Start difference. First operand 216 states and 643 transitions. Second operand 8 states. [2020-01-16 18:32:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:04,477 INFO L93 Difference]: Finished difference Result 372 states and 951 transitions. [2020-01-16 18:32:04,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:04,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:04,478 INFO L225 Difference]: With dead ends: 372 [2020-01-16 18:32:04,478 INFO L226 Difference]: Without dead ends: 353 [2020-01-16 18:32:04,479 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:04,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-01-16 18:32:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 210. [2020-01-16 18:32:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-01-16 18:32:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 626 transitions. [2020-01-16 18:32:04,484 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 626 transitions. Word has length 19 [2020-01-16 18:32:04,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:04,484 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 626 transitions. [2020-01-16 18:32:04,484 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:04,484 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 626 transitions. [2020-01-16 18:32:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:04,485 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:04,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:04,485 INFO L426 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-01-16 18:32:04,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:04,485 INFO L82 PathProgramCache]: Analyzing trace with hash -308913628, now seen corresponding path program 245 times [2020-01-16 18:32:04,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:04,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540536739] [2020-01-16 18:32:04,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:04,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-01-16 18:32:04,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540536739] [2020-01-16 18:32:04,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:04,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:04,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950702210] [2020-01-16 18:32:04,682 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:04,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:04,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:04,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:04,682 INFO L87 Difference]: Start difference. First operand 210 states and 626 transitions. Second operand 8 states. [2020-01-16 18:32:04,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:04,756 INFO L93 Difference]: Finished difference Result 370 states and 948 transitions. [2020-01-16 18:32:04,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:04,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:04,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:04,757 INFO L225 Difference]: With dead ends: 370 [2020-01-16 18:32:04,757 INFO L226 Difference]: Without dead ends: 356 [2020-01-16 18:32:04,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-01-16 18:32:04,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2020-01-16 18:32:04,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 215. [2020-01-16 18:32:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-01-16 18:32:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 636 transitions. [2020-01-16 18:32:04,762 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 636 transitions. Word has length 19 [2020-01-16 18:32:04,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:04,762 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 636 transitions. [2020-01-16 18:32:04,762 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:04,762 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 636 transitions. [2020-01-16 18:32:04,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:04,763 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:04,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-01-16 18:32:04,763 INFO L426 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-01-16 18:32:04,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:04,763 INFO L82 PathProgramCache]: Analyzing trace with hash 549366256, now seen corresponding path program 246 times [2020-01-16 18:32:04,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:04,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287380489] [2020-01-16 18:32:04,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:04,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287380489] [2020-01-16 18:32:04,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:04,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:04,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225709069] [2020-01-16 18:32:04,962 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:04,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:04,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:04,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:04,962 INFO L87 Difference]: Start difference. First operand 215 states and 636 transitions. Second operand 8 states. [2020-01-16 18:32:05,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:05,042 INFO L93 Difference]: Finished difference Result 369 states and 941 transitions. [2020-01-16 18:32:05,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:05,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:05,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:05,044 INFO L225 Difference]: With dead ends: 369 [2020-01-16 18:32:05,044 INFO L226 Difference]: Without dead ends: 343 [2020-01-16 18:32:05,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-01-16 18:32:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-01-16 18:32:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 202. [2020-01-16 18:32:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-01-16 18:32:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 608 transitions. [2020-01-16 18:32:05,049 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 608 transitions. Word has length 19 [2020-01-16 18:32:05,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:05,049 INFO L478 AbstractCegarLoop]: Abstraction has 202 states and 608 transitions. [2020-01-16 18:32:05,049 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 608 transitions. [2020-01-16 18:32:05,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:05,049 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:05,049 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:05,050 INFO L426 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-01-16 18:32:05,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:05,050 INFO L82 PathProgramCache]: Analyzing trace with hash -667701144, now seen corresponding path program 247 times [2020-01-16 18:32:05,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:05,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535552539] [2020-01-16 18:32:05,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:05,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535552539] [2020-01-16 18:32:05,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:05,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:05,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758294473] [2020-01-16 18:32:05,252 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:05,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:05,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:05,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:05,252 INFO L87 Difference]: Start difference. First operand 202 states and 608 transitions. Second operand 8 states. [2020-01-16 18:32:05,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:05,312 INFO L93 Difference]: Finished difference Result 365 states and 929 transitions. [2020-01-16 18:32:05,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:05,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:05,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:05,313 INFO L225 Difference]: With dead ends: 365 [2020-01-16 18:32:05,313 INFO L226 Difference]: Without dead ends: 349 [2020-01-16 18:32:05,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-01-16 18:32:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-01-16 18:32:05,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 214. [2020-01-16 18:32:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 18:32:05,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 634 transitions. [2020-01-16 18:32:05,318 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 634 transitions. Word has length 19 [2020-01-16 18:32:05,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:05,318 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 634 transitions. [2020-01-16 18:32:05,318 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 634 transitions. [2020-01-16 18:32:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:05,319 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:05,319 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:05,319 INFO L426 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-01-16 18:32:05,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:05,319 INFO L82 PathProgramCache]: Analyzing trace with hash -293049958, now seen corresponding path program 248 times [2020-01-16 18:32:05,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:05,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331800806] [2020-01-16 18:32:05,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:05,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-01-16 18:32:05,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331800806] [2020-01-16 18:32:05,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:05,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:05,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374799249] [2020-01-16 18:32:05,597 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:05,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:05,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:05,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:05,598 INFO L87 Difference]: Start difference. First operand 214 states and 634 transitions. Second operand 8 states. [2020-01-16 18:32:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:05,709 INFO L93 Difference]: Finished difference Result 363 states and 919 transitions. [2020-01-16 18:32:05,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:05,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:05,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:05,710 INFO L225 Difference]: With dead ends: 363 [2020-01-16 18:32:05,711 INFO L226 Difference]: Without dead ends: 341 [2020-01-16 18:32:05,711 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-01-16 18:32:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-01-16 18:32:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 206. [2020-01-16 18:32:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-01-16 18:32:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 616 transitions. [2020-01-16 18:32:05,719 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 616 transitions. Word has length 19 [2020-01-16 18:32:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:05,720 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 616 transitions. [2020-01-16 18:32:05,720 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 616 transitions. [2020-01-16 18:32:05,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:05,721 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:05,721 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:05,721 INFO L426 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-01-16 18:32:05,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:05,721 INFO L82 PathProgramCache]: Analyzing trace with hash -463100062, now seen corresponding path program 249 times [2020-01-16 18:32:05,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:05,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135246100] [2020-01-16 18:32:05,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:05,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135246100] [2020-01-16 18:32:05,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:05,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:05,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004449029] [2020-01-16 18:32:05,950 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:05,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:05,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:05,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:05,951 INFO L87 Difference]: Start difference. First operand 206 states and 616 transitions. Second operand 8 states. [2020-01-16 18:32:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:06,016 INFO L93 Difference]: Finished difference Result 356 states and 902 transitions. [2020-01-16 18:32:06,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:06,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:06,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:06,018 INFO L225 Difference]: With dead ends: 356 [2020-01-16 18:32:06,018 INFO L226 Difference]: Without dead ends: 340 [2020-01-16 18:32:06,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:06,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-01-16 18:32:06,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 209. [2020-01-16 18:32:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-01-16 18:32:06,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 620 transitions. [2020-01-16 18:32:06,023 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 620 transitions. Word has length 19 [2020-01-16 18:32:06,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:06,024 INFO L478 AbstractCegarLoop]: Abstraction has 209 states and 620 transitions. [2020-01-16 18:32:06,024 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:06,024 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 620 transitions. [2020-01-16 18:32:06,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:06,024 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:06,024 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:06,024 INFO L426 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-01-16 18:32:06,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:06,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1680140688, now seen corresponding path program 250 times [2020-01-16 18:32:06,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:06,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611545913] [2020-01-16 18:32:06,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:06,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611545913] [2020-01-16 18:32:06,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:06,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:06,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903076847] [2020-01-16 18:32:06,223 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:06,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:06,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:06,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:06,223 INFO L87 Difference]: Start difference. First operand 209 states and 620 transitions. Second operand 8 states. [2020-01-16 18:32:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:06,306 INFO L93 Difference]: Finished difference Result 350 states and 887 transitions. [2020-01-16 18:32:06,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:06,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:06,307 INFO L225 Difference]: With dead ends: 350 [2020-01-16 18:32:06,307 INFO L226 Difference]: Without dead ends: 337 [2020-01-16 18:32:06,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-01-16 18:32:06,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-01-16 18:32:06,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 206. [2020-01-16 18:32:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-01-16 18:32:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 613 transitions. [2020-01-16 18:32:06,313 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 613 transitions. Word has length 19 [2020-01-16 18:32:06,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:06,313 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 613 transitions. [2020-01-16 18:32:06,313 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:06,313 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 613 transitions. [2020-01-16 18:32:06,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:06,314 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:06,314 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:06,314 INFO L426 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-01-16 18:32:06,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:06,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1861116096, now seen corresponding path program 251 times [2020-01-16 18:32:06,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:06,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167139126] [2020-01-16 18:32:06,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:06,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167139126] [2020-01-16 18:32:06,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:06,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:06,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311370465] [2020-01-16 18:32:06,502 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:06,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:06,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:06,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:06,503 INFO L87 Difference]: Start difference. First operand 206 states and 613 transitions. Second operand 8 states. [2020-01-16 18:32:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:06,579 INFO L93 Difference]: Finished difference Result 351 states and 891 transitions. [2020-01-16 18:32:06,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:06,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:06,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:06,580 INFO L225 Difference]: With dead ends: 351 [2020-01-16 18:32:06,580 INFO L226 Difference]: Without dead ends: 337 [2020-01-16 18:32:06,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-01-16 18:32:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 208. [2020-01-16 18:32:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-01-16 18:32:06,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 616 transitions. [2020-01-16 18:32:06,585 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 616 transitions. Word has length 19 [2020-01-16 18:32:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:06,586 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 616 transitions. [2020-01-16 18:32:06,586 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 616 transitions. [2020-01-16 18:32:06,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:06,586 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:06,586 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:06,587 INFO L426 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-01-16 18:32:06,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:06,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1559515874, now seen corresponding path program 252 times [2020-01-16 18:32:06,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:06,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558840875] [2020-01-16 18:32:06,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:06,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558840875] [2020-01-16 18:32:06,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:06,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:06,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507337749] [2020-01-16 18:32:06,778 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:06,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:06,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:06,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:06,779 INFO L87 Difference]: Start difference. First operand 208 states and 616 transitions. Second operand 8 states. [2020-01-16 18:32:06,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:06,857 INFO L93 Difference]: Finished difference Result 347 states and 880 transitions. [2020-01-16 18:32:06,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:06,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:06,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:06,860 INFO L225 Difference]: With dead ends: 347 [2020-01-16 18:32:06,860 INFO L226 Difference]: Without dead ends: 331 [2020-01-16 18:32:06,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-01-16 18:32:06,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-01-16 18:32:06,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 202. [2020-01-16 18:32:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-01-16 18:32:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 604 transitions. [2020-01-16 18:32:06,866 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 604 transitions. Word has length 19 [2020-01-16 18:32:06,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:06,866 INFO L478 AbstractCegarLoop]: Abstraction has 202 states and 604 transitions. [2020-01-16 18:32:06,866 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 604 transitions. [2020-01-16 18:32:06,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:06,867 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:06,867 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:06,867 INFO L426 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-01-16 18:32:06,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:06,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1800243944, now seen corresponding path program 253 times [2020-01-16 18:32:06,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:06,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854486255] [2020-01-16 18:32:06,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:07,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:07,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854486255] [2020-01-16 18:32:07,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:07,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:07,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791127665] [2020-01-16 18:32:07,051 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:07,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:07,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:07,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:07,052 INFO L87 Difference]: Start difference. First operand 202 states and 604 transitions. Second operand 8 states. [2020-01-16 18:32:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:07,111 INFO L93 Difference]: Finished difference Result 352 states and 894 transitions. [2020-01-16 18:32:07,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:07,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:07,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:07,113 INFO L225 Difference]: With dead ends: 352 [2020-01-16 18:32:07,113 INFO L226 Difference]: Without dead ends: 336 [2020-01-16 18:32:07,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-01-16 18:32:07,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-01-16 18:32:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 208. [2020-01-16 18:32:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-01-16 18:32:07,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 618 transitions. [2020-01-16 18:32:07,118 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 618 transitions. Word has length 19 [2020-01-16 18:32:07,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:07,118 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 618 transitions. [2020-01-16 18:32:07,118 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 618 transitions. [2020-01-16 18:32:07,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:07,119 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:07,119 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:07,119 INFO L426 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-01-16 18:32:07,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:07,120 INFO L82 PathProgramCache]: Analyzing trace with hash -351482602, now seen corresponding path program 254 times [2020-01-16 18:32:07,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:07,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063417808] [2020-01-16 18:32:07,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:07,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063417808] [2020-01-16 18:32:07,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:07,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:07,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819945199] [2020-01-16 18:32:07,316 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:07,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:07,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:07,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:07,317 INFO L87 Difference]: Start difference. First operand 208 states and 618 transitions. Second operand 8 states. [2020-01-16 18:32:07,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:07,398 INFO L93 Difference]: Finished difference Result 346 states and 879 transitions. [2020-01-16 18:32:07,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:07,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:07,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:07,399 INFO L225 Difference]: With dead ends: 346 [2020-01-16 18:32:07,400 INFO L226 Difference]: Without dead ends: 333 [2020-01-16 18:32:07,400 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-01-16 18:32:07,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 205. [2020-01-16 18:32:07,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-01-16 18:32:07,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 611 transitions. [2020-01-16 18:32:07,404 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 611 transitions. Word has length 19 [2020-01-16 18:32:07,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:07,404 INFO L478 AbstractCegarLoop]: Abstraction has 205 states and 611 transitions. [2020-01-16 18:32:07,404 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:07,404 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 611 transitions. [2020-01-16 18:32:07,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:07,405 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:07,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-01-16 18:32:07,405 INFO L426 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-01-16 18:32:07,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:07,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1293897678, now seen corresponding path program 255 times [2020-01-16 18:32:07,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:07,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488394659] [2020-01-16 18:32:07,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:07,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488394659] [2020-01-16 18:32:07,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:07,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:07,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16960569] [2020-01-16 18:32:07,592 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:07,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:07,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:07,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:07,592 INFO L87 Difference]: Start difference. First operand 205 states and 611 transitions. Second operand 8 states. [2020-01-16 18:32:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:07,654 INFO L93 Difference]: Finished difference Result 358 states and 908 transitions. [2020-01-16 18:32:07,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:07,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:07,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:07,655 INFO L225 Difference]: With dead ends: 358 [2020-01-16 18:32:07,655 INFO L226 Difference]: Without dead ends: 342 [2020-01-16 18:32:07,655 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:07,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2020-01-16 18:32:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 211. [2020-01-16 18:32:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-01-16 18:32:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 622 transitions. [2020-01-16 18:32:07,660 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 622 transitions. Word has length 19 [2020-01-16 18:32:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:07,660 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 622 transitions. [2020-01-16 18:32:07,660 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 622 transitions. [2020-01-16 18:32:07,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:07,660 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:07,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-01-16 18:32:07,660 INFO L426 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-01-16 18:32:07,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:07,661 INFO L82 PathProgramCache]: Analyzing trace with hash 317692928, now seen corresponding path program 256 times [2020-01-16 18:32:07,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:07,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340239758] [2020-01-16 18:32:07,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:07,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:07,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340239758] [2020-01-16 18:32:07,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:07,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:07,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843286913] [2020-01-16 18:32:07,842 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:07,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:07,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:07,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:07,843 INFO L87 Difference]: Start difference. First operand 211 states and 622 transitions. Second operand 8 states. [2020-01-16 18:32:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:07,920 INFO L93 Difference]: Finished difference Result 355 states and 897 transitions. [2020-01-16 18:32:07,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:07,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:07,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:07,922 INFO L225 Difference]: With dead ends: 355 [2020-01-16 18:32:07,922 INFO L226 Difference]: Without dead ends: 336 [2020-01-16 18:32:07,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-01-16 18:32:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-01-16 18:32:07,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 205. [2020-01-16 18:32:07,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-01-16 18:32:07,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 608 transitions. [2020-01-16 18:32:07,928 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 608 transitions. Word has length 19 [2020-01-16 18:32:07,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:07,928 INFO L478 AbstractCegarLoop]: Abstraction has 205 states and 608 transitions. [2020-01-16 18:32:07,928 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:07,928 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 608 transitions. [2020-01-16 18:32:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:07,928 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:07,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-01-16 18:32:07,928 INFO L426 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-01-16 18:32:07,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:07,929 INFO L82 PathProgramCache]: Analyzing trace with hash -235841100, now seen corresponding path program 257 times [2020-01-16 18:32:07,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:07,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816988868] [2020-01-16 18:32:07,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:08,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816988868] [2020-01-16 18:32:08,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:08,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:08,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011219016] [2020-01-16 18:32:08,106 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:08,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:08,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:08,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:08,106 INFO L87 Difference]: Start difference. First operand 205 states and 608 transitions. Second operand 8 states. [2020-01-16 18:32:08,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:08,191 INFO L93 Difference]: Finished difference Result 342 states and 869 transitions. [2020-01-16 18:32:08,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:08,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:08,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:08,195 INFO L225 Difference]: With dead ends: 342 [2020-01-16 18:32:08,195 INFO L226 Difference]: Without dead ends: 332 [2020-01-16 18:32:08,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-01-16 18:32:08,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-01-16 18:32:08,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 207. [2020-01-16 18:32:08,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-01-16 18:32:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 611 transitions. [2020-01-16 18:32:08,199 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 611 transitions. Word has length 19 [2020-01-16 18:32:08,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:08,199 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 611 transitions. [2020-01-16 18:32:08,199 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:08,200 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 611 transitions. [2020-01-16 18:32:08,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:08,200 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:08,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-01-16 18:32:08,200 INFO L426 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-01-16 18:32:08,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:08,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1964888434, now seen corresponding path program 258 times [2020-01-16 18:32:08,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:08,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902887704] [2020-01-16 18:32:08,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:08,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902887704] [2020-01-16 18:32:08,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:08,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:08,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220348872] [2020-01-16 18:32:08,376 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:08,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:08,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:08,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:08,377 INFO L87 Difference]: Start difference. First operand 207 states and 611 transitions. Second operand 8 states. [2020-01-16 18:32:08,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:08,456 INFO L93 Difference]: Finished difference Result 345 states and 874 transitions. [2020-01-16 18:32:08,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:08,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:08,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:08,458 INFO L225 Difference]: With dead ends: 345 [2020-01-16 18:32:08,458 INFO L226 Difference]: Without dead ends: 327 [2020-01-16 18:32:08,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-01-16 18:32:08,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-01-16 18:32:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 202. [2020-01-16 18:32:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-01-16 18:32:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 601 transitions. [2020-01-16 18:32:08,463 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 601 transitions. Word has length 19 [2020-01-16 18:32:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:08,464 INFO L478 AbstractCegarLoop]: Abstraction has 202 states and 601 transitions. [2020-01-16 18:32:08,464 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 601 transitions. [2020-01-16 18:32:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:08,464 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:08,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-01-16 18:32:08,464 INFO L426 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-01-16 18:32:08,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:08,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1020844596, now seen corresponding path program 259 times [2020-01-16 18:32:08,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:08,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731160002] [2020-01-16 18:32:08,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:08,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731160002] [2020-01-16 18:32:08,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:08,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:08,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233823825] [2020-01-16 18:32:08,648 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:08,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:08,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:08,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:08,648 INFO L87 Difference]: Start difference. First operand 202 states and 601 transitions. Second operand 8 states. [2020-01-16 18:32:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:08,726 INFO L93 Difference]: Finished difference Result 342 states and 873 transitions. [2020-01-16 18:32:08,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:08,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:08,727 INFO L225 Difference]: With dead ends: 342 [2020-01-16 18:32:08,727 INFO L226 Difference]: Without dead ends: 328 [2020-01-16 18:32:08,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-01-16 18:32:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 206. [2020-01-16 18:32:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-01-16 18:32:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 611 transitions. [2020-01-16 18:32:08,731 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 611 transitions. Word has length 19 [2020-01-16 18:32:08,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:08,732 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 611 transitions. [2020-01-16 18:32:08,732 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:08,732 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 611 transitions. [2020-01-16 18:32:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:08,732 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:08,732 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:08,732 INFO L426 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-01-16 18:32:08,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:08,733 INFO L82 PathProgramCache]: Analyzing trace with hash 146509270, now seen corresponding path program 260 times [2020-01-16 18:32:08,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:08,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662294782] [2020-01-16 18:32:08,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:08,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662294782] [2020-01-16 18:32:08,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:08,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:08,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221656869] [2020-01-16 18:32:08,918 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:08,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:08,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:08,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:08,918 INFO L87 Difference]: Start difference. First operand 206 states and 611 transitions. Second operand 8 states. [2020-01-16 18:32:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:08,999 INFO L93 Difference]: Finished difference Result 338 states and 862 transitions. [2020-01-16 18:32:09,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:09,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:09,001 INFO L225 Difference]: With dead ends: 338 [2020-01-16 18:32:09,001 INFO L226 Difference]: Without dead ends: 326 [2020-01-16 18:32:09,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-01-16 18:32:09,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-01-16 18:32:09,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 204. [2020-01-16 18:32:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-01-16 18:32:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 606 transitions. [2020-01-16 18:32:09,006 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 606 transitions. Word has length 19 [2020-01-16 18:32:09,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:09,006 INFO L478 AbstractCegarLoop]: Abstraction has 204 states and 606 transitions. [2020-01-16 18:32:09,006 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:09,006 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 606 transitions. [2020-01-16 18:32:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:09,007 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:09,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-01-16 18:32:09,007 INFO L426 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-01-16 18:32:09,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:09,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1040015206, now seen corresponding path program 261 times [2020-01-16 18:32:09,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:09,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509192171] [2020-01-16 18:32:09,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:09,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509192171] [2020-01-16 18:32:09,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:09,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:09,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407044093] [2020-01-16 18:32:09,184 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:09,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:09,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:09,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:09,185 INFO L87 Difference]: Start difference. First operand 204 states and 606 transitions. Second operand 8 states. [2020-01-16 18:32:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:09,259 INFO L93 Difference]: Finished difference Result 348 states and 888 transitions. [2020-01-16 18:32:09,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:09,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:09,260 INFO L225 Difference]: With dead ends: 348 [2020-01-16 18:32:09,260 INFO L226 Difference]: Without dead ends: 334 [2020-01-16 18:32:09,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-01-16 18:32:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-01-16 18:32:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 209. [2020-01-16 18:32:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-01-16 18:32:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 616 transitions. [2020-01-16 18:32:09,265 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 616 transitions. Word has length 19 [2020-01-16 18:32:09,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:09,265 INFO L478 AbstractCegarLoop]: Abstraction has 209 states and 616 transitions. [2020-01-16 18:32:09,265 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 616 transitions. [2020-01-16 18:32:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:09,266 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:09,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-01-16 18:32:09,266 INFO L426 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-01-16 18:32:09,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:09,266 INFO L82 PathProgramCache]: Analyzing trace with hash -71131166, now seen corresponding path program 262 times [2020-01-16 18:32:09,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:09,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909515147] [2020-01-16 18:32:09,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:09,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909515147] [2020-01-16 18:32:09,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:09,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:09,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177671727] [2020-01-16 18:32:09,453 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:09,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:09,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:09,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:09,453 INFO L87 Difference]: Start difference. First operand 209 states and 616 transitions. Second operand 8 states. [2020-01-16 18:32:09,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:09,542 INFO L93 Difference]: Finished difference Result 347 states and 881 transitions. [2020-01-16 18:32:09,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:09,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:09,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:09,543 INFO L225 Difference]: With dead ends: 347 [2020-01-16 18:32:09,543 INFO L226 Difference]: Without dead ends: 329 [2020-01-16 18:32:09,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:09,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-01-16 18:32:09,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 204. [2020-01-16 18:32:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-01-16 18:32:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 604 transitions. [2020-01-16 18:32:09,550 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 604 transitions. Word has length 19 [2020-01-16 18:32:09,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:09,550 INFO L478 AbstractCegarLoop]: Abstraction has 204 states and 604 transitions. [2020-01-16 18:32:09,550 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 604 transitions. [2020-01-16 18:32:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:09,551 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:09,551 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:09,551 INFO L426 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-01-16 18:32:09,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:09,551 INFO L82 PathProgramCache]: Analyzing trace with hash 319756962, now seen corresponding path program 263 times [2020-01-16 18:32:09,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:09,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132904090] [2020-01-16 18:32:09,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:09,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132904090] [2020-01-16 18:32:09,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:09,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:09,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15270606] [2020-01-16 18:32:09,755 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:09,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:09,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:09,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:09,756 INFO L87 Difference]: Start difference. First operand 204 states and 604 transitions. Second operand 8 states. [2020-01-16 18:32:09,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:09,830 INFO L93 Difference]: Finished difference Result 337 states and 858 transitions. [2020-01-16 18:32:09,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:09,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:09,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:09,831 INFO L225 Difference]: With dead ends: 337 [2020-01-16 18:32:09,831 INFO L226 Difference]: Without dead ends: 327 [2020-01-16 18:32:09,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-01-16 18:32:09,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-01-16 18:32:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 206. [2020-01-16 18:32:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-01-16 18:32:09,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 607 transitions. [2020-01-16 18:32:09,838 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 607 transitions. Word has length 19 [2020-01-16 18:32:09,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:09,838 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 607 transitions. [2020-01-16 18:32:09,839 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:09,839 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 607 transitions. [2020-01-16 18:32:09,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:09,839 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:09,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-01-16 18:32:09,839 INFO L426 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-01-16 18:32:09,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:09,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1409290372, now seen corresponding path program 264 times [2020-01-16 18:32:09,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:09,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789542575] [2020-01-16 18:32:09,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:10,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-01-16 18:32:10,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789542575] [2020-01-16 18:32:10,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:10,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:10,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493570925] [2020-01-16 18:32:10,025 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:10,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:10,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:10,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:10,025 INFO L87 Difference]: Start difference. First operand 206 states and 607 transitions. Second operand 8 states. [2020-01-16 18:32:10,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:10,109 INFO L93 Difference]: Finished difference Result 340 states and 863 transitions. [2020-01-16 18:32:10,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:10,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:10,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:10,110 INFO L225 Difference]: With dead ends: 340 [2020-01-16 18:32:10,111 INFO L226 Difference]: Without dead ends: 318 [2020-01-16 18:32:10,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-01-16 18:32:10,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-01-16 18:32:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 197. [2020-01-16 18:32:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-01-16 18:32:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 591 transitions. [2020-01-16 18:32:10,116 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 591 transitions. Word has length 19 [2020-01-16 18:32:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:10,116 INFO L478 AbstractCegarLoop]: Abstraction has 197 states and 591 transitions. [2020-01-16 18:32:10,116 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 591 transitions. [2020-01-16 18:32:10,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:10,117 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:10,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-01-16 18:32:10,117 INFO L426 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-01-16 18:32:10,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:10,117 INFO L82 PathProgramCache]: Analyzing trace with hash -666960488, now seen corresponding path program 265 times [2020-01-16 18:32:10,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:10,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737016603] [2020-01-16 18:32:10,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:10,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737016603] [2020-01-16 18:32:10,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:10,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:10,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143939983] [2020-01-16 18:32:10,366 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:10,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:10,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:10,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:10,366 INFO L87 Difference]: Start difference. First operand 197 states and 591 transitions. Second operand 8 states. [2020-01-16 18:32:10,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:10,425 INFO L93 Difference]: Finished difference Result 365 states and 927 transitions. [2020-01-16 18:32:10,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:10,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:10,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:10,427 INFO L225 Difference]: With dead ends: 365 [2020-01-16 18:32:10,427 INFO L226 Difference]: Without dead ends: 349 [2020-01-16 18:32:10,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-01-16 18:32:10,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 205. [2020-01-16 18:32:10,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-01-16 18:32:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 605 transitions. [2020-01-16 18:32:10,433 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 605 transitions. Word has length 19 [2020-01-16 18:32:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:10,433 INFO L478 AbstractCegarLoop]: Abstraction has 205 states and 605 transitions. [2020-01-16 18:32:10,433 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 605 transitions. [2020-01-16 18:32:10,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:10,433 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:10,434 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:10,434 INFO L426 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-01-16 18:32:10,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:10,434 INFO L82 PathProgramCache]: Analyzing trace with hash -292309302, now seen corresponding path program 266 times [2020-01-16 18:32:10,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:10,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477670735] [2020-01-16 18:32:10,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:10,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477670735] [2020-01-16 18:32:10,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:10,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:10,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430508106] [2020-01-16 18:32:10,670 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:10,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:10,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:10,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:10,670 INFO L87 Difference]: Start difference. First operand 205 states and 605 transitions. Second operand 8 states. [2020-01-16 18:32:10,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:10,749 INFO L93 Difference]: Finished difference Result 363 states and 917 transitions. [2020-01-16 18:32:10,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:10,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:10,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:10,750 INFO L225 Difference]: With dead ends: 363 [2020-01-16 18:32:10,750 INFO L226 Difference]: Without dead ends: 341 [2020-01-16 18:32:10,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-01-16 18:32:10,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-01-16 18:32:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 197. [2020-01-16 18:32:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-01-16 18:32:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 584 transitions. [2020-01-16 18:32:10,756 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 584 transitions. Word has length 19 [2020-01-16 18:32:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:10,756 INFO L478 AbstractCegarLoop]: Abstraction has 197 states and 584 transitions. [2020-01-16 18:32:10,756 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 584 transitions. [2020-01-16 18:32:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:10,757 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:10,757 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:10,757 INFO L426 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-01-16 18:32:10,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:10,757 INFO L82 PathProgramCache]: Analyzing trace with hash 514429266, now seen corresponding path program 267 times [2020-01-16 18:32:10,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:10,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64167856] [2020-01-16 18:32:10,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:10,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64167856] [2020-01-16 18:32:10,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:10,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:10,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336383124] [2020-01-16 18:32:10,982 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:10,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:10,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:10,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:10,982 INFO L87 Difference]: Start difference. First operand 197 states and 584 transitions. Second operand 8 states. [2020-01-16 18:32:11,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:11,041 INFO L93 Difference]: Finished difference Result 362 states and 914 transitions. [2020-01-16 18:32:11,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:11,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:11,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:11,043 INFO L225 Difference]: With dead ends: 362 [2020-01-16 18:32:11,043 INFO L226 Difference]: Without dead ends: 346 [2020-01-16 18:32:11,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-01-16 18:32:11,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 203. [2020-01-16 18:32:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-01-16 18:32:11,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 595 transitions. [2020-01-16 18:32:11,049 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 595 transitions. Word has length 19 [2020-01-16 18:32:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:11,049 INFO L478 AbstractCegarLoop]: Abstraction has 203 states and 595 transitions. [2020-01-16 18:32:11,049 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 595 transitions. [2020-01-16 18:32:11,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:11,050 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:11,050 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:11,050 INFO L426 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-01-16 18:32:11,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:11,050 INFO L82 PathProgramCache]: Analyzing trace with hash -461775484, now seen corresponding path program 268 times [2020-01-16 18:32:11,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:11,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755442429] [2020-01-16 18:32:11,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:11,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:11,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755442429] [2020-01-16 18:32:11,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:11,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:11,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666220524] [2020-01-16 18:32:11,276 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:11,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:11,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:11,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:11,277 INFO L87 Difference]: Start difference. First operand 203 states and 595 transitions. Second operand 8 states. [2020-01-16 18:32:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:11,358 INFO L93 Difference]: Finished difference Result 359 states and 903 transitions. [2020-01-16 18:32:11,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:11,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:11,359 INFO L225 Difference]: With dead ends: 359 [2020-01-16 18:32:11,359 INFO L226 Difference]: Without dead ends: 340 [2020-01-16 18:32:11,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-01-16 18:32:11,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 197. [2020-01-16 18:32:11,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-01-16 18:32:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 578 transitions. [2020-01-16 18:32:11,364 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 578 transitions. Word has length 19 [2020-01-16 18:32:11,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:11,364 INFO L478 AbstractCegarLoop]: Abstraction has 197 states and 578 transitions. [2020-01-16 18:32:11,364 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 578 transitions. [2020-01-16 18:32:11,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:11,364 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:11,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:11,364 INFO L426 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-01-16 18:32:11,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:11,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1704196806, now seen corresponding path program 269 times [2020-01-16 18:32:11,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:11,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779525470] [2020-01-16 18:32:11,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:11,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779525470] [2020-01-16 18:32:11,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:11,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:11,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992736168] [2020-01-16 18:32:11,606 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:11,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:11,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:11,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:11,606 INFO L87 Difference]: Start difference. First operand 197 states and 578 transitions. Second operand 8 states. [2020-01-16 18:32:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:11,693 INFO L93 Difference]: Finished difference Result 357 states and 900 transitions. [2020-01-16 18:32:11,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:11,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:11,694 INFO L225 Difference]: With dead ends: 357 [2020-01-16 18:32:11,694 INFO L226 Difference]: Without dead ends: 343 [2020-01-16 18:32:11,695 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:11,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-01-16 18:32:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 202. [2020-01-16 18:32:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-01-16 18:32:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 588 transitions. [2020-01-16 18:32:11,700 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 588 transitions. Word has length 19 [2020-01-16 18:32:11,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:11,700 INFO L478 AbstractCegarLoop]: Abstraction has 202 states and 588 transitions. [2020-01-16 18:32:11,700 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 588 transitions. [2020-01-16 18:32:11,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:11,700 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:11,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-01-16 18:32:11,701 INFO L426 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-01-16 18:32:11,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:11,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1732490606, now seen corresponding path program 270 times [2020-01-16 18:32:11,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:11,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987527259] [2020-01-16 18:32:11,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:11,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987527259] [2020-01-16 18:32:11,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:11,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:11,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518535111] [2020-01-16 18:32:11,913 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:11,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:11,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:11,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:11,914 INFO L87 Difference]: Start difference. First operand 202 states and 588 transitions. Second operand 8 states. [2020-01-16 18:32:11,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:11,997 INFO L93 Difference]: Finished difference Result 356 states and 893 transitions. [2020-01-16 18:32:11,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:11,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:11,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:11,998 INFO L225 Difference]: With dead ends: 356 [2020-01-16 18:32:11,999 INFO L226 Difference]: Without dead ends: 330 [2020-01-16 18:32:11,999 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:12,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-01-16 18:32:12,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 189. [2020-01-16 18:32:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 18:32:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 560 transitions. [2020-01-16 18:32:12,003 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 560 transitions. Word has length 19 [2020-01-16 18:32:12,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:12,003 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 560 transitions. [2020-01-16 18:32:12,003 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:12,003 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 560 transitions. [2020-01-16 18:32:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:12,004 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:12,004 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:12,004 INFO L426 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-01-16 18:32:12,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:12,004 INFO L82 PathProgramCache]: Analyzing trace with hash 710767946, now seen corresponding path program 271 times [2020-01-16 18:32:12,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:12,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929451868] [2020-01-16 18:32:12,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:12,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929451868] [2020-01-16 18:32:12,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:12,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:12,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042176379] [2020-01-16 18:32:12,252 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:12,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:12,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:12,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:12,252 INFO L87 Difference]: Start difference. First operand 189 states and 560 transitions. Second operand 8 states. [2020-01-16 18:32:12,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:12,312 INFO L93 Difference]: Finished difference Result 344 states and 860 transitions. [2020-01-16 18:32:12,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:12,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:12,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:12,313 INFO L225 Difference]: With dead ends: 344 [2020-01-16 18:32:12,314 INFO L226 Difference]: Without dead ends: 328 [2020-01-16 18:32:12,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-01-16 18:32:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-01-16 18:32:12,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 201. [2020-01-16 18:32:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2020-01-16 18:32:12,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 586 transitions. [2020-01-16 18:32:12,319 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 586 transitions. Word has length 19 [2020-01-16 18:32:12,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:12,320 INFO L478 AbstractCegarLoop]: Abstraction has 201 states and 586 transitions. [2020-01-16 18:32:12,320 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 586 transitions. [2020-01-16 18:32:12,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:12,320 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:12,320 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:12,320 INFO L426 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-01-16 18:32:12,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:12,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1085419132, now seen corresponding path program 272 times [2020-01-16 18:32:12,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:12,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195506918] [2020-01-16 18:32:12,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:12,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195506918] [2020-01-16 18:32:12,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:12,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:12,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103505781] [2020-01-16 18:32:12,554 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:12,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:12,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:12,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:12,555 INFO L87 Difference]: Start difference. First operand 201 states and 586 transitions. Second operand 8 states. [2020-01-16 18:32:12,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:12,634 INFO L93 Difference]: Finished difference Result 342 states and 850 transitions. [2020-01-16 18:32:12,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:12,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:12,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:12,635 INFO L225 Difference]: With dead ends: 342 [2020-01-16 18:32:12,635 INFO L226 Difference]: Without dead ends: 320 [2020-01-16 18:32:12,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-01-16 18:32:12,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-01-16 18:32:12,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 193. [2020-01-16 18:32:12,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-01-16 18:32:12,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 568 transitions. [2020-01-16 18:32:12,640 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 568 transitions. Word has length 19 [2020-01-16 18:32:12,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:12,640 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 568 transitions. [2020-01-16 18:32:12,640 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:12,640 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 568 transitions. [2020-01-16 18:32:12,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:12,641 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:12,641 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:12,641 INFO L426 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-01-16 18:32:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:12,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1240965252, now seen corresponding path program 273 times [2020-01-16 18:32:12,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:12,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979606946] [2020-01-16 18:32:12,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:12,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-01-16 18:32:12,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979606946] [2020-01-16 18:32:12,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:12,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:12,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738417475] [2020-01-16 18:32:12,839 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:12,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:12,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:12,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:12,840 INFO L87 Difference]: Start difference. First operand 193 states and 568 transitions. Second operand 8 states. [2020-01-16 18:32:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:12,897 INFO L93 Difference]: Finished difference Result 327 states and 818 transitions. [2020-01-16 18:32:12,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:12,898 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:12,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:12,898 INFO L225 Difference]: With dead ends: 327 [2020-01-16 18:32:12,899 INFO L226 Difference]: Without dead ends: 311 [2020-01-16 18:32:12,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-01-16 18:32:12,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 196. [2020-01-16 18:32:12,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-01-16 18:32:12,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 572 transitions. [2020-01-16 18:32:12,904 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 572 transitions. Word has length 19 [2020-01-16 18:32:12,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:12,904 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 572 transitions. [2020-01-16 18:32:12,904 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 572 transitions. [2020-01-16 18:32:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:12,905 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:12,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-01-16 18:32:12,905 INFO L426 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-01-16 18:32:12,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:12,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1500023478, now seen corresponding path program 274 times [2020-01-16 18:32:12,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:12,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144928934] [2020-01-16 18:32:12,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:13,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:13,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144928934] [2020-01-16 18:32:13,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:13,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:13,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890970432] [2020-01-16 18:32:13,101 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:13,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:13,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:13,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:13,102 INFO L87 Difference]: Start difference. First operand 196 states and 572 transitions. Second operand 8 states. [2020-01-16 18:32:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:13,162 INFO L93 Difference]: Finished difference Result 312 states and 794 transitions. [2020-01-16 18:32:13,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:13,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:13,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:13,163 INFO L225 Difference]: With dead ends: 312 [2020-01-16 18:32:13,163 INFO L226 Difference]: Without dead ends: 299 [2020-01-16 18:32:13,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-01-16 18:32:13,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-01-16 18:32:13,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 193. [2020-01-16 18:32:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-01-16 18:32:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 565 transitions. [2020-01-16 18:32:13,168 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 565 transitions. Word has length 19 [2020-01-16 18:32:13,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:13,168 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 565 transitions. [2020-01-16 18:32:13,168 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:13,168 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 565 transitions. [2020-01-16 18:32:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:13,169 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:13,169 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:13,169 INFO L426 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-01-16 18:32:13,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:13,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1131696324, now seen corresponding path program 275 times [2020-01-16 18:32:13,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:13,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682730473] [2020-01-16 18:32:13,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:13,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682730473] [2020-01-16 18:32:13,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:13,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:13,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867418524] [2020-01-16 18:32:13,362 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:13,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:13,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:13,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:13,363 INFO L87 Difference]: Start difference. First operand 193 states and 565 transitions. Second operand 8 states. [2020-01-16 18:32:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:13,447 INFO L93 Difference]: Finished difference Result 324 states and 810 transitions. [2020-01-16 18:32:13,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:13,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:13,448 INFO L225 Difference]: With dead ends: 324 [2020-01-16 18:32:13,449 INFO L226 Difference]: Without dead ends: 310 [2020-01-16 18:32:13,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:13,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-01-16 18:32:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 195. [2020-01-16 18:32:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-01-16 18:32:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 568 transitions. [2020-01-16 18:32:13,454 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 568 transitions. Word has length 19 [2020-01-16 18:32:13,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:13,454 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 568 transitions. [2020-01-16 18:32:13,454 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 568 transitions. [2020-01-16 18:32:13,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:13,454 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:13,454 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:13,454 INFO L426 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-01-16 18:32:13,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:13,455 INFO L82 PathProgramCache]: Analyzing trace with hash -11566494, now seen corresponding path program 276 times [2020-01-16 18:32:13,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:13,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723383182] [2020-01-16 18:32:13,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:13,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-01-16 18:32:13,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723383182] [2020-01-16 18:32:13,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:13,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:13,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678231808] [2020-01-16 18:32:13,655 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:13,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:13,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:13,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:13,656 INFO L87 Difference]: Start difference. First operand 195 states and 568 transitions. Second operand 8 states. [2020-01-16 18:32:13,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:13,759 INFO L93 Difference]: Finished difference Result 311 states and 790 transitions. [2020-01-16 18:32:13,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:13,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:13,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:13,760 INFO L225 Difference]: With dead ends: 311 [2020-01-16 18:32:13,760 INFO L226 Difference]: Without dead ends: 295 [2020-01-16 18:32:13,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-01-16 18:32:13,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-01-16 18:32:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 189. [2020-01-16 18:32:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 18:32:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 556 transitions. [2020-01-16 18:32:13,765 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 556 transitions. Word has length 19 [2020-01-16 18:32:13,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:13,765 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 556 transitions. [2020-01-16 18:32:13,765 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:13,765 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 556 transitions. [2020-01-16 18:32:13,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:13,765 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:13,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-01-16 18:32:13,765 INFO L426 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-01-16 18:32:13,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:13,766 INFO L82 PathProgramCache]: Analyzing trace with hash -790658038, now seen corresponding path program 277 times [2020-01-16 18:32:13,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:13,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202540391] [2020-01-16 18:32:13,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:13,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:13,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202540391] [2020-01-16 18:32:13,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:13,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:13,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186292289] [2020-01-16 18:32:13,966 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:13,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:13,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:13,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:13,966 INFO L87 Difference]: Start difference. First operand 189 states and 556 transitions. Second operand 8 states. [2020-01-16 18:32:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:14,022 INFO L93 Difference]: Finished difference Result 339 states and 846 transitions. [2020-01-16 18:32:14,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:14,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:14,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:14,024 INFO L225 Difference]: With dead ends: 339 [2020-01-16 18:32:14,024 INFO L226 Difference]: Without dead ends: 323 [2020-01-16 18:32:14,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-01-16 18:32:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-01-16 18:32:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 195. [2020-01-16 18:32:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-01-16 18:32:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 570 transitions. [2020-01-16 18:32:14,032 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 570 transitions. Word has length 19 [2020-01-16 18:32:14,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:14,033 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 570 transitions. [2020-01-16 18:32:14,033 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 570 transitions. [2020-01-16 18:32:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:14,033 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:14,033 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:14,033 INFO L426 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-01-16 18:32:14,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:14,034 INFO L82 PathProgramCache]: Analyzing trace with hash -531599812, now seen corresponding path program 278 times [2020-01-16 18:32:14,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:14,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37665338] [2020-01-16 18:32:14,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:14,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37665338] [2020-01-16 18:32:14,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:14,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:14,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054189677] [2020-01-16 18:32:14,235 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:14,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:14,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:14,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:14,236 INFO L87 Difference]: Start difference. First operand 195 states and 570 transitions. Second operand 8 states. [2020-01-16 18:32:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:14,297 INFO L93 Difference]: Finished difference Result 333 states and 831 transitions. [2020-01-16 18:32:14,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:14,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:14,299 INFO L225 Difference]: With dead ends: 333 [2020-01-16 18:32:14,299 INFO L226 Difference]: Without dead ends: 320 [2020-01-16 18:32:14,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-01-16 18:32:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 192. [2020-01-16 18:32:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 18:32:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 563 transitions. [2020-01-16 18:32:14,305 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 563 transitions. Word has length 19 [2020-01-16 18:32:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:14,305 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 563 transitions. [2020-01-16 18:32:14,305 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 563 transitions. [2020-01-16 18:32:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:14,306 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:14,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-01-16 18:32:14,306 INFO L426 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-01-16 18:32:14,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:14,307 INFO L82 PathProgramCache]: Analyzing trace with hash 303433550, now seen corresponding path program 279 times [2020-01-16 18:32:14,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:14,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835604120] [2020-01-16 18:32:14,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:14,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835604120] [2020-01-16 18:32:14,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:14,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:14,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879587442] [2020-01-16 18:32:14,525 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:14,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:14,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:14,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:14,525 INFO L87 Difference]: Start difference. First operand 192 states and 563 transitions. Second operand 8 states. [2020-01-16 18:32:14,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:14,588 INFO L93 Difference]: Finished difference Result 339 states and 843 transitions. [2020-01-16 18:32:14,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:14,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:14,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:14,589 INFO L225 Difference]: With dead ends: 339 [2020-01-16 18:32:14,589 INFO L226 Difference]: Without dead ends: 323 [2020-01-16 18:32:14,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-01-16 18:32:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-01-16 18:32:14,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 198. [2020-01-16 18:32:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-01-16 18:32:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 574 transitions. [2020-01-16 18:32:14,595 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 574 transitions. Word has length 19 [2020-01-16 18:32:14,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:14,595 INFO L478 AbstractCegarLoop]: Abstraction has 198 states and 574 transitions. [2020-01-16 18:32:14,595 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 574 transitions. [2020-01-16 18:32:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:14,595 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:14,595 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:14,595 INFO L426 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-01-16 18:32:14,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:14,596 INFO L82 PathProgramCache]: Analyzing trace with hash -672771200, now seen corresponding path program 280 times [2020-01-16 18:32:14,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:14,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099609951] [2020-01-16 18:32:14,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:14,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099609951] [2020-01-16 18:32:14,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:14,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:14,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010191452] [2020-01-16 18:32:14,795 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:14,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:14,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:14,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:14,796 INFO L87 Difference]: Start difference. First operand 198 states and 574 transitions. Second operand 8 states. [2020-01-16 18:32:14,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:14,871 INFO L93 Difference]: Finished difference Result 336 states and 832 transitions. [2020-01-16 18:32:14,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:14,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:14,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:14,872 INFO L225 Difference]: With dead ends: 336 [2020-01-16 18:32:14,872 INFO L226 Difference]: Without dead ends: 317 [2020-01-16 18:32:14,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-01-16 18:32:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-01-16 18:32:14,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 192. [2020-01-16 18:32:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 18:32:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 560 transitions. [2020-01-16 18:32:14,876 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 560 transitions. Word has length 19 [2020-01-16 18:32:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:14,876 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 560 transitions. [2020-01-16 18:32:14,876 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 560 transitions. [2020-01-16 18:32:14,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:14,877 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:14,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-01-16 18:32:14,877 INFO L426 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-01-16 18:32:14,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:14,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1980171160, now seen corresponding path program 281 times [2020-01-16 18:32:14,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:14,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44397118] [2020-01-16 18:32:14,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:15,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44397118] [2020-01-16 18:32:15,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:15,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:15,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471568381] [2020-01-16 18:32:15,081 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:15,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:15,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:15,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:15,082 INFO L87 Difference]: Start difference. First operand 192 states and 560 transitions. Second operand 8 states. [2020-01-16 18:32:15,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:15,144 INFO L93 Difference]: Finished difference Result 323 states and 804 transitions. [2020-01-16 18:32:15,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:15,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:15,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:15,145 INFO L225 Difference]: With dead ends: 323 [2020-01-16 18:32:15,145 INFO L226 Difference]: Without dead ends: 313 [2020-01-16 18:32:15,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:15,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-01-16 18:32:15,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 194. [2020-01-16 18:32:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-01-16 18:32:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 563 transitions. [2020-01-16 18:32:15,150 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 563 transitions. Word has length 19 [2020-01-16 18:32:15,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:15,150 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 563 transitions. [2020-01-16 18:32:15,150 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 563 transitions. [2020-01-16 18:32:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:15,150 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:15,151 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:15,151 INFO L426 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-01-16 18:32:15,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:15,151 INFO L82 PathProgramCache]: Analyzing trace with hash -490766164, now seen corresponding path program 282 times [2020-01-16 18:32:15,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:15,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490315597] [2020-01-16 18:32:15,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:15,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490315597] [2020-01-16 18:32:15,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:15,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:15,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286267699] [2020-01-16 18:32:15,340 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:15,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:15,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:15,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:15,341 INFO L87 Difference]: Start difference. First operand 194 states and 563 transitions. Second operand 8 states. [2020-01-16 18:32:15,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:15,418 INFO L93 Difference]: Finished difference Result 321 states and 799 transitions. [2020-01-16 18:32:15,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:15,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:15,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:15,419 INFO L225 Difference]: With dead ends: 321 [2020-01-16 18:32:15,419 INFO L226 Difference]: Without dead ends: 303 [2020-01-16 18:32:15,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-01-16 18:32:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-01-16 18:32:15,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 189. [2020-01-16 18:32:15,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 18:32:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 553 transitions. [2020-01-16 18:32:15,423 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 553 transitions. Word has length 19 [2020-01-16 18:32:15,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:15,423 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 553 transitions. [2020-01-16 18:32:15,424 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 553 transitions. [2020-01-16 18:32:15,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:15,424 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:15,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-01-16 18:32:15,424 INFO L426 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-01-16 18:32:15,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:15,424 INFO L82 PathProgramCache]: Analyzing trace with hash 504306274, now seen corresponding path program 283 times [2020-01-16 18:32:15,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:15,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108273511] [2020-01-16 18:32:15,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:15,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108273511] [2020-01-16 18:32:15,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:15,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:15,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928650695] [2020-01-16 18:32:15,620 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:15,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:15,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:15,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:15,621 INFO L87 Difference]: Start difference. First operand 189 states and 553 transitions. Second operand 8 states. [2020-01-16 18:32:15,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:15,702 INFO L93 Difference]: Finished difference Result 329 states and 825 transitions. [2020-01-16 18:32:15,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:15,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:15,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:15,703 INFO L225 Difference]: With dead ends: 329 [2020-01-16 18:32:15,703 INFO L226 Difference]: Without dead ends: 315 [2020-01-16 18:32:15,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:15,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-01-16 18:32:15,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 193. [2020-01-16 18:32:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-01-16 18:32:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 563 transitions. [2020-01-16 18:32:15,708 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 563 transitions. Word has length 19 [2020-01-16 18:32:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:15,708 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 563 transitions. [2020-01-16 18:32:15,709 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:15,709 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 563 transitions. [2020-01-16 18:32:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:15,709 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:15,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-01-16 18:32:15,709 INFO L426 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-01-16 18:32:15,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:15,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1624436104, now seen corresponding path program 284 times [2020-01-16 18:32:15,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:15,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229473770] [2020-01-16 18:32:15,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:15,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-01-16 18:32:15,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229473770] [2020-01-16 18:32:15,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:15,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:15,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669278582] [2020-01-16 18:32:15,929 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:15,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:15,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:15,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:15,930 INFO L87 Difference]: Start difference. First operand 193 states and 563 transitions. Second operand 8 states. [2020-01-16 18:32:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:15,999 INFO L93 Difference]: Finished difference Result 325 states and 814 transitions. [2020-01-16 18:32:16,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:16,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:16,001 INFO L225 Difference]: With dead ends: 325 [2020-01-16 18:32:16,001 INFO L226 Difference]: Without dead ends: 313 [2020-01-16 18:32:16,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-01-16 18:32:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-01-16 18:32:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 191. [2020-01-16 18:32:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 18:32:16,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 558 transitions. [2020-01-16 18:32:16,006 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 558 transitions. Word has length 19 [2020-01-16 18:32:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:16,007 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 558 transitions. [2020-01-16 18:32:16,007 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 558 transitions. [2020-01-16 18:32:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:16,007 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:16,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-01-16 18:32:16,007 INFO L426 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-01-16 18:32:16,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:16,008 INFO L82 PathProgramCache]: Analyzing trace with hash -568779106, now seen corresponding path program 285 times [2020-01-16 18:32:16,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:16,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693852267] [2020-01-16 18:32:16,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:16,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693852267] [2020-01-16 18:32:16,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:16,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:16,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735273683] [2020-01-16 18:32:16,231 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:16,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:16,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:16,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:16,232 INFO L87 Difference]: Start difference. First operand 191 states and 558 transitions. Second operand 8 states. [2020-01-16 18:32:16,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:16,316 INFO L93 Difference]: Finished difference Result 330 states and 825 transitions. [2020-01-16 18:32:16,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:16,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:16,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:16,318 INFO L225 Difference]: With dead ends: 330 [2020-01-16 18:32:16,318 INFO L226 Difference]: Without dead ends: 316 [2020-01-16 18:32:16,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-01-16 18:32:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-01-16 18:32:16,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 196. [2020-01-16 18:32:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-01-16 18:32:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 568 transitions. [2020-01-16 18:32:16,323 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 568 transitions. Word has length 19 [2020-01-16 18:32:16,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:16,323 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 568 transitions. [2020-01-16 18:32:16,323 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:16,323 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 568 transitions. [2020-01-16 18:32:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:16,324 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:16,324 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:16,324 INFO L426 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-01-16 18:32:16,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:16,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1210836024, now seen corresponding path program 286 times [2020-01-16 18:32:16,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:16,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587812704] [2020-01-16 18:32:16,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:16,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587812704] [2020-01-16 18:32:16,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:16,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:16,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888746180] [2020-01-16 18:32:16,520 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:16,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:16,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:16,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:16,520 INFO L87 Difference]: Start difference. First operand 196 states and 568 transitions. Second operand 8 states. [2020-01-16 18:32:16,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:16,614 INFO L93 Difference]: Finished difference Result 329 states and 818 transitions. [2020-01-16 18:32:16,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:16,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:16,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:16,616 INFO L225 Difference]: With dead ends: 329 [2020-01-16 18:32:16,616 INFO L226 Difference]: Without dead ends: 311 [2020-01-16 18:32:16,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:16,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-01-16 18:32:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 191. [2020-01-16 18:32:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 18:32:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 556 transitions. [2020-01-16 18:32:16,621 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 556 transitions. Word has length 19 [2020-01-16 18:32:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:16,621 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 556 transitions. [2020-01-16 18:32:16,621 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 556 transitions. [2020-01-16 18:32:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:16,622 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:16,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:16,622 INFO L426 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-01-16 18:32:16,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:16,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1594820036, now seen corresponding path program 287 times [2020-01-16 18:32:16,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:16,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373108570] [2020-01-16 18:32:16,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:16,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373108570] [2020-01-16 18:32:16,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:16,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:16,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999142241] [2020-01-16 18:32:16,839 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:16,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:16,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:16,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:16,839 INFO L87 Difference]: Start difference. First operand 191 states and 556 transitions. Second operand 8 states. [2020-01-16 18:32:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:16,913 INFO L93 Difference]: Finished difference Result 319 states and 795 transitions. [2020-01-16 18:32:16,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:16,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:16,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:16,914 INFO L225 Difference]: With dead ends: 319 [2020-01-16 18:32:16,914 INFO L226 Difference]: Without dead ends: 309 [2020-01-16 18:32:16,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:16,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2020-01-16 18:32:16,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 193. [2020-01-16 18:32:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-01-16 18:32:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 559 transitions. [2020-01-16 18:32:16,918 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 559 transitions. Word has length 19 [2020-01-16 18:32:16,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:16,918 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 559 transitions. [2020-01-16 18:32:16,919 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:16,919 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 559 transitions. [2020-01-16 18:32:16,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:16,919 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:16,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-01-16 18:32:16,919 INFO L426 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-01-16 18:32:16,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:16,919 INFO L82 PathProgramCache]: Analyzing trace with hash -105415040, now seen corresponding path program 288 times [2020-01-16 18:32:16,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:16,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128611834] [2020-01-16 18:32:16,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:17,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-01-16 18:32:17,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128611834] [2020-01-16 18:32:17,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:17,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:17,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062683258] [2020-01-16 18:32:17,114 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:17,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:17,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:17,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:17,115 INFO L87 Difference]: Start difference. First operand 193 states and 559 transitions. Second operand 8 states. [2020-01-16 18:32:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:17,193 INFO L93 Difference]: Finished difference Result 317 states and 790 transitions. [2020-01-16 18:32:17,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:17,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:17,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:17,194 INFO L225 Difference]: With dead ends: 317 [2020-01-16 18:32:17,194 INFO L226 Difference]: Without dead ends: 295 [2020-01-16 18:32:17,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-01-16 18:32:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-01-16 18:32:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2020-01-16 18:32:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-01-16 18:32:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 543 transitions. [2020-01-16 18:32:17,199 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 543 transitions. Word has length 19 [2020-01-16 18:32:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:17,199 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 543 transitions. [2020-01-16 18:32:17,199 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 543 transitions. [2020-01-16 18:32:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:17,200 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:17,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-01-16 18:32:17,200 INFO L426 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-01-16 18:32:17,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:17,200 INFO L82 PathProgramCache]: Analyzing trace with hash -907792650, now seen corresponding path program 289 times [2020-01-16 18:32:17,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:17,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598047067] [2020-01-16 18:32:17,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:17,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598047067] [2020-01-16 18:32:17,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:17,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:17,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243997397] [2020-01-16 18:32:17,404 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:17,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:17,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:17,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:17,405 INFO L87 Difference]: Start difference. First operand 184 states and 543 transitions. Second operand 8 states. [2020-01-16 18:32:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:17,466 INFO L93 Difference]: Finished difference Result 330 states and 816 transitions. [2020-01-16 18:32:17,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:17,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:17,467 INFO L225 Difference]: With dead ends: 330 [2020-01-16 18:32:17,467 INFO L226 Difference]: Without dead ends: 314 [2020-01-16 18:32:17,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-01-16 18:32:17,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-01-16 18:32:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 199. [2020-01-16 18:32:17,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-01-16 18:32:17,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 580 transitions. [2020-01-16 18:32:17,472 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 580 transitions. Word has length 19 [2020-01-16 18:32:17,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:17,472 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 580 transitions. [2020-01-16 18:32:17,472 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:17,472 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 580 transitions. [2020-01-16 18:32:17,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:17,472 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:17,473 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:17,473 INFO L426 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-01-16 18:32:17,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:17,473 INFO L82 PathProgramCache]: Analyzing trace with hash -533141464, now seen corresponding path program 290 times [2020-01-16 18:32:17,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:17,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722365211] [2020-01-16 18:32:17,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:17,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:17,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722365211] [2020-01-16 18:32:17,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:17,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:17,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137667533] [2020-01-16 18:32:17,673 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:17,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:17,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:17,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:17,674 INFO L87 Difference]: Start difference. First operand 199 states and 580 transitions. Second operand 8 states. [2020-01-16 18:32:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:17,769 INFO L93 Difference]: Finished difference Result 328 states and 806 transitions. [2020-01-16 18:32:17,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:17,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:17,770 INFO L225 Difference]: With dead ends: 328 [2020-01-16 18:32:17,770 INFO L226 Difference]: Without dead ends: 306 [2020-01-16 18:32:17,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-01-16 18:32:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 191. [2020-01-16 18:32:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 18:32:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 562 transitions. [2020-01-16 18:32:17,775 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 562 transitions. Word has length 19 [2020-01-16 18:32:17,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:17,775 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 562 transitions. [2020-01-16 18:32:17,775 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 562 transitions. [2020-01-16 18:32:17,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:17,776 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:17,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-01-16 18:32:17,776 INFO L426 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-01-16 18:32:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:17,776 INFO L82 PathProgramCache]: Analyzing trace with hash -703191568, now seen corresponding path program 291 times [2020-01-16 18:32:17,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:17,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543687324] [2020-01-16 18:32:17,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:17,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543687324] [2020-01-16 18:32:17,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:17,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:17,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734911676] [2020-01-16 18:32:17,973 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:17,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:17,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:17,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:17,973 INFO L87 Difference]: Start difference. First operand 191 states and 562 transitions. Second operand 8 states. [2020-01-16 18:32:18,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:18,047 INFO L93 Difference]: Finished difference Result 321 states and 789 transitions. [2020-01-16 18:32:18,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:18,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:18,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:18,048 INFO L225 Difference]: With dead ends: 321 [2020-01-16 18:32:18,048 INFO L226 Difference]: Without dead ends: 305 [2020-01-16 18:32:18,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-01-16 18:32:18,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 194. [2020-01-16 18:32:18,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-01-16 18:32:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 566 transitions. [2020-01-16 18:32:18,053 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 566 transitions. Word has length 19 [2020-01-16 18:32:18,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:18,054 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 566 transitions. [2020-01-16 18:32:18,054 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 566 transitions. [2020-01-16 18:32:18,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:18,054 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:18,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-01-16 18:32:18,054 INFO L426 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-01-16 18:32:18,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:18,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1440049182, now seen corresponding path program 292 times [2020-01-16 18:32:18,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:18,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943790101] [2020-01-16 18:32:18,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:18,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-01-16 18:32:18,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943790101] [2020-01-16 18:32:18,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:18,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:18,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357689850] [2020-01-16 18:32:18,254 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:18,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:18,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:18,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:18,254 INFO L87 Difference]: Start difference. First operand 194 states and 566 transitions. Second operand 8 states. [2020-01-16 18:32:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:18,342 INFO L93 Difference]: Finished difference Result 315 states and 774 transitions. [2020-01-16 18:32:18,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:18,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:18,343 INFO L225 Difference]: With dead ends: 315 [2020-01-16 18:32:18,343 INFO L226 Difference]: Without dead ends: 302 [2020-01-16 18:32:18,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-01-16 18:32:18,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-01-16 18:32:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 191. [2020-01-16 18:32:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 18:32:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 559 transitions. [2020-01-16 18:32:18,348 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 559 transitions. Word has length 19 [2020-01-16 18:32:18,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:18,348 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 559 transitions. [2020-01-16 18:32:18,348 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:18,348 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 559 transitions. [2020-01-16 18:32:18,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:18,349 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:18,349 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:18,349 INFO L426 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-01-16 18:32:18,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:18,349 INFO L82 PathProgramCache]: Analyzing trace with hash -2101207602, now seen corresponding path program 293 times [2020-01-16 18:32:18,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:18,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055979343] [2020-01-16 18:32:18,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:18,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-01-16 18:32:18,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055979343] [2020-01-16 18:32:18,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:18,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:18,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992016517] [2020-01-16 18:32:18,548 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:18,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:18,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:18,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:18,548 INFO L87 Difference]: Start difference. First operand 191 states and 559 transitions. Second operand 8 states. [2020-01-16 18:32:18,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:18,626 INFO L93 Difference]: Finished difference Result 316 states and 778 transitions. [2020-01-16 18:32:18,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:18,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:18,627 INFO L225 Difference]: With dead ends: 316 [2020-01-16 18:32:18,627 INFO L226 Difference]: Without dead ends: 302 [2020-01-16 18:32:18,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-01-16 18:32:18,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-01-16 18:32:18,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 193. [2020-01-16 18:32:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-01-16 18:32:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 562 transitions. [2020-01-16 18:32:18,632 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 562 transitions. Word has length 19 [2020-01-16 18:32:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:18,633 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 562 transitions. [2020-01-16 18:32:18,633 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 562 transitions. [2020-01-16 18:32:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:18,633 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:18,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-01-16 18:32:18,633 INFO L426 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-01-16 18:32:18,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:18,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1319424368, now seen corresponding path program 294 times [2020-01-16 18:32:18,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:18,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961052351] [2020-01-16 18:32:18,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:18,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:18,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961052351] [2020-01-16 18:32:18,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:18,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:18,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838426176] [2020-01-16 18:32:18,822 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:18,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:18,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:18,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:18,823 INFO L87 Difference]: Start difference. First operand 193 states and 562 transitions. Second operand 8 states. [2020-01-16 18:32:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:18,902 INFO L93 Difference]: Finished difference Result 312 states and 767 transitions. [2020-01-16 18:32:18,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:18,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:18,903 INFO L225 Difference]: With dead ends: 312 [2020-01-16 18:32:18,903 INFO L226 Difference]: Without dead ends: 296 [2020-01-16 18:32:18,903 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-01-16 18:32:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 187. [2020-01-16 18:32:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 18:32:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 551 transitions. [2020-01-16 18:32:18,908 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 551 transitions. Word has length 19 [2020-01-16 18:32:18,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:18,908 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 551 transitions. [2020-01-16 18:32:18,908 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 551 transitions. [2020-01-16 18:32:18,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:18,909 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:18,909 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:18,909 INFO L426 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-01-16 18:32:18,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:18,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1330278376, now seen corresponding path program 295 times [2020-01-16 18:32:18,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:18,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898590229] [2020-01-16 18:32:18,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:19,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898590229] [2020-01-16 18:32:19,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:19,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:19,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646318535] [2020-01-16 18:32:19,148 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:19,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:19,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:19,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:19,148 INFO L87 Difference]: Start difference. First operand 187 states and 551 transitions. Second operand 8 states. [2020-01-16 18:32:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:19,209 INFO L93 Difference]: Finished difference Result 318 states and 780 transitions. [2020-01-16 18:32:19,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:19,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:19,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:19,210 INFO L225 Difference]: With dead ends: 318 [2020-01-16 18:32:19,210 INFO L226 Difference]: Without dead ends: 302 [2020-01-16 18:32:19,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-01-16 18:32:19,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-01-16 18:32:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 199. [2020-01-16 18:32:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-01-16 18:32:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 577 transitions. [2020-01-16 18:32:19,215 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 577 transitions. Word has length 19 [2020-01-16 18:32:19,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:19,215 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 577 transitions. [2020-01-16 18:32:19,215 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:19,215 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 577 transitions. [2020-01-16 18:32:19,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:19,215 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:19,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-01-16 18:32:19,216 INFO L426 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-01-16 18:32:19,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:19,216 INFO L82 PathProgramCache]: Analyzing trace with hash -955627190, now seen corresponding path program 296 times [2020-01-16 18:32:19,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:19,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708558392] [2020-01-16 18:32:19,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:19,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708558392] [2020-01-16 18:32:19,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:19,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:19,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67655558] [2020-01-16 18:32:19,427 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:19,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:19,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:19,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:19,427 INFO L87 Difference]: Start difference. First operand 199 states and 577 transitions. Second operand 8 states. [2020-01-16 18:32:19,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:19,502 INFO L93 Difference]: Finished difference Result 316 states and 770 transitions. [2020-01-16 18:32:19,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:19,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:19,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:19,503 INFO L225 Difference]: With dead ends: 316 [2020-01-16 18:32:19,503 INFO L226 Difference]: Without dead ends: 294 [2020-01-16 18:32:19,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-01-16 18:32:19,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-01-16 18:32:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 191. [2020-01-16 18:32:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 18:32:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 559 transitions. [2020-01-16 18:32:19,509 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 559 transitions. Word has length 19 [2020-01-16 18:32:19,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:19,509 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 559 transitions. [2020-01-16 18:32:19,509 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 559 transitions. [2020-01-16 18:32:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:19,510 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:19,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-01-16 18:32:19,510 INFO L426 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-01-16 18:32:19,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:19,510 INFO L82 PathProgramCache]: Analyzing trace with hash -800081070, now seen corresponding path program 297 times [2020-01-16 18:32:19,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:19,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796123667] [2020-01-16 18:32:19,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:19,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796123667] [2020-01-16 18:32:19,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:19,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:19,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651346514] [2020-01-16 18:32:19,718 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:19,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:19,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:19,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:19,719 INFO L87 Difference]: Start difference. First operand 191 states and 559 transitions. Second operand 8 states. [2020-01-16 18:32:19,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:19,793 INFO L93 Difference]: Finished difference Result 301 states and 738 transitions. [2020-01-16 18:32:19,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:19,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:19,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:19,794 INFO L225 Difference]: With dead ends: 301 [2020-01-16 18:32:19,794 INFO L226 Difference]: Without dead ends: 285 [2020-01-16 18:32:19,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-01-16 18:32:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 194. [2020-01-16 18:32:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-01-16 18:32:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 563 transitions. [2020-01-16 18:32:19,800 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 563 transitions. Word has length 19 [2020-01-16 18:32:19,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:19,800 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 563 transitions. [2020-01-16 18:32:19,800 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:19,800 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 563 transitions. [2020-01-16 18:32:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:19,800 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:19,800 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:19,800 INFO L426 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-01-16 18:32:19,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:19,801 INFO L82 PathProgramCache]: Analyzing trace with hash -541022844, now seen corresponding path program 298 times [2020-01-16 18:32:19,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:19,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550642593] [2020-01-16 18:32:19,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:20,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-01-16 18:32:20,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550642593] [2020-01-16 18:32:20,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:20,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:20,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270995614] [2020-01-16 18:32:20,006 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:20,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:20,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:20,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:20,007 INFO L87 Difference]: Start difference. First operand 194 states and 563 transitions. Second operand 8 states. [2020-01-16 18:32:20,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:20,066 INFO L93 Difference]: Finished difference Result 286 states and 714 transitions. [2020-01-16 18:32:20,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:20,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:20,067 INFO L225 Difference]: With dead ends: 286 [2020-01-16 18:32:20,067 INFO L226 Difference]: Without dead ends: 273 [2020-01-16 18:32:20,067 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-01-16 18:32:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 191. [2020-01-16 18:32:20,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 18:32:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 556 transitions. [2020-01-16 18:32:20,072 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 556 transitions. Word has length 19 [2020-01-16 18:32:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:20,072 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 556 transitions. [2020-01-16 18:32:20,072 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:20,072 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 556 transitions. [2020-01-16 18:32:20,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:20,072 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:20,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-01-16 18:32:20,073 INFO L426 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-01-16 18:32:20,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:20,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1122224650, now seen corresponding path program 299 times [2020-01-16 18:32:20,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:20,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436534345] [2020-01-16 18:32:20,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:20,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436534345] [2020-01-16 18:32:20,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:20,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:20,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602460840] [2020-01-16 18:32:20,267 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:20,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:20,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:20,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:20,268 INFO L87 Difference]: Start difference. First operand 191 states and 556 transitions. Second operand 8 states. [2020-01-16 18:32:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:20,349 INFO L93 Difference]: Finished difference Result 298 states and 730 transitions. [2020-01-16 18:32:20,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:20,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:20,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:20,350 INFO L225 Difference]: With dead ends: 298 [2020-01-16 18:32:20,350 INFO L226 Difference]: Without dead ends: 284 [2020-01-16 18:32:20,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-01-16 18:32:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 193. [2020-01-16 18:32:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-01-16 18:32:20,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 559 transitions. [2020-01-16 18:32:20,355 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 559 transitions. Word has length 19 [2020-01-16 18:32:20,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:20,356 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 559 transitions. [2020-01-16 18:32:20,356 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:20,356 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 559 transitions. [2020-01-16 18:32:20,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:20,356 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:20,356 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:20,356 INFO L426 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-01-16 18:32:20,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:20,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2052612816, now seen corresponding path program 300 times [2020-01-16 18:32:20,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:20,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402371617] [2020-01-16 18:32:20,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:20,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402371617] [2020-01-16 18:32:20,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:20,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:20,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650159169] [2020-01-16 18:32:20,561 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:20,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:20,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:20,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:20,562 INFO L87 Difference]: Start difference. First operand 193 states and 559 transitions. Second operand 8 states. [2020-01-16 18:32:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:20,630 INFO L93 Difference]: Finished difference Result 285 states and 710 transitions. [2020-01-16 18:32:20,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:20,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:20,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:20,631 INFO L225 Difference]: With dead ends: 285 [2020-01-16 18:32:20,631 INFO L226 Difference]: Without dead ends: 269 [2020-01-16 18:32:20,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-01-16 18:32:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-01-16 18:32:20,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 187. [2020-01-16 18:32:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 18:32:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 548 transitions. [2020-01-16 18:32:20,636 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 548 transitions. Word has length 19 [2020-01-16 18:32:20,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:20,637 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 548 transitions. [2020-01-16 18:32:20,637 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 548 transitions. [2020-01-16 18:32:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:20,637 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:20,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:20,637 INFO L426 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-01-16 18:32:20,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:20,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1446944266, now seen corresponding path program 301 times [2020-01-16 18:32:20,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:20,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866725053] [2020-01-16 18:32:20,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:20,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866725053] [2020-01-16 18:32:20,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:20,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:20,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001668002] [2020-01-16 18:32:20,827 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:20,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:20,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:20,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:20,827 INFO L87 Difference]: Start difference. First operand 187 states and 548 transitions. Second operand 8 states. [2020-01-16 18:32:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:20,900 INFO L93 Difference]: Finished difference Result 294 states and 721 transitions. [2020-01-16 18:32:20,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:20,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:20,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:20,901 INFO L225 Difference]: With dead ends: 294 [2020-01-16 18:32:20,901 INFO L226 Difference]: Without dead ends: 278 [2020-01-16 18:32: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-01-16 18:32:20,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-01-16 18:32:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 192. [2020-01-16 18:32:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 18:32:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 558 transitions. [2020-01-16 18:32:20,906 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 558 transitions. Word has length 19 [2020-01-16 18:32:20,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:20,907 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 558 transitions. [2020-01-16 18:32:20,907 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 558 transitions. [2020-01-16 18:32:20,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:20,907 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:20,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-01-16 18:32:20,907 INFO L426 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-01-16 18:32:20,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:20,907 INFO L82 PathProgramCache]: Analyzing trace with hash 696296484, now seen corresponding path program 302 times [2020-01-16 18:32:20,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:20,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399202718] [2020-01-16 18:32:20,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:21,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399202718] [2020-01-16 18:32:21,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:21,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:21,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094565327] [2020-01-16 18:32:21,100 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:21,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:21,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:21,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:21,100 INFO L87 Difference]: Start difference. First operand 192 states and 558 transitions. Second operand 8 states. [2020-01-16 18:32:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:21,194 INFO L93 Difference]: Finished difference Result 288 states and 706 transitions. [2020-01-16 18:32:21,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:21,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:21,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:21,195 INFO L225 Difference]: With dead ends: 288 [2020-01-16 18:32:21,195 INFO L226 Difference]: Without dead ends: 275 [2020-01-16 18:32:21,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-01-16 18:32:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-01-16 18:32:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 189. [2020-01-16 18:32:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 18:32:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 552 transitions. [2020-01-16 18:32:21,200 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 552 transitions. Word has length 19 [2020-01-16 18:32:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:21,200 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 552 transitions. [2020-01-16 18:32:21,200 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 552 transitions. [2020-01-16 18:32:21,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:21,200 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:21,201 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:21,201 INFO L426 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-01-16 18:32:21,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:21,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1247585176, now seen corresponding path program 303 times [2020-01-16 18:32:21,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:21,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272850198] [2020-01-16 18:32:21,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:21,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272850198] [2020-01-16 18:32:21,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:21,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:21,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794811079] [2020-01-16 18:32:21,403 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:21,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:21,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:21,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:21,404 INFO L87 Difference]: Start difference. First operand 189 states and 552 transitions. Second operand 8 states. [2020-01-16 18:32:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:21,478 INFO L93 Difference]: Finished difference Result 283 states and 697 transitions. [2020-01-16 18:32:21,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:21,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:21,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:21,479 INFO L225 Difference]: With dead ends: 283 [2020-01-16 18:32:21,479 INFO L226 Difference]: Without dead ends: 267 [2020-01-16 18:32:21,479 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-01-16 18:32:21,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 192. [2020-01-16 18:32:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 18:32:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 556 transitions. [2020-01-16 18:32:21,483 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 556 transitions. Word has length 19 [2020-01-16 18:32:21,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:21,483 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 556 transitions. [2020-01-16 18:32:21,483 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 556 transitions. [2020-01-16 18:32:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:21,484 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:21,484 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:21,484 INFO L426 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-01-16 18:32:21,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:21,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1506643402, now seen corresponding path program 304 times [2020-01-16 18:32:21,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:21,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494752003] [2020-01-16 18:32:21,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:21,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494752003] [2020-01-16 18:32:21,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:21,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:21,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685448971] [2020-01-16 18:32:21,704 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:21,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:21,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:21,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:21,705 INFO L87 Difference]: Start difference. First operand 192 states and 556 transitions. Second operand 8 states. [2020-01-16 18:32:21,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:21,766 INFO L93 Difference]: Finished difference Result 268 states and 673 transitions. [2020-01-16 18:32:21,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:21,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:21,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:21,767 INFO L225 Difference]: With dead ends: 268 [2020-01-16 18:32:21,767 INFO L226 Difference]: Without dead ends: 255 [2020-01-16 18:32:21,767 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:21,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-01-16 18:32:21,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 189. [2020-01-16 18:32:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 18:32:21,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 550 transitions. [2020-01-16 18:32:21,773 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 550 transitions. Word has length 19 [2020-01-16 18:32:21,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:21,773 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 550 transitions. [2020-01-16 18:32:21,773 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 550 transitions. [2020-01-16 18:32:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:21,773 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:21,774 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:21,774 INFO L426 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-01-16 18:32:21,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:21,774 INFO L82 PathProgramCache]: Analyzing trace with hash 266205080, now seen corresponding path program 305 times [2020-01-16 18:32:21,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:21,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871266412] [2020-01-16 18:32:21,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:21,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871266412] [2020-01-16 18:32:21,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:21,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:21,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964730373] [2020-01-16 18:32:21,977 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:21,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:21,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:21,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:21,977 INFO L87 Difference]: Start difference. First operand 189 states and 550 transitions. Second operand 8 states. [2020-01-16 18:32:22,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:22,052 INFO L93 Difference]: Finished difference Result 266 states and 669 transitions. [2020-01-16 18:32:22,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:22,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:22,053 INFO L225 Difference]: With dead ends: 266 [2020-01-16 18:32:22,053 INFO L226 Difference]: Without dead ends: 256 [2020-01-16 18:32:22,054 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:22,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-01-16 18:32:22,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 190. [2020-01-16 18:32:22,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-01-16 18:32:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 551 transitions. [2020-01-16 18:32:22,059 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 551 transitions. Word has length 19 [2020-01-16 18:32:22,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:22,060 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 551 transitions. [2020-01-16 18:32:22,060 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:22,060 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 551 transitions. [2020-01-16 18:32:22,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:22,060 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:22,060 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:22,060 INFO L426 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-01-16 18:32:22,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:22,061 INFO L82 PathProgramCache]: Analyzing trace with hash 26562742, now seen corresponding path program 306 times [2020-01-16 18:32:22,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:22,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883373056] [2020-01-16 18:32:22,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:22,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883373056] [2020-01-16 18:32:22,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:22,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:22,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844166825] [2020-01-16 18:32:22,288 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:22,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:22,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:22,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:22,288 INFO L87 Difference]: Start difference. First operand 190 states and 551 transitions. Second operand 8 states. [2020-01-16 18:32:22,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:22,338 INFO L93 Difference]: Finished difference Result 255 states and 656 transitions. [2020-01-16 18:32:22,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:22,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:22,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:22,339 INFO L225 Difference]: With dead ends: 255 [2020-01-16 18:32:22,339 INFO L226 Difference]: Without dead ends: 242 [2020-01-16 18:32:22,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:22,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-01-16 18:32:22,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 187. [2020-01-16 18:32:22,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 18:32:22,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 546 transitions. [2020-01-16 18:32:22,345 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 546 transitions. Word has length 19 [2020-01-16 18:32:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:22,346 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 546 transitions. [2020-01-16 18:32:22,346 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 546 transitions. [2020-01-16 18:32:22,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:22,347 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:22,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:22,347 INFO L426 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-01-16 18:32:22,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:22,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1887873640, now seen corresponding path program 307 times [2020-01-16 18:32:22,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:22,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320280806] [2020-01-16 18:32:22,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:22,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320280806] [2020-01-16 18:32:22,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:22,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:22,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804065023] [2020-01-16 18:32:22,551 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:22,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:22,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:22,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:22,552 INFO L87 Difference]: Start difference. First operand 187 states and 546 transitions. Second operand 8 states. [2020-01-16 18:32:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:22,630 INFO L93 Difference]: Finished difference Result 287 states and 706 transitions. [2020-01-16 18:32:22,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:22,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:22,631 INFO L225 Difference]: With dead ends: 287 [2020-01-16 18:32:22,631 INFO L226 Difference]: Without dead ends: 273 [2020-01-16 18:32:22,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-01-16 18:32:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-01-16 18:32:22,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 190. [2020-01-16 18:32:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-01-16 18:32:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 552 transitions. [2020-01-16 18:32:22,635 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 552 transitions. Word has length 19 [2020-01-16 18:32:22,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:22,635 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 552 transitions. [2020-01-16 18:32:22,635 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:22,635 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 552 transitions. [2020-01-16 18:32:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:22,636 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:22,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-01-16 18:32:22,636 INFO L426 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-01-16 18:32:22,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:22,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1013538314, now seen corresponding path program 308 times [2020-01-16 18:32:22,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:22,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797262039] [2020-01-16 18:32:22,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:22,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-01-16 18:32:22,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797262039] [2020-01-16 18:32:22,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:22,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:22,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664761843] [2020-01-16 18:32:22,822 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:22,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:22,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:22,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:22,823 INFO L87 Difference]: Start difference. First operand 190 states and 552 transitions. Second operand 8 states. [2020-01-16 18:32:22,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:22,910 INFO L93 Difference]: Finished difference Result 283 states and 695 transitions. [2020-01-16 18:32:22,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:22,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:22,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:22,911 INFO L225 Difference]: With dead ends: 283 [2020-01-16 18:32:22,911 INFO L226 Difference]: Without dead ends: 271 [2020-01-16 18:32:22,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-01-16 18:32:22,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-01-16 18:32:22,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 188. [2020-01-16 18:32:22,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 18:32:22,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 548 transitions. [2020-01-16 18:32:22,916 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 548 transitions. Word has length 19 [2020-01-16 18:32:22,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:22,916 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 548 transitions. [2020-01-16 18:32:22,916 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 548 transitions. [2020-01-16 18:32:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:22,916 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:22,917 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:22,917 INFO L426 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-01-16 18:32:22,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:22,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1246071542, now seen corresponding path program 309 times [2020-01-16 18:32:22,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:22,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686481870] [2020-01-16 18:32:22,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:23,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686481870] [2020-01-16 18:32:23,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:23,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:23,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720998930] [2020-01-16 18:32:23,107 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:23,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:23,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:23,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:23,107 INFO L87 Difference]: Start difference. First operand 188 states and 548 transitions. Second operand 8 states. [2020-01-16 18:32:23,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:23,184 INFO L93 Difference]: Finished difference Result 279 states and 688 transitions. [2020-01-16 18:32:23,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:23,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:23,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:23,185 INFO L225 Difference]: With dead ends: 279 [2020-01-16 18:32:23,185 INFO L226 Difference]: Without dead ends: 265 [2020-01-16 18:32:23,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-01-16 18:32:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-01-16 18:32:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 190. [2020-01-16 18:32:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-01-16 18:32:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 551 transitions. [2020-01-16 18:32:23,189 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 551 transitions. Word has length 19 [2020-01-16 18:32:23,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:23,189 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 551 transitions. [2020-01-16 18:32:23,189 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:23,189 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 551 transitions. [2020-01-16 18:32:23,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:23,190 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:23,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-01-16 18:32:23,190 INFO L426 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-01-16 18:32:23,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:23,190 INFO L82 PathProgramCache]: Analyzing trace with hash -125941712, now seen corresponding path program 310 times [2020-01-16 18:32:23,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:23,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481569882] [2020-01-16 18:32:23,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:23,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481569882] [2020-01-16 18:32:23,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:23,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:23,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879335788] [2020-01-16 18:32:23,385 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:23,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:23,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:23,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:23,385 INFO L87 Difference]: Start difference. First operand 190 states and 551 transitions. Second operand 8 states. [2020-01-16 18:32:23,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:23,464 INFO L93 Difference]: Finished difference Result 266 states and 668 transitions. [2020-01-16 18:32:23,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:23,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:23,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:23,465 INFO L225 Difference]: With dead ends: 266 [2020-01-16 18:32:23,466 INFO L226 Difference]: Without dead ends: 254 [2020-01-16 18:32:23,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:23,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-01-16 18:32:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 188. [2020-01-16 18:32:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 18:32:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 547 transitions. [2020-01-16 18:32:23,471 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 547 transitions. Word has length 19 [2020-01-16 18:32:23,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:23,471 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 547 transitions. [2020-01-16 18:32:23,471 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 547 transitions. [2020-01-16 18:32:23,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:23,471 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:23,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-01-16 18:32:23,472 INFO L426 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-01-16 18:32:23,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:23,472 INFO L82 PathProgramCache]: Analyzing trace with hash 651556204, now seen corresponding path program 311 times [2020-01-16 18:32:23,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:23,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009939469] [2020-01-16 18:32:23,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:23,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009939469] [2020-01-16 18:32:23,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:23,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:23,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931604240] [2020-01-16 18:32:23,679 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:23,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:23,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:23,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:23,680 INFO L87 Difference]: Start difference. First operand 188 states and 547 transitions. Second operand 8 states. [2020-01-16 18:32:23,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:23,770 INFO L93 Difference]: Finished difference Result 265 states and 666 transitions. [2020-01-16 18:32:23,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:23,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:23,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:23,771 INFO L225 Difference]: With dead ends: 265 [2020-01-16 18:32:23,772 INFO L226 Difference]: Without dead ends: 255 [2020-01-16 18:32:23,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-01-16 18:32:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-01-16 18:32:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 189. [2020-01-16 18:32:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 18:32:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 548 transitions. [2020-01-16 18:32:23,776 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 548 transitions. Word has length 19 [2020-01-16 18:32:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:23,776 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 548 transitions. [2020-01-16 18:32:23,776 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 548 transitions. [2020-01-16 18:32:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:23,777 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:23,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-01-16 18:32:23,777 INFO L426 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-01-16 18:32:23,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:23,777 INFO L82 PathProgramCache]: Analyzing trace with hash 411913866, now seen corresponding path program 312 times [2020-01-16 18:32:23,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:23,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378523827] [2020-01-16 18:32:23,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:23,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378523827] [2020-01-16 18:32:23,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:23,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:23,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075935161] [2020-01-16 18:32:23,989 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:23,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:23,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:23,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:23,989 INFO L87 Difference]: Start difference. First operand 189 states and 548 transitions. Second operand 8 states. [2020-01-16 18:32:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:24,064 INFO L93 Difference]: Finished difference Result 254 states and 653 transitions. [2020-01-16 18:32:24,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:24,064 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:24,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:24,065 INFO L225 Difference]: With dead ends: 254 [2020-01-16 18:32:24,065 INFO L226 Difference]: Without dead ends: 239 [2020-01-16 18:32:24,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:24,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-01-16 18:32:24,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 184. [2020-01-16 18:32:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-01-16 18:32:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 540 transitions. [2020-01-16 18:32:24,069 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 540 transitions. Word has length 19 [2020-01-16 18:32:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:24,069 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 540 transitions. [2020-01-16 18:32:24,069 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 540 transitions. [2020-01-16 18:32:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:24,070 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:24,070 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:24,070 INFO L426 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-01-16 18:32:24,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:24,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2756816, now seen corresponding path program 313 times [2020-01-16 18:32:24,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:24,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470690192] [2020-01-16 18:32:24,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:24,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470690192] [2020-01-16 18:32:24,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:24,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:24,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096409348] [2020-01-16 18:32:24,264 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:24,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:24,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:24,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:24,265 INFO L87 Difference]: Start difference. First operand 184 states and 540 transitions. Second operand 8 states. [2020-01-16 18:32:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:24,326 INFO L93 Difference]: Finished difference Result 315 states and 778 transitions. [2020-01-16 18:32:24,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:24,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:24,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:24,328 INFO L225 Difference]: With dead ends: 315 [2020-01-16 18:32:24,328 INFO L226 Difference]: Without dead ends: 299 [2020-01-16 18:32:24,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:24,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-01-16 18:32:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 191. [2020-01-16 18:32:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 18:32:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 558 transitions. [2020-01-16 18:32:24,333 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 558 transitions. Word has length 19 [2020-01-16 18:32:24,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:24,333 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 558 transitions. [2020-01-16 18:32:24,334 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 558 transitions. [2020-01-16 18:32:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:24,334 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:24,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-01-16 18:32:24,334 INFO L426 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-01-16 18:32:24,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:24,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2140483934, now seen corresponding path program 314 times [2020-01-16 18:32:24,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:24,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452110994] [2020-01-16 18:32:24,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:24,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452110994] [2020-01-16 18:32:24,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:24,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:24,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512633154] [2020-01-16 18:32:24,533 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:24,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:24,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:24,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:24,533 INFO L87 Difference]: Start difference. First operand 191 states and 558 transitions. Second operand 8 states. [2020-01-16 18:32:24,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:24,622 INFO L93 Difference]: Finished difference Result 309 states and 763 transitions. [2020-01-16 18:32:24,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:24,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:24,623 INFO L225 Difference]: With dead ends: 309 [2020-01-16 18:32:24,623 INFO L226 Difference]: Without dead ends: 296 [2020-01-16 18:32:24,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-01-16 18:32:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-01-16 18:32:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 188. [2020-01-16 18:32:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 18:32:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 552 transitions. [2020-01-16 18:32:24,628 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 552 transitions. Word has length 19 [2020-01-16 18:32:24,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:24,629 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 552 transitions. [2020-01-16 18:32:24,629 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:24,629 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 552 transitions. [2020-01-16 18:32:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:24,629 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32: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-01-16 18:32:24,629 INFO L426 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-01-16 18:32:24,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:24,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1603194670, now seen corresponding path program 315 times [2020-01-16 18:32:24,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:24,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351482352] [2020-01-16 18:32:24,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:24,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351482352] [2020-01-16 18:32:24,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:24,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:24,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234656497] [2020-01-16 18:32:24,824 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:24,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:24,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:24,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:24,825 INFO L87 Difference]: Start difference. First operand 188 states and 552 transitions. Second operand 8 states. [2020-01-16 18:32:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:24,885 INFO L93 Difference]: Finished difference Result 315 states and 776 transitions. [2020-01-16 18:32:24,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:24,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:24,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:24,887 INFO L225 Difference]: With dead ends: 315 [2020-01-16 18:32:24,887 INFO L226 Difference]: Without dead ends: 299 [2020-01-16 18:32:24,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-01-16 18:32:24,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-01-16 18:32:24,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 191. [2020-01-16 18:32:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 18:32:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 556 transitions. [2020-01-16 18:32:24,891 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 556 transitions. Word has length 19 [2020-01-16 18:32:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:24,891 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 556 transitions. [2020-01-16 18:32:24,891 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:24,891 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 556 transitions. [2020-01-16 18:32:24,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:24,892 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:24,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-01-16 18:32:24,892 INFO L426 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-01-16 18:32:24,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:24,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1344136444, now seen corresponding path program 316 times [2020-01-16 18:32:24,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:24,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128939026] [2020-01-16 18:32:24,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:25,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128939026] [2020-01-16 18:32:25,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:25,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:25,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615262521] [2020-01-16 18:32:25,090 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:25,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:25,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:25,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:25,091 INFO L87 Difference]: Start difference. First operand 191 states and 556 transitions. Second operand 8 states. [2020-01-16 18:32:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:25,157 INFO L93 Difference]: Finished difference Result 309 states and 761 transitions. [2020-01-16 18:32:25,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:25,157 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:25,158 INFO L225 Difference]: With dead ends: 309 [2020-01-16 18:32:25,158 INFO L226 Difference]: Without dead ends: 296 [2020-01-16 18:32:25,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-01-16 18:32:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-01-16 18:32:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 188. [2020-01-16 18:32:25,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 18:32:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 550 transitions. [2020-01-16 18:32:25,163 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 550 transitions. Word has length 19 [2020-01-16 18:32:25,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:25,163 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 550 transitions. [2020-01-16 18:32:25,163 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:25,163 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 550 transitions. [2020-01-16 18:32:25,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:25,163 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:25,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-01-16 18:32:25,164 INFO L426 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-01-16 18:32:25,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:25,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1710392530, now seen corresponding path program 317 times [2020-01-16 18:32:25,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:25,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520945129] [2020-01-16 18:32:25,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:25,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520945129] [2020-01-16 18:32:25,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:25,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:25,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763197559] [2020-01-16 18:32:25,365 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:25,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:25,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:25,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:25,366 INFO L87 Difference]: Start difference. First operand 188 states and 550 transitions. Second operand 8 states. [2020-01-16 18:32:25,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:25,458 INFO L93 Difference]: Finished difference Result 301 states and 745 transitions. [2020-01-16 18:32:25,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:25,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:25,459 INFO L225 Difference]: With dead ends: 301 [2020-01-16 18:32:25,459 INFO L226 Difference]: Without dead ends: 291 [2020-01-16 18:32:25,459 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-01-16 18:32:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 189. [2020-01-16 18:32:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 18:32:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 551 transitions. [2020-01-16 18:32:25,464 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 551 transitions. Word has length 19 [2020-01-16 18:32:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:25,464 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 551 transitions. [2020-01-16 18:32:25,465 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 551 transitions. [2020-01-16 18:32:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:25,465 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:25,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-01-16 18:32:25,465 INFO L426 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-01-16 18:32:25,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:25,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1470750192, now seen corresponding path program 318 times [2020-01-16 18:32:25,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:25,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222141514] [2020-01-16 18:32:25,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:25,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222141514] [2020-01-16 18:32:25,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:25,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:25,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040725108] [2020-01-16 18:32:25,677 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:25,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:25,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:25,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:25,678 INFO L87 Difference]: Start difference. First operand 189 states and 551 transitions. Second operand 8 states. [2020-01-16 18:32:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:25,747 INFO L93 Difference]: Finished difference Result 301 states and 744 transitions. [2020-01-16 18:32:25,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:25,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:25,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:25,748 INFO L225 Difference]: With dead ends: 301 [2020-01-16 18:32:25,748 INFO L226 Difference]: Without dead ends: 288 [2020-01-16 18:32:25,748 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-01-16 18:32:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 186. [2020-01-16 18:32:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 18:32:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 546 transitions. [2020-01-16 18:32:25,753 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 546 transitions. Word has length 19 [2020-01-16 18:32:25,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:25,753 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 546 transitions. [2020-01-16 18:32:25,753 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 546 transitions. [2020-01-16 18:32:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:25,753 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:25,753 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:25,754 INFO L426 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-01-16 18:32:25,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:25,754 INFO L82 PathProgramCache]: Analyzing trace with hash -445655956, now seen corresponding path program 319 times [2020-01-16 18:32:25,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:25,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317825139] [2020-01-16 18:32:25,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:25,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317825139] [2020-01-16 18:32:25,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:25,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:25,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318989645] [2020-01-16 18:32:25,939 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:25,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:25,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:25,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:25,939 INFO L87 Difference]: Start difference. First operand 186 states and 546 transitions. Second operand 8 states. [2020-01-16 18:32:26,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:26,001 INFO L93 Difference]: Finished difference Result 314 states and 773 transitions. [2020-01-16 18:32:26,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:26,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:26,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:26,002 INFO L225 Difference]: With dead ends: 314 [2020-01-16 18:32:26,002 INFO L226 Difference]: Without dead ends: 298 [2020-01-16 18:32:26,002 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-01-16 18:32:26,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-01-16 18:32:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 192. [2020-01-16 18:32:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 18:32:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 560 transitions. [2020-01-16 18:32:26,006 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 560 transitions. Word has length 19 [2020-01-16 18:32:26,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:26,006 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 560 transitions. [2020-01-16 18:32:26,007 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 560 transitions. [2020-01-16 18:32:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:26,007 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:26,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-01-16 18:32:26,007 INFO L426 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-01-16 18:32:26,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:26,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1697584794, now seen corresponding path program 320 times [2020-01-16 18:32:26,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:26,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337934219] [2020-01-16 18:32:26,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32: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-01-16 18:32:26,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337934219] [2020-01-16 18:32:26,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:26,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:26,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871397226] [2020-01-16 18:32:26,185 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:26,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:26,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:26,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:26,186 INFO L87 Difference]: Start difference. First operand 192 states and 560 transitions. Second operand 8 states. [2020-01-16 18:32:26,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:26,280 INFO L93 Difference]: Finished difference Result 308 states and 758 transitions. [2020-01-16 18:32:26,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:26,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:26,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:26,281 INFO L225 Difference]: With dead ends: 308 [2020-01-16 18:32:26,281 INFO L226 Difference]: Without dead ends: 295 [2020-01-16 18:32:26,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-01-16 18:32:26,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 189. [2020-01-16 18:32:26,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 18:32:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 553 transitions. [2020-01-16 18:32:26,286 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 553 transitions. Word has length 19 [2020-01-16 18:32:26,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:26,286 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 553 transitions. [2020-01-16 18:32:26,286 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:26,286 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 553 transitions. [2020-01-16 18:32:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:26,286 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:26,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:26,286 INFO L426 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-01-16 18:32:26,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:26,287 INFO L82 PathProgramCache]: Analyzing trace with hash -952002222, now seen corresponding path program 321 times [2020-01-16 18:32:26,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:26,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387494401] [2020-01-16 18:32:26,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:26,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387494401] [2020-01-16 18:32:26,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:26,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:26,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186475001] [2020-01-16 18:32:26,472 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:26,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:26,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:26,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:26,473 INFO L87 Difference]: Start difference. First operand 189 states and 553 transitions. Second operand 8 states. [2020-01-16 18:32:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:26,547 INFO L93 Difference]: Finished difference Result 320 states and 787 transitions. [2020-01-16 18:32:26,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:26,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:26,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:26,548 INFO L225 Difference]: With dead ends: 320 [2020-01-16 18:32:26,548 INFO L226 Difference]: Without dead ends: 304 [2020-01-16 18:32:26,549 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-01-16 18:32:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-01-16 18:32:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 195. [2020-01-16 18:32:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-01-16 18:32:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 564 transitions. [2020-01-16 18:32:26,554 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 564 transitions. Word has length 19 [2020-01-16 18:32:26,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:26,554 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 564 transitions. [2020-01-16 18:32:26,554 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:26,554 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 564 transitions. [2020-01-16 18:32:26,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:26,554 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:26,554 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:26,555 INFO L426 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-01-16 18:32:26,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:26,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1928206972, now seen corresponding path program 322 times [2020-01-16 18:32:26,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:26,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701866438] [2020-01-16 18:32:26,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:26,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701866438] [2020-01-16 18:32:26,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:26,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:26,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693456138] [2020-01-16 18:32:26,733 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:26,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:26,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:26,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:26,733 INFO L87 Difference]: Start difference. First operand 195 states and 564 transitions. Second operand 8 states. [2020-01-16 18:32:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:26,830 INFO L93 Difference]: Finished difference Result 317 states and 776 transitions. [2020-01-16 18:32:26,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:26,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:26,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:26,831 INFO L225 Difference]: With dead ends: 317 [2020-01-16 18:32:26,831 INFO L226 Difference]: Without dead ends: 298 [2020-01-16 18:32:26,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-01-16 18:32:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-01-16 18:32:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 189. [2020-01-16 18:32:26,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 18:32:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 550 transitions. [2020-01-16 18:32:26,835 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 550 transitions. Word has length 19 [2020-01-16 18:32:26,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:26,836 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 550 transitions. [2020-01-16 18:32:26,836 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 550 transitions. [2020-01-16 18:32:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:26,836 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:26,836 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:26,836 INFO L426 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-01-16 18:32:26,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:26,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1813226296, now seen corresponding path program 323 times [2020-01-16 18:32:26,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:26,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473512740] [2020-01-16 18:32:26,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:27,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473512740] [2020-01-16 18:32:27,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:27,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:27,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779928432] [2020-01-16 18:32:27,015 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:27,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:27,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:27,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:27,016 INFO L87 Difference]: Start difference. First operand 189 states and 550 transitions. Second operand 8 states. [2020-01-16 18:32:27,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:27,107 INFO L93 Difference]: Finished difference Result 304 states and 748 transitions. [2020-01-16 18:32:27,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:27,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:27,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:27,108 INFO L225 Difference]: With dead ends: 304 [2020-01-16 18:32:27,109 INFO L226 Difference]: Without dead ends: 294 [2020-01-16 18:32:27,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-01-16 18:32:27,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-01-16 18:32:27,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 191. [2020-01-16 18:32:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 18:32:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 553 transitions. [2020-01-16 18:32:27,113 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 553 transitions. Word has length 19 [2020-01-16 18:32:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:27,113 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 553 transitions. [2020-01-16 18:32:27,113 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 553 transitions. [2020-01-16 18:32:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:27,114 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:27,114 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:27,114 INFO L426 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-01-16 18:32:27,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:27,114 INFO L82 PathProgramCache]: Analyzing trace with hash 84178962, now seen corresponding path program 324 times [2020-01-16 18:32:27,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:27,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991652735] [2020-01-16 18:32:27,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:27,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991652735] [2020-01-16 18:32:27,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:27,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:27,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865456649] [2020-01-16 18:32:27,373 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:27,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:27,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:27,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:27,374 INFO L87 Difference]: Start difference. First operand 191 states and 553 transitions. Second operand 8 states. [2020-01-16 18:32:27,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:27,487 INFO L93 Difference]: Finished difference Result 307 states and 753 transitions. [2020-01-16 18:32:27,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:27,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:27,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:27,488 INFO L225 Difference]: With dead ends: 307 [2020-01-16 18:32:27,488 INFO L226 Difference]: Without dead ends: 289 [2020-01-16 18:32:27,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-01-16 18:32:27,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-01-16 18:32:27,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 186. [2020-01-16 18:32:27,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 18:32:27,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 544 transitions. [2020-01-16 18:32:27,493 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 544 transitions. Word has length 19 [2020-01-16 18:32:27,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:27,493 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 544 transitions. [2020-01-16 18:32:27,493 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:27,494 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 544 transitions. [2020-01-16 18:32:27,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:27,494 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:27,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-01-16 18:32:27,494 INFO L426 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-01-16 18:32:27,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:27,495 INFO L82 PathProgramCache]: Analyzing trace with hash -120059732, now seen corresponding path program 325 times [2020-01-16 18:32:27,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:27,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289766166] [2020-01-16 18:32:27,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:27,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289766166] [2020-01-16 18:32:27,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:27,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:27,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633900074] [2020-01-16 18:32:27,713 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:27,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:27,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:27,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:27,713 INFO L87 Difference]: Start difference. First operand 186 states and 544 transitions. Second operand 8 states. [2020-01-16 18:32:27,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:27,779 INFO L93 Difference]: Finished difference Result 311 states and 761 transitions. [2020-01-16 18:32:27,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:27,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:27,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:27,781 INFO L225 Difference]: With dead ends: 311 [2020-01-16 18:32:27,781 INFO L226 Difference]: Without dead ends: 295 [2020-01-16 18:32:27,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-01-16 18:32:27,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-01-16 18:32:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 192. [2020-01-16 18:32:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 18:32:27,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 558 transitions. [2020-01-16 18:32:27,784 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 558 transitions. Word has length 19 [2020-01-16 18:32:27,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:27,784 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 558 transitions. [2020-01-16 18:32:27,785 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 558 transitions. [2020-01-16 18:32:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:27,785 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:27,785 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:27,785 INFO L426 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-01-16 18:32:27,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:27,785 INFO L82 PathProgramCache]: Analyzing trace with hash 138998494, now seen corresponding path program 326 times [2020-01-16 18:32:27,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:27,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255834801] [2020-01-16 18:32:27,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:27,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255834801] [2020-01-16 18:32:27,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:27,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:27,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529756646] [2020-01-16 18:32:27,971 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:27,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:27,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:27,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:27,971 INFO L87 Difference]: Start difference. First operand 192 states and 558 transitions. Second operand 8 states. [2020-01-16 18:32:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:28,040 INFO L93 Difference]: Finished difference Result 305 states and 746 transitions. [2020-01-16 18:32:28,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:28,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:28,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:28,041 INFO L225 Difference]: With dead ends: 305 [2020-01-16 18:32:28,041 INFO L226 Difference]: Without dead ends: 292 [2020-01-16 18:32:28,042 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-01-16 18:32:28,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-01-16 18:32:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 189. [2020-01-16 18:32:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 18:32:28,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 551 transitions. [2020-01-16 18:32:28,046 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 551 transitions. Word has length 19 [2020-01-16 18:32:28,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:28,047 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 551 transitions. [2020-01-16 18:32:28,047 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 551 transitions. [2020-01-16 18:32:28,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:28,047 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:28,047 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:28,047 INFO L426 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-01-16 18:32:28,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:28,047 INFO L82 PathProgramCache]: Analyzing trace with hash 974031856, now seen corresponding path program 327 times [2020-01-16 18:32:28,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:28,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515690305] [2020-01-16 18:32:28,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:28,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515690305] [2020-01-16 18:32:28,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:28,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:28,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163995062] [2020-01-16 18:32:28,248 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:28,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:28,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:28,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:28,248 INFO L87 Difference]: Start difference. First operand 189 states and 551 transitions. Second operand 8 states. [2020-01-16 18:32:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:28,322 INFO L93 Difference]: Finished difference Result 311 states and 758 transitions. [2020-01-16 18:32:28,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:28,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:28,323 INFO L225 Difference]: With dead ends: 311 [2020-01-16 18:32:28,323 INFO L226 Difference]: Without dead ends: 295 [2020-01-16 18:32:28,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-01-16 18:32:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-01-16 18:32:28,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 195. [2020-01-16 18:32:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-01-16 18:32:28,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 562 transitions. [2020-01-16 18:32:28,328 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 562 transitions. Word has length 19 [2020-01-16 18:32:28,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:28,328 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 562 transitions. [2020-01-16 18:32:28,328 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 562 transitions. [2020-01-16 18:32:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:28,329 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:28,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-01-16 18:32:28,329 INFO L426 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-01-16 18:32:28,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:28,329 INFO L82 PathProgramCache]: Analyzing trace with hash -2172894, now seen corresponding path program 328 times [2020-01-16 18:32:28,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:28,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708882989] [2020-01-16 18:32:28,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:28,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708882989] [2020-01-16 18:32:28,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:28,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:28,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985265800] [2020-01-16 18:32:28,513 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:28,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:28,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:28,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:28,514 INFO L87 Difference]: Start difference. First operand 195 states and 562 transitions. Second operand 8 states. [2020-01-16 18:32:28,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:28,603 INFO L93 Difference]: Finished difference Result 308 states and 747 transitions. [2020-01-16 18:32:28,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:28,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:28,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:28,605 INFO L225 Difference]: With dead ends: 308 [2020-01-16 18:32:28,605 INFO L226 Difference]: Without dead ends: 289 [2020-01-16 18:32:28,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-01-16 18:32:28,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-01-16 18:32:28,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 189. [2020-01-16 18:32:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 18:32:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 548 transitions. [2020-01-16 18:32:28,610 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 548 transitions. Word has length 19 [2020-01-16 18:32:28,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:28,610 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 548 transitions. [2020-01-16 18:32:28,610 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 548 transitions. [2020-01-16 18:32:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:28,610 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:28,610 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:28,611 INFO L426 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-01-16 18:32:28,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:28,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1309572854, now seen corresponding path program 329 times [2020-01-16 18:32:28,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:28,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253073171] [2020-01-16 18:32:28,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:28,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253073171] [2020-01-16 18:32:28,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:28,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:28,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103922078] [2020-01-16 18:32:28,807 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:28,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:28,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:28,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:28,808 INFO L87 Difference]: Start difference. First operand 189 states and 548 transitions. Second operand 8 states. [2020-01-16 18:32:28,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:28,878 INFO L93 Difference]: Finished difference Result 295 states and 719 transitions. [2020-01-16 18:32:28,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:28,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:28,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:28,880 INFO L225 Difference]: With dead ends: 295 [2020-01-16 18:32:28,880 INFO L226 Difference]: Without dead ends: 285 [2020-01-16 18:32:28,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-01-16 18:32:28,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-01-16 18:32:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 191. [2020-01-16 18:32:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 18:32:28,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 551 transitions. [2020-01-16 18:32:28,884 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 551 transitions. Word has length 19 [2020-01-16 18:32:28,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:28,884 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 551 transitions. [2020-01-16 18:32:28,884 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 551 transitions. [2020-01-16 18:32:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:28,884 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:28,885 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:28,885 INFO L426 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-01-16 18:32:28,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:28,885 INFO L82 PathProgramCache]: Analyzing trace with hash 179832142, now seen corresponding path program 330 times [2020-01-16 18:32:28,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:28,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688530180] [2020-01-16 18:32:28,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:29,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688530180] [2020-01-16 18:32:29,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:29,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:29,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069582407] [2020-01-16 18:32:29,072 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:29,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:29,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:29,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:29,072 INFO L87 Difference]: Start difference. First operand 191 states and 551 transitions. Second operand 8 states. [2020-01-16 18:32:29,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:29,154 INFO L93 Difference]: Finished difference Result 293 states and 714 transitions. [2020-01-16 18:32:29,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:29,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:29,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:29,155 INFO L225 Difference]: With dead ends: 293 [2020-01-16 18:32:29,155 INFO L226 Difference]: Without dead ends: 275 [2020-01-16 18:32:29,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-01-16 18:32:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 186. [2020-01-16 18:32:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 18:32:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 542 transitions. [2020-01-16 18:32:29,160 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 542 transitions. Word has length 19 [2020-01-16 18:32:29,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:29,161 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 542 transitions. [2020-01-16 18:32:29,161 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 542 transitions. [2020-01-16 18:32:29,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:29,161 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:29,161 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:29,161 INFO L426 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-01-16 18:32:29,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:29,161 INFO L82 PathProgramCache]: Analyzing trace with hash -245646298, now seen corresponding path program 331 times [2020-01-16 18:32:29,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:29,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001321689] [2020-01-16 18:32:29,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:29,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001321689] [2020-01-16 18:32:29,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:29,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:29,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060175237] [2020-01-16 18:32:29,361 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:29,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:29,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:29,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:29,361 INFO L87 Difference]: Start difference. First operand 186 states and 542 transitions. Second operand 8 states. [2020-01-16 18:32:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:29,449 INFO L93 Difference]: Finished difference Result 283 states and 694 transitions. [2020-01-16 18:32:29,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:29,450 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:29,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:29,450 INFO L225 Difference]: With dead ends: 283 [2020-01-16 18:32:29,450 INFO L226 Difference]: Without dead ends: 273 [2020-01-16 18:32:29,451 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:29,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-01-16 18:32:29,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 188. [2020-01-16 18:32:29,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 18:32:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 546 transitions. [2020-01-16 18:32:29,455 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 546 transitions. Word has length 19 [2020-01-16 18:32:29,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:29,455 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 546 transitions. [2020-01-16 18:32:29,455 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 546 transitions. [2020-01-16 18:32:29,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:29,456 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:29,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-01-16 18:32:29,456 INFO L426 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-01-16 18:32:29,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:29,456 INFO L82 PathProgramCache]: Analyzing trace with hash -485288636, now seen corresponding path program 332 times [2020-01-16 18:32:29,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:29,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390782741] [2020-01-16 18:32:29,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:29,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390782741] [2020-01-16 18:32:29,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:29,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:29,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163087891] [2020-01-16 18:32:29,663 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:29,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:29,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:29,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:29,664 INFO L87 Difference]: Start difference. First operand 188 states and 546 transitions. Second operand 8 states. [2020-01-16 18:32:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:29,727 INFO L93 Difference]: Finished difference Result 283 states and 693 transitions. [2020-01-16 18:32:29,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:29,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:29,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:29,728 INFO L225 Difference]: With dead ends: 283 [2020-01-16 18:32:29,728 INFO L226 Difference]: Without dead ends: 272 [2020-01-16 18:32:29,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:29,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-01-16 18:32:29,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 187. [2020-01-16 18:32:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 18:32:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 544 transitions. [2020-01-16 18:32:29,733 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 544 transitions. Word has length 19 [2020-01-16 18:32:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:29,733 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 544 transitions. [2020-01-16 18:32:29,733 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 544 transitions. [2020-01-16 18:32:29,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:29,734 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:29,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-01-16 18:32:29,734 INFO L426 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-01-16 18:32:29,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:29,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1318731678, now seen corresponding path program 333 times [2020-01-16 18:32:29,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:29,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814878536] [2020-01-16 18:32:29,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:29,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814878536] [2020-01-16 18:32:29,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:29,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:29,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382793618] [2020-01-16 18:32:29,929 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:29,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:29,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:29,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:29,930 INFO L87 Difference]: Start difference. First operand 187 states and 544 transitions. Second operand 8 states. [2020-01-16 18:32:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:30,015 INFO L93 Difference]: Finished difference Result 280 states and 688 transitions. [2020-01-16 18:32:30,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:30,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:30,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:30,016 INFO L225 Difference]: With dead ends: 280 [2020-01-16 18:32:30,016 INFO L226 Difference]: Without dead ends: 270 [2020-01-16 18:32:30,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-01-16 18:32:30,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-01-16 18:32:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 189. [2020-01-16 18:32:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 18:32:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 547 transitions. [2020-01-16 18:32:30,021 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 547 transitions. Word has length 19 [2020-01-16 18:32:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:30,021 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 547 transitions. [2020-01-16 18:32:30,021 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:30,021 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 547 transitions. [2020-01-16 18:32:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:30,021 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:30,021 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:30,021 INFO L426 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-01-16 18:32:30,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:30,022 INFO L82 PathProgramCache]: Analyzing trace with hash -363752674, now seen corresponding path program 334 times [2020-01-16 18:32:30,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:30,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619227591] [2020-01-16 18:32:30,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:30,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619227591] [2020-01-16 18:32:30,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:30,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:30,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277020986] [2020-01-16 18:32:30,209 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:30,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:30,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:30,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:30,209 INFO L87 Difference]: Start difference. First operand 189 states and 547 transitions. Second operand 8 states. [2020-01-16 18:32:30,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:30,292 INFO L93 Difference]: Finished difference Result 283 states and 693 transitions. [2020-01-16 18:32:30,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:30,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:30,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:30,293 INFO L225 Difference]: With dead ends: 283 [2020-01-16 18:32:30,293 INFO L226 Difference]: Without dead ends: 268 [2020-01-16 18:32:30,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-01-16 18:32:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-01-16 18:32:30,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 187. [2020-01-16 18:32:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 18:32:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 543 transitions. [2020-01-16 18:32:30,298 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 543 transitions. Word has length 19 [2020-01-16 18:32:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:30,298 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 543 transitions. [2020-01-16 18:32:30,298 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 543 transitions. [2020-01-16 18:32:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:30,299 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:30,299 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:30,299 INFO L426 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-01-16 18:32:30,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:30,299 INFO L82 PathProgramCache]: Analyzing trace with hash 52566942, now seen corresponding path program 335 times [2020-01-16 18:32:30,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:30,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850267441] [2020-01-16 18:32:30,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:30,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850267441] [2020-01-16 18:32:30,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:30,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:30,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453770109] [2020-01-16 18:32:30,526 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:30,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:30,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:30,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:30,527 INFO L87 Difference]: Start difference. First operand 187 states and 543 transitions. Second operand 8 states. [2020-01-16 18:32:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:30,601 INFO L93 Difference]: Finished difference Result 278 states and 682 transitions. [2020-01-16 18:32:30,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:30,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:30,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:30,602 INFO L225 Difference]: With dead ends: 278 [2020-01-16 18:32:30,602 INFO L226 Difference]: Without dead ends: 268 [2020-01-16 18:32:30,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-01-16 18:32:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-01-16 18:32:30,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 189. [2020-01-16 18:32:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 18:32:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 546 transitions. [2020-01-16 18:32:30,606 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 546 transitions. Word has length 19 [2020-01-16 18:32:30,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:30,606 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 546 transitions. [2020-01-16 18:32:30,606 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:30,606 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 546 transitions. [2020-01-16 18:32:30,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:30,607 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:30,607 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:30,607 INFO L426 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-01-16 18:32:30,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:30,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1541971938, now seen corresponding path program 336 times [2020-01-16 18:32:30,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:30,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48747880] [2020-01-16 18:32:30,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:30,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48747880] [2020-01-16 18:32:30,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:30,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:30,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648396991] [2020-01-16 18:32:30,806 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:30,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:30,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:30,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:30,806 INFO L87 Difference]: Start difference. First operand 189 states and 546 transitions. Second operand 8 states. [2020-01-16 18:32:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:30,889 INFO L93 Difference]: Finished difference Result 276 states and 677 transitions. [2020-01-16 18:32:30,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:30,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:30,891 INFO L225 Difference]: With dead ends: 276 [2020-01-16 18:32:30,891 INFO L226 Difference]: Without dead ends: 258 [2020-01-16 18:32:30,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-01-16 18:32:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 184. [2020-01-16 18:32:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-01-16 18:32:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 538 transitions. [2020-01-16 18:32:30,895 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 538 transitions. Word has length 19 [2020-01-16 18:32:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:30,895 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 538 transitions. [2020-01-16 18:32:30,895 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 538 transitions. [2020-01-16 18:32:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:30,896 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:30,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:30,896 INFO L426 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-01-16 18:32:30,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:30,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1064346626, now seen corresponding path program 337 times [2020-01-16 18:32:30,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:30,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323771222] [2020-01-16 18:32:30,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:31,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-01-16 18:32:31,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323771222] [2020-01-16 18:32:31,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:31,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:31,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089823929] [2020-01-16 18:32:31,077 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:31,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:31,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:31,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:31,078 INFO L87 Difference]: Start difference. First operand 184 states and 538 transitions. Second operand 8 states. [2020-01-16 18:32:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:31,172 INFO L93 Difference]: Finished difference Result 296 states and 736 transitions. [2020-01-16 18:32:31,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:31,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:31,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:31,173 INFO L225 Difference]: With dead ends: 296 [2020-01-16 18:32:31,173 INFO L226 Difference]: Without dead ends: 282 [2020-01-16 18:32:31,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-01-16 18:32:31,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-01-16 18:32:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 188. [2020-01-16 18:32:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 18:32:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 548 transitions. [2020-01-16 18:32:31,178 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 548 transitions. Word has length 19 [2020-01-16 18:32:31,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:31,178 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 548 transitions. [2020-01-16 18:32:31,178 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 548 transitions. [2020-01-16 18:32:31,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:31,179 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:31,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-01-16 18:32:31,179 INFO L426 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-01-16 18:32:31,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:31,179 INFO L82 PathProgramCache]: Analyzing trace with hash 190011300, now seen corresponding path program 338 times [2020-01-16 18:32:31,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:31,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326396979] [2020-01-16 18:32:31,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:31,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:31,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326396979] [2020-01-16 18:32:31,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:31,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:31,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772272416] [2020-01-16 18:32:31,361 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:31,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:31,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:31,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:31,362 INFO L87 Difference]: Start difference. First operand 188 states and 548 transitions. Second operand 8 states. [2020-01-16 18:32:31,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:31,444 INFO L93 Difference]: Finished difference Result 292 states and 725 transitions. [2020-01-16 18:32:31,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:31,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:31,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:31,445 INFO L225 Difference]: With dead ends: 292 [2020-01-16 18:32:31,445 INFO L226 Difference]: Without dead ends: 280 [2020-01-16 18:32:31,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-01-16 18:32:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-01-16 18:32:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 186. [2020-01-16 18:32:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 18:32:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 544 transitions. [2020-01-16 18:32:31,450 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 544 transitions. Word has length 19 [2020-01-16 18:32:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:31,450 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 544 transitions. [2020-01-16 18:32:31,450 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 544 transitions. [2020-01-16 18:32:31,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:31,450 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:31,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-01-16 18:32:31,450 INFO L426 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-01-16 18:32:31,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:31,451 INFO L82 PathProgramCache]: Analyzing trace with hash -2069598556, now seen corresponding path program 339 times [2020-01-16 18:32:31,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:31,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371508549] [2020-01-16 18:32:31,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:31,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371508549] [2020-01-16 18:32:31,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:31,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:31,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713251767] [2020-01-16 18:32:31,640 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:31,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:31,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:31,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:31,641 INFO L87 Difference]: Start difference. First operand 186 states and 544 transitions. Second operand 8 states. [2020-01-16 18:32:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:31,718 INFO L93 Difference]: Finished difference Result 296 states and 735 transitions. [2020-01-16 18:32:31,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:31,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:31,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:31,719 INFO L225 Difference]: With dead ends: 296 [2020-01-16 18:32:31,719 INFO L226 Difference]: Without dead ends: 282 [2020-01-16 18:32:31,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-01-16 18:32:31,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-01-16 18:32:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 188. [2020-01-16 18:32:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 18:32:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 547 transitions. [2020-01-16 18:32:31,723 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 547 transitions. Word has length 19 [2020-01-16 18:32:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:31,723 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 547 transitions. [2020-01-16 18:32:31,723 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 547 transitions. [2020-01-16 18:32:31,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:31,723 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:31,724 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:31,724 INFO L426 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-01-16 18:32:31,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:31,724 INFO L82 PathProgramCache]: Analyzing trace with hash -949468726, now seen corresponding path program 340 times [2020-01-16 18:32:31,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:31,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130846068] [2020-01-16 18:32:31,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:31,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:31,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130846068] [2020-01-16 18:32:31,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:31,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:31,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690346727] [2020-01-16 18:32:31,911 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:31,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:31,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:31,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:31,912 INFO L87 Difference]: Start difference. First operand 188 states and 547 transitions. Second operand 8 states. [2020-01-16 18:32:31,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:31,977 INFO L93 Difference]: Finished difference Result 292 states and 724 transitions. [2020-01-16 18:32:31,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:31,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:31,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:31,979 INFO L225 Difference]: With dead ends: 292 [2020-01-16 18:32:31,979 INFO L226 Difference]: Without dead ends: 280 [2020-01-16 18:32:31,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:31,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-01-16 18:32:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 186. [2020-01-16 18:32:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 18:32:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 543 transitions. [2020-01-16 18:32:31,983 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 543 transitions. Word has length 19 [2020-01-16 18:32:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:31,983 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 543 transitions. [2020-01-16 18:32:31,983 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:31,983 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 543 transitions. [2020-01-16 18:32:31,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:31,984 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:31,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-01-16 18:32:31,984 INFO L426 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-01-16 18:32:31,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:31,984 INFO L82 PathProgramCache]: Analyzing trace with hash -171970810, now seen corresponding path program 341 times [2020-01-16 18:32:31,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:31,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122480517] [2020-01-16 18:32:31,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:32,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122480517] [2020-01-16 18:32:32,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:32,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:32,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756375717] [2020-01-16 18:32:32,185 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:32,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:32,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:32,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:32,186 INFO L87 Difference]: Start difference. First operand 186 states and 543 transitions. Second operand 8 states. [2020-01-16 18:32:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:32,278 INFO L93 Difference]: Finished difference Result 287 states and 713 transitions. [2020-01-16 18:32:32,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:32,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:32,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:32,279 INFO L225 Difference]: With dead ends: 287 [2020-01-16 18:32:32,280 INFO L226 Difference]: Without dead ends: 277 [2020-01-16 18:32:32,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-01-16 18:32:32,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 187. [2020-01-16 18:32:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 18:32:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 544 transitions. [2020-01-16 18:32:32,284 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 544 transitions. Word has length 19 [2020-01-16 18:32:32,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:32,284 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 544 transitions. [2020-01-16 18:32:32,285 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 544 transitions. [2020-01-16 18:32:32,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:32,285 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:32,285 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:32,285 INFO L426 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-01-16 18:32:32,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:32,285 INFO L82 PathProgramCache]: Analyzing trace with hash -411613148, now seen corresponding path program 342 times [2020-01-16 18:32:32,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:32,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499792136] [2020-01-16 18:32:32,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:32,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-01-16 18:32:32,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499792136] [2020-01-16 18:32:32,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:32,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:32,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595650907] [2020-01-16 18:32:32,507 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:32,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:32,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:32,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:32,508 INFO L87 Difference]: Start difference. First operand 187 states and 544 transitions. Second operand 8 states. [2020-01-16 18:32:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:32,579 INFO L93 Difference]: Finished difference Result 287 states and 712 transitions. [2020-01-16 18:32:32,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:32,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:32,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:32,580 INFO L225 Difference]: With dead ends: 287 [2020-01-16 18:32:32,580 INFO L226 Difference]: Without dead ends: 275 [2020-01-16 18:32:32,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-01-16 18:32:32,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 185. [2020-01-16 18:32:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-01-16 18:32:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 541 transitions. [2020-01-16 18:32:32,585 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 541 transitions. Word has length 19 [2020-01-16 18:32:32,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:32,586 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 541 transitions. [2020-01-16 18:32:32,586 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:32,586 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 541 transitions. [2020-01-16 18:32:32,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:32,586 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:32,586 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:32,586 INFO L426 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-01-16 18:32:32,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:32,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2136529082, now seen corresponding path program 343 times [2020-01-16 18:32:32,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:32,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766798847] [2020-01-16 18:32:32,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:32,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766798847] [2020-01-16 18:32:32,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:32,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:32,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770409014] [2020-01-16 18:32:32,755 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:32,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:32,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:32,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:32,756 INFO L87 Difference]: Start difference. First operand 185 states and 541 transitions. Second operand 8 states. [2020-01-16 18:32:32,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:32,837 INFO L93 Difference]: Finished difference Result 297 states and 737 transitions. [2020-01-16 18:32:32,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:32,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:32,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:32,838 INFO L225 Difference]: With dead ends: 297 [2020-01-16 18:32:32,838 INFO L226 Difference]: Without dead ends: 283 [2020-01-16 18:32:32,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:32,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-01-16 18:32:32,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 189. [2020-01-16 18:32:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 18:32:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 551 transitions. [2020-01-16 18:32:32,842 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 551 transitions. Word has length 19 [2020-01-16 18:32:32,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:32,842 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 551 transitions. [2020-01-16 18:32:32,842 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 551 transitions. [2020-01-16 18:32:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:32,842 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:32,843 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:32,843 INFO L426 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-01-16 18:32:32,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:32,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1284102888, now seen corresponding path program 344 times [2020-01-16 18:32:32,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:32,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10078206] [2020-01-16 18:32:32,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:33,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-01-16 18:32:33,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10078206] [2020-01-16 18:32:33,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:33,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:33,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475416643] [2020-01-16 18:32:33,011 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:33,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:33,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:33,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:33,012 INFO L87 Difference]: Start difference. First operand 189 states and 551 transitions. Second operand 8 states. [2020-01-16 18:32:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:33,100 INFO L93 Difference]: Finished difference Result 293 states and 726 transitions. [2020-01-16 18:32:33,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:33,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:33,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:33,101 INFO L225 Difference]: With dead ends: 293 [2020-01-16 18:32:33,102 INFO L226 Difference]: Without dead ends: 281 [2020-01-16 18:32:33,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-01-16 18:32:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-01-16 18:32:33,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 187. [2020-01-16 18:32:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 18:32:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 546 transitions. [2020-01-16 18:32:33,107 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 546 transitions. Word has length 19 [2020-01-16 18:32:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:33,107 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 546 transitions. [2020-01-16 18:32:33,107 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 546 transitions. [2020-01-16 18:32:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:33,107 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:33,107 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:33,107 INFO L426 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-01-16 18:32:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:33,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1698016266, now seen corresponding path program 345 times [2020-01-16 18:32:33,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:33,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204821320] [2020-01-16 18:32:33,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:33,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204821320] [2020-01-16 18:32:33,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:33,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:33,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896356750] [2020-01-16 18:32:33,288 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:33,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:33,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:33,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:33,288 INFO L87 Difference]: Start difference. First operand 187 states and 546 transitions. Second operand 8 states. [2020-01-16 18:32:33,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:33,379 INFO L93 Difference]: Finished difference Result 303 states and 752 transitions. [2020-01-16 18:32:33,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:33,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:33,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:33,380 INFO L225 Difference]: With dead ends: 303 [2020-01-16 18:32:33,380 INFO L226 Difference]: Without dead ends: 289 [2020-01-16 18:32:33,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-01-16 18:32:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2020-01-16 18:32:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 18:32:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 556 transitions. [2020-01-16 18:32:33,385 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 556 transitions. Word has length 19 [2020-01-16 18:32:33,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:33,385 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 556 transitions. [2020-01-16 18:32:33,385 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:33,385 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 556 transitions. [2020-01-16 18:32:33,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:33,385 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:33,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-01-16 18:32:33,386 INFO L426 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-01-16 18:32:33,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:33,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1628066990, now seen corresponding path program 346 times [2020-01-16 18:32:33,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:33,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485183672] [2020-01-16 18:32:33,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:33,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-01-16 18:32:33,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485183672] [2020-01-16 18:32:33,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:33,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:33,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386075150] [2020-01-16 18:32:33,568 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:33,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:33,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:33,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:33,569 INFO L87 Difference]: Start difference. First operand 192 states and 556 transitions. Second operand 8 states. [2020-01-16 18:32:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:33,650 INFO L93 Difference]: Finished difference Result 302 states and 745 transitions. [2020-01-16 18:32:33,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:33,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:33,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:33,652 INFO L225 Difference]: With dead ends: 302 [2020-01-16 18:32:33,652 INFO L226 Difference]: Without dead ends: 284 [2020-01-16 18:32:33,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-01-16 18:32:33,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-01-16 18:32:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 187. [2020-01-16 18:32:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 18:32:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 544 transitions. [2020-01-16 18:32:33,656 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 544 transitions. Word has length 19 [2020-01-16 18:32:33,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:33,656 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 544 transitions. [2020-01-16 18:32:33,657 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 544 transitions. [2020-01-16 18:32:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:33,657 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:33,657 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:33,657 INFO L426 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-01-16 18:32:33,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:33,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1237178862, now seen corresponding path program 347 times [2020-01-16 18:32:33,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:33,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424729936] [2020-01-16 18:32:33,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:33,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424729936] [2020-01-16 18:32:33,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:33,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:33,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761008578] [2020-01-16 18:32:33,847 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:33,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:33,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:33,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:33,847 INFO L87 Difference]: Start difference. First operand 187 states and 544 transitions. Second operand 8 states. [2020-01-16 18:32:33,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:33,923 INFO L93 Difference]: Finished difference Result 292 states and 722 transitions. [2020-01-16 18:32:33,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:33,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:33,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:33,924 INFO L225 Difference]: With dead ends: 292 [2020-01-16 18:32:33,924 INFO L226 Difference]: Without dead ends: 282 [2020-01-16 18:32:33,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-01-16 18:32:33,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 189. [2020-01-16 18:32:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 18:32:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 547 transitions. [2020-01-16 18:32:33,929 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 547 transitions. Word has length 19 [2020-01-16 18:32:33,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:33,929 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 547 transitions. [2020-01-16 18:32:33,929 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:33,929 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 547 transitions. [2020-01-16 18:32:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:33,930 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:33,930 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:33,930 INFO L426 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-01-16 18:32:33,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:33,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1328741100, now seen corresponding path program 348 times [2020-01-16 18:32:33,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:33,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847154989] [2020-01-16 18:32:33,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:34,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847154989] [2020-01-16 18:32:34,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:34,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:34,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207504737] [2020-01-16 18:32:34,106 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:34,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:34,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:34,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:34,107 INFO L87 Difference]: Start difference. First operand 189 states and 547 transitions. Second operand 8 states. [2020-01-16 18:32:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:34,197 INFO L93 Difference]: Finished difference Result 295 states and 727 transitions. [2020-01-16 18:32:34,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:34,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:34,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:34,198 INFO L225 Difference]: With dead ends: 295 [2020-01-16 18:32:34,198 INFO L226 Difference]: Without dead ends: 278 [2020-01-16 18:32:34,198 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-01-16 18:32:34,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 185. [2020-01-16 18:32:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-01-16 18:32:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 540 transitions. [2020-01-16 18:32:34,202 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 540 transitions. Word has length 19 [2020-01-16 18:32:34,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:34,202 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 540 transitions. [2020-01-16 18:32:34,202 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 540 transitions. [2020-01-16 18:32:34,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:34,203 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:34,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-01-16 18:32:34,203 INFO L426 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-01-16 18:32:34,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:34,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1719022474, now seen corresponding path program 349 times [2020-01-16 18:32:34,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:34,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19091392] [2020-01-16 18:32:34,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:34,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19091392] [2020-01-16 18:32:34,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:34,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:34,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017583153] [2020-01-16 18:32:34,390 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:34,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:34,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:34,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:34,390 INFO L87 Difference]: Start difference. First operand 185 states and 540 transitions. Second operand 8 states. [2020-01-16 18:32:34,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:34,469 INFO L93 Difference]: Finished difference Result 295 states and 729 transitions. [2020-01-16 18:32:34,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:34,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:34,470 INFO L225 Difference]: With dead ends: 295 [2020-01-16 18:32:34,470 INFO L226 Difference]: Without dead ends: 281 [2020-01-16 18:32:34,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-01-16 18:32:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-01-16 18:32:34,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 189. [2020-01-16 18:32:34,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 18:32:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 550 transitions. [2020-01-16 18:32:34,475 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 550 transitions. Word has length 19 [2020-01-16 18:32:34,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:34,475 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 550 transitions. [2020-01-16 18:32:34,475 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:34,475 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 550 transitions. [2020-01-16 18:32:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:34,475 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:34,475 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:34,475 INFO L426 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-01-16 18:32:34,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:34,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1455814992, now seen corresponding path program 350 times [2020-01-16 18:32:34,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:34,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293725600] [2020-01-16 18:32:34,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:34,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293725600] [2020-01-16 18:32:34,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:34,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:34,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588664720] [2020-01-16 18:32:34,664 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:34,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:34,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:34,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:34,665 INFO L87 Difference]: Start difference. First operand 189 states and 550 transitions. Second operand 8 states. [2020-01-16 18:32:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:34,732 INFO L93 Difference]: Finished difference Result 291 states and 718 transitions. [2020-01-16 18:32:34,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:34,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:34,733 INFO L225 Difference]: With dead ends: 291 [2020-01-16 18:32:34,733 INFO L226 Difference]: Without dead ends: 279 [2020-01-16 18:32:34,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:34,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-01-16 18:32:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 187. [2020-01-16 18:32:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 18:32:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 545 transitions. [2020-01-16 18:32:34,738 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 545 transitions. Word has length 19 [2020-01-16 18:32:34,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:34,738 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 545 transitions. [2020-01-16 18:32:34,738 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 545 transitions. [2020-01-16 18:32:34,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:34,738 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:34,738 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:34,738 INFO L426 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-01-16 18:32:34,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:34,739 INFO L82 PathProgramCache]: Analyzing trace with hash 645937094, now seen corresponding path program 351 times [2020-01-16 18:32:34,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:34,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878010805] [2020-01-16 18:32:34,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:34,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878010805] [2020-01-16 18:32:34,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:34,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:34,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241543301] [2020-01-16 18:32:34,931 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:34,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:34,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:34,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:34,931 INFO L87 Difference]: Start difference. First operand 187 states and 545 transitions. Second operand 8 states. [2020-01-16 18:32:35,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:35,019 INFO L93 Difference]: Finished difference Result 296 states and 729 transitions. [2020-01-16 18:32:35,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:35,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:35,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:35,020 INFO L225 Difference]: With dead ends: 296 [2020-01-16 18:32:35,020 INFO L226 Difference]: Without dead ends: 282 [2020-01-16 18:32:35,021 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-01-16 18:32:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 192. [2020-01-16 18:32:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 18:32:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 555 transitions. [2020-01-16 18:32:35,026 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 555 transitions. Word has length 19 [2020-01-16 18:32:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:35,026 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 555 transitions. [2020-01-16 18:32:35,026 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:35,026 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 555 transitions. [2020-01-16 18:32:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:35,026 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:35,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-01-16 18:32:35,026 INFO L426 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-01-16 18:32:35,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:35,027 INFO L82 PathProgramCache]: Analyzing trace with hash 3880176, now seen corresponding path program 352 times [2020-01-16 18:32:35,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:35,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245104558] [2020-01-16 18:32:35,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:35,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245104558] [2020-01-16 18:32:35,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:35,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:35,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979101656] [2020-01-16 18:32:35,211 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:35,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:35,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:35,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:35,212 INFO L87 Difference]: Start difference. First operand 192 states and 555 transitions. Second operand 8 states. [2020-01-16 18:32:35,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:35,294 INFO L93 Difference]: Finished difference Result 295 states and 722 transitions. [2020-01-16 18:32:35,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:35,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:35,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:35,295 INFO L225 Difference]: With dead ends: 295 [2020-01-16 18:32:35,295 INFO L226 Difference]: Without dead ends: 277 [2020-01-16 18:32:35,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-01-16 18:32:35,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-01-16 18:32:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 187. [2020-01-16 18:32:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 18:32:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 543 transitions. [2020-01-16 18:32:35,300 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 543 transitions. Word has length 19 [2020-01-16 18:32:35,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:35,301 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 543 transitions. [2020-01-16 18:32:35,301 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 543 transitions. [2020-01-16 18:32:35,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:35,301 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:35,301 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:35,301 INFO L426 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-01-16 18:32:35,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:35,302 INFO L82 PathProgramCache]: Analyzing trace with hash -380103836, now seen corresponding path program 353 times [2020-01-16 18:32:35,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:35,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709655508] [2020-01-16 18:32:35,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:35,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709655508] [2020-01-16 18:32:35,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:35,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:35,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212420701] [2020-01-16 18:32:35,496 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:35,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:35,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:35,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:35,497 INFO L87 Difference]: Start difference. First operand 187 states and 543 transitions. Second operand 8 states. [2020-01-16 18:32:35,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:35,557 INFO L93 Difference]: Finished difference Result 285 states and 699 transitions. [2020-01-16 18:32:35,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:35,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:35,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:35,558 INFO L225 Difference]: With dead ends: 285 [2020-01-16 18:32:35,558 INFO L226 Difference]: Without dead ends: 275 [2020-01-16 18:32:35,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-01-16 18:32:35,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-01-16 18:32:35,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 189. [2020-01-16 18:32:35,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 18:32:35,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 546 transitions. [2020-01-16 18:32:35,562 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 546 transitions. Word has length 19 [2020-01-16 18:32:35,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:35,562 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 546 transitions. [2020-01-16 18:32:35,562 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:35,562 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 546 transitions. [2020-01-16 18:32:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:35,563 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:35,563 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:35,563 INFO L426 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-01-16 18:32:35,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:35,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1109301160, now seen corresponding path program 354 times [2020-01-16 18:32:35,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:35,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789653674] [2020-01-16 18:32:35,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:35,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789653674] [2020-01-16 18:32:35,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:35,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:35,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218243748] [2020-01-16 18:32:35,750 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:35,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:35,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:35,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:35,751 INFO L87 Difference]: Start difference. First operand 189 states and 546 transitions. Second operand 8 states. [2020-01-16 18:32:35,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:35,832 INFO L93 Difference]: Finished difference Result 283 states and 694 transitions. [2020-01-16 18:32:35,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:35,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:35,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:35,833 INFO L225 Difference]: With dead ends: 283 [2020-01-16 18:32:35,833 INFO L226 Difference]: Without dead ends: 266 [2020-01-16 18:32:35,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-01-16 18:32:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 185. [2020-01-16 18:32:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-01-16 18:32:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 539 transitions. [2020-01-16 18:32:35,838 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 539 transitions. Word has length 19 [2020-01-16 18:32:35,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:35,839 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 539 transitions. [2020-01-16 18:32:35,839 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 539 transitions. [2020-01-16 18:32:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:35,839 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:35,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-01-16 18:32:35,839 INFO L426 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-01-16 18:32:35,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:35,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1184663342, now seen corresponding path program 355 times [2020-01-16 18:32:35,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:35,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233843311] [2020-01-16 18:32:35,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:36,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-01-16 18:32:36,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233843311] [2020-01-16 18:32:36,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:36,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:36,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853379056] [2020-01-16 18:32:36,037 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:36,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:36,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:36,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:36,037 INFO L87 Difference]: Start difference. First operand 185 states and 539 transitions. Second operand 8 states. [2020-01-16 18:32:36,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:36,125 INFO L93 Difference]: Finished difference Result 277 states and 681 transitions. [2020-01-16 18:32:36,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:36,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:36,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:36,127 INFO L225 Difference]: With dead ends: 277 [2020-01-16 18:32:36,127 INFO L226 Difference]: Without dead ends: 267 [2020-01-16 18:32:36,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-01-16 18:32:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-01-16 18:32:36,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 187. [2020-01-16 18:32:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 18:32:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 543 transitions. [2020-01-16 18:32:36,132 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 543 transitions. Word has length 19 [2020-01-16 18:32:36,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:36,132 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 543 transitions. [2020-01-16 18:32:36,133 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:36,133 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 543 transitions. [2020-01-16 18:32:36,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:36,133 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:36,133 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:36,133 INFO L426 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-01-16 18:32:36,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:36,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1424305680, now seen corresponding path program 356 times [2020-01-16 18:32:36,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:36,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267451137] [2020-01-16 18:32:36,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:36,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:36,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267451137] [2020-01-16 18:32:36,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:36,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:36,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060613983] [2020-01-16 18:32:36,339 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:36,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:36,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:36,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:36,340 INFO L87 Difference]: Start difference. First operand 187 states and 543 transitions. Second operand 8 states. [2020-01-16 18:32:36,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:36,399 INFO L93 Difference]: Finished difference Result 277 states and 680 transitions. [2020-01-16 18:32:36,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:36,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:36,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:36,401 INFO L225 Difference]: With dead ends: 277 [2020-01-16 18:32:36,401 INFO L226 Difference]: Without dead ends: 266 [2020-01-16 18:32:36,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-01-16 18:32:36,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-01-16 18:32:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 186. [2020-01-16 18:32:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 18:32:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 541 transitions. [2020-01-16 18:32:36,405 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 541 transitions. Word has length 19 [2020-01-16 18:32:36,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:36,405 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 541 transitions. [2020-01-16 18:32:36,405 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:36,405 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 541 transitions. [2020-01-16 18:32:36,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:36,406 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:36,406 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:36,406 INFO L426 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-01-16 18:32:36,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:36,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2037218574, now seen corresponding path program 357 times [2020-01-16 18:32:36,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:36,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090516471] [2020-01-16 18:32:36,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:36,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090516471] [2020-01-16 18:32:36,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:36,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:36,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691749632] [2020-01-16 18:32:36,594 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:36,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:36,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:36,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:36,595 INFO L87 Difference]: Start difference. First operand 186 states and 541 transitions. Second operand 8 states. [2020-01-16 18:32:36,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:36,673 INFO L93 Difference]: Finished difference Result 274 states and 675 transitions. [2020-01-16 18:32:36,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:36,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:36,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:36,675 INFO L225 Difference]: With dead ends: 274 [2020-01-16 18:32:36,675 INFO L226 Difference]: Without dead ends: 264 [2020-01-16 18:32:36,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-01-16 18:32:36,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-01-16 18:32:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 188. [2020-01-16 18:32:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 18:32:36,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 544 transitions. [2020-01-16 18:32:36,679 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 544 transitions. Word has length 19 [2020-01-16 18:32:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:36,679 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 544 transitions. [2020-01-16 18:32:36,679 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:36,679 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 544 transitions. [2020-01-16 18:32:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:36,680 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:36,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-01-16 18:32:36,680 INFO L426 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-01-16 18:32:36,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:36,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1302769718, now seen corresponding path program 358 times [2020-01-16 18:32:36,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:36,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006293806] [2020-01-16 18:32:36,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:36,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-01-16 18:32:36,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006293806] [2020-01-16 18:32:36,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:36,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:36,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151225097] [2020-01-16 18:32:36,869 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:36,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:36,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:36,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:36,870 INFO L87 Difference]: Start difference. First operand 188 states and 544 transitions. Second operand 8 states. [2020-01-16 18:32:36,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:36,961 INFO L93 Difference]: Finished difference Result 277 states and 680 transitions. [2020-01-16 18:32:36,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:36,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:36,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:36,962 INFO L225 Difference]: With dead ends: 277 [2020-01-16 18:32:36,962 INFO L226 Difference]: Without dead ends: 262 [2020-01-16 18:32:36,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:36,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-01-16 18:32:36,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 186. [2020-01-16 18:32:36,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 18:32:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 540 transitions. [2020-01-16 18:32:36,966 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 540 transitions. Word has length 19 [2020-01-16 18:32:36,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:36,966 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 540 transitions. [2020-01-16 18:32:36,966 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:36,966 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 540 transitions. [2020-01-16 18:32:36,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:36,967 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:36,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-01-16 18:32:36,967 INFO L426 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-01-16 18:32:36,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:36,967 INFO L82 PathProgramCache]: Analyzing trace with hash -886450102, now seen corresponding path program 359 times [2020-01-16 18:32:36,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:36,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709498038] [2020-01-16 18:32:36,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:37,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709498038] [2020-01-16 18:32:37,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:37,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:37,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295717327] [2020-01-16 18:32:37,160 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:37,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:37,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:37,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:37,161 INFO L87 Difference]: Start difference. First operand 186 states and 540 transitions. Second operand 8 states. [2020-01-16 18:32:37,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:37,233 INFO L93 Difference]: Finished difference Result 272 states and 669 transitions. [2020-01-16 18:32:37,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:37,233 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:37,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:37,234 INFO L225 Difference]: With dead ends: 272 [2020-01-16 18:32:37,234 INFO L226 Difference]: Without dead ends: 262 [2020-01-16 18:32:37,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-01-16 18:32:37,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 188. [2020-01-16 18:32:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 18:32:37,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 543 transitions. [2020-01-16 18:32:37,239 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 543 transitions. Word has length 19 [2020-01-16 18:32:37,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:37,239 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 543 transitions. [2020-01-16 18:32:37,240 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:37,240 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 543 transitions. [2020-01-16 18:32:37,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:37,240 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:37,240 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:37,240 INFO L426 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-01-16 18:32:37,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:37,240 INFO L82 PathProgramCache]: Analyzing trace with hash 602954894, now seen corresponding path program 360 times [2020-01-16 18:32:37,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:37,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579499213] [2020-01-16 18:32:37,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:37,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579499213] [2020-01-16 18:32:37,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:37,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:37,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776130447] [2020-01-16 18:32:37,432 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:37,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:37,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:37,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:37,432 INFO L87 Difference]: Start difference. First operand 188 states and 543 transitions. Second operand 8 states. [2020-01-16 18:32:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:37,513 INFO L93 Difference]: Finished difference Result 270 states and 664 transitions. [2020-01-16 18:32:37,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:37,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:37,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:37,514 INFO L225 Difference]: With dead ends: 270 [2020-01-16 18:32:37,515 INFO L226 Difference]: Without dead ends: 249 [2020-01-16 18:32:37,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-01-16 18:32:37,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-01-16 18:32:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 180. [2020-01-16 18:32:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-01-16 18:32:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 530 transitions. [2020-01-16 18:32:37,519 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 530 transitions. Word has length 19 [2020-01-16 18:32:37,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:37,519 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 530 transitions. [2020-01-16 18:32:37,519 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 530 transitions. [2020-01-16 18:32:37,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:37,519 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:37,520 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:37,520 INFO L426 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-01-16 18:32:37,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:37,520 INFO L82 PathProgramCache]: Analyzing trace with hash 234329704, now seen corresponding path program 361 times [2020-01-16 18:32:37,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:37,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855389055] [2020-01-16 18:32:37,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:37,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855389055] [2020-01-16 18:32:37,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:37,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:37,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380382647] [2020-01-16 18:32:37,732 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:37,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:37,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:37,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:37,733 INFO L87 Difference]: Start difference. First operand 180 states and 530 transitions. Second operand 8 states. [2020-01-16 18:32:37,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:37,793 INFO L93 Difference]: Finished difference Result 319 states and 780 transitions. [2020-01-16 18:32:37,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:37,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:37,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:37,795 INFO L225 Difference]: With dead ends: 319 [2020-01-16 18:32:37,795 INFO L226 Difference]: Without dead ends: 303 [2020-01-16 18:32:37,795 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-01-16 18:32:37,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 192. [2020-01-16 18:32:37,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 18:32:37,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 556 transitions. [2020-01-16 18:32:37,800 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 556 transitions. Word has length 19 [2020-01-16 18:32:37,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:37,800 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 556 transitions. [2020-01-16 18:32:37,800 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 556 transitions. [2020-01-16 18:32:37,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:37,801 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:37,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-01-16 18:32:37,801 INFO L426 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-01-16 18:32:37,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:37,801 INFO L82 PathProgramCache]: Analyzing trace with hash 608980890, now seen corresponding path program 362 times [2020-01-16 18:32:37,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:37,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573947430] [2020-01-16 18:32:37,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:38,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-01-16 18:32:38,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573947430] [2020-01-16 18:32:38,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:38,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:38,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145157199] [2020-01-16 18:32:38,008 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:38,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:38,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:38,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:38,008 INFO L87 Difference]: Start difference. First operand 192 states and 556 transitions. Second operand 8 states. [2020-01-16 18:32:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:38,094 INFO L93 Difference]: Finished difference Result 317 states and 770 transitions. [2020-01-16 18:32:38,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:38,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:38,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:38,095 INFO L225 Difference]: With dead ends: 317 [2020-01-16 18:32:38,095 INFO L226 Difference]: Without dead ends: 295 [2020-01-16 18:32:38,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-01-16 18:32:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-01-16 18:32:38,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2020-01-16 18:32:38,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-01-16 18:32:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 538 transitions. [2020-01-16 18:32:38,099 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 538 transitions. Word has length 19 [2020-01-16 18:32:38,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:38,099 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 538 transitions. [2020-01-16 18:32:38,099 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:38,100 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 538 transitions. [2020-01-16 18:32:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:38,100 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:38,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-01-16 18:32:38,100 INFO L426 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-01-16 18:32:38,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:38,100 INFO L82 PathProgramCache]: Analyzing trace with hash 438930786, now seen corresponding path program 363 times [2020-01-16 18:32:38,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:38,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574383901] [2020-01-16 18:32:38,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:38,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574383901] [2020-01-16 18:32:38,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:38,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:38,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354216653] [2020-01-16 18:32:38,306 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:38,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:38,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:38,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:38,307 INFO L87 Difference]: Start difference. First operand 184 states and 538 transitions. Second operand 8 states. [2020-01-16 18:32:38,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:38,365 INFO L93 Difference]: Finished difference Result 310 states and 753 transitions. [2020-01-16 18:32:38,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:38,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:38,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:38,366 INFO L225 Difference]: With dead ends: 310 [2020-01-16 18:32:38,366 INFO L226 Difference]: Without dead ends: 294 [2020-01-16 18:32:38,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-01-16 18:32:38,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-01-16 18:32:38,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 187. [2020-01-16 18:32:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 18:32:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 542 transitions. [2020-01-16 18:32:38,372 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 542 transitions. Word has length 19 [2020-01-16 18:32:38,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:38,372 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 542 transitions. [2020-01-16 18:32:38,372 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:38,372 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 542 transitions. [2020-01-16 18:32:38,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:38,373 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:38,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-01-16 18:32:38,373 INFO L426 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-01-16 18:32:38,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:38,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1712795760, now seen corresponding path program 364 times [2020-01-16 18:32:38,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:38,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752247883] [2020-01-16 18:32:38,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:38,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752247883] [2020-01-16 18:32:38,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:38,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:38,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064031383] [2020-01-16 18:32:38,572 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:38,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:38,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:38,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:38,572 INFO L87 Difference]: Start difference. First operand 187 states and 542 transitions. Second operand 8 states. [2020-01-16 18:32:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:38,652 INFO L93 Difference]: Finished difference Result 304 states and 738 transitions. [2020-01-16 18:32:38,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:38,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:38,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:38,653 INFO L225 Difference]: With dead ends: 304 [2020-01-16 18:32:38,653 INFO L226 Difference]: Without dead ends: 291 [2020-01-16 18:32:38,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:38,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-01-16 18:32:38,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 184. [2020-01-16 18:32:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-01-16 18:32:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 535 transitions. [2020-01-16 18:32:38,658 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 535 transitions. Word has length 19 [2020-01-16 18:32:38,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:38,658 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 535 transitions. [2020-01-16 18:32:38,658 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:38,658 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 535 transitions. [2020-01-16 18:32:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:38,658 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:38,658 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:38,659 INFO L426 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-01-16 18:32:38,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:38,659 INFO L82 PathProgramCache]: Analyzing trace with hash -959085248, now seen corresponding path program 365 times [2020-01-16 18:32:38,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:38,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473631001] [2020-01-16 18:32:38,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:38,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473631001] [2020-01-16 18:32:38,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:38,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:38,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923288622] [2020-01-16 18:32:38,855 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:38,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:38,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:38,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:38,855 INFO L87 Difference]: Start difference. First operand 184 states and 535 transitions. Second operand 8 states. [2020-01-16 18:32:38,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:38,932 INFO L93 Difference]: Finished difference Result 305 states and 742 transitions. [2020-01-16 18:32:38,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:38,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:38,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:38,933 INFO L225 Difference]: With dead ends: 305 [2020-01-16 18:32:38,934 INFO L226 Difference]: Without dead ends: 291 [2020-01-16 18:32:38,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-01-16 18:32:38,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-01-16 18:32:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 186. [2020-01-16 18:32:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 18:32:38,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 538 transitions. [2020-01-16 18:32:38,938 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 538 transitions. Word has length 19 [2020-01-16 18:32:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:38,938 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 538 transitions. [2020-01-16 18:32:38,938 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 538 transitions. [2020-01-16 18:32:38,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:38,939 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:38,939 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:38,939 INFO L426 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-01-16 18:32:38,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:38,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1833420574, now seen corresponding path program 366 times [2020-01-16 18:32:38,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:38,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896568399] [2020-01-16 18:32:38,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:39,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896568399] [2020-01-16 18:32:39,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:39,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:39,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423014119] [2020-01-16 18:32:39,142 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:39,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:39,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:39,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:39,142 INFO L87 Difference]: Start difference. First operand 186 states and 538 transitions. Second operand 8 states. [2020-01-16 18:32:39,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:39,225 INFO L93 Difference]: Finished difference Result 301 states and 731 transitions. [2020-01-16 18:32:39,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:39,226 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:39,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:39,226 INFO L225 Difference]: With dead ends: 301 [2020-01-16 18:32:39,227 INFO L226 Difference]: Without dead ends: 285 [2020-01-16 18:32:39,227 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:39,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-01-16 18:32:39,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 180. [2020-01-16 18:32:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-01-16 18:32:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 527 transitions. [2020-01-16 18:32:39,231 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 527 transitions. Word has length 19 [2020-01-16 18:32:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:39,231 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 527 transitions. [2020-01-16 18:32:39,231 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 527 transitions. [2020-01-16 18:32:39,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:39,231 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:39,231 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:39,232 INFO L426 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-01-16 18:32:39,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:39,232 INFO L82 PathProgramCache]: Analyzing trace with hash -188156022, now seen corresponding path program 367 times [2020-01-16 18:32:39,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:39,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620412126] [2020-01-16 18:32:39,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:39,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:39,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620412126] [2020-01-16 18:32:39,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:39,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:39,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373453068] [2020-01-16 18:32:39,448 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:39,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:39,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:39,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:39,448 INFO L87 Difference]: Start difference. First operand 180 states and 527 transitions. Second operand 8 states. [2020-01-16 18:32:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:39,513 INFO L93 Difference]: Finished difference Result 319 states and 777 transitions. [2020-01-16 18:32:39,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:39,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:39,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:39,514 INFO L225 Difference]: With dead ends: 319 [2020-01-16 18:32:39,514 INFO L226 Difference]: Without dead ends: 303 [2020-01-16 18:32:39,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-01-16 18:32:39,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-01-16 18:32:39,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 192. [2020-01-16 18:32:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 18:32:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 553 transitions. [2020-01-16 18:32:39,519 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 553 transitions. Word has length 19 [2020-01-16 18:32:39,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:39,520 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 553 transitions. [2020-01-16 18:32:39,520 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:39,520 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 553 transitions. [2020-01-16 18:32:39,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:39,520 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:39,520 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:39,520 INFO L426 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-01-16 18:32:39,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:39,521 INFO L82 PathProgramCache]: Analyzing trace with hash 186495164, now seen corresponding path program 368 times [2020-01-16 18:32:39,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:39,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367568188] [2020-01-16 18:32:39,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:39,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367568188] [2020-01-16 18:32:39,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:39,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:39,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515952374] [2020-01-16 18:32:39,733 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:39,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:39,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:39,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:39,734 INFO L87 Difference]: Start difference. First operand 192 states and 553 transitions. Second operand 8 states. [2020-01-16 18:32:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:39,810 INFO L93 Difference]: Finished difference Result 317 states and 767 transitions. [2020-01-16 18:32:39,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:39,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:39,811 INFO L225 Difference]: With dead ends: 317 [2020-01-16 18:32:39,811 INFO L226 Difference]: Without dead ends: 295 [2020-01-16 18:32:39,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:39,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-01-16 18:32:39,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2020-01-16 18:32:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-01-16 18:32:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 535 transitions. [2020-01-16 18:32:39,816 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 535 transitions. Word has length 19 [2020-01-16 18:32:39,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:39,817 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 535 transitions. [2020-01-16 18:32:39,817 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 535 transitions. [2020-01-16 18:32:39,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:39,817 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:39,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-01-16 18:32:39,817 INFO L426 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-01-16 18:32:39,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:39,817 INFO L82 PathProgramCache]: Analyzing trace with hash 342041284, now seen corresponding path program 369 times [2020-01-16 18:32:39,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:39,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580688012] [2020-01-16 18:32:39,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:40,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-01-16 18:32:40,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580688012] [2020-01-16 18:32:40,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:40,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:40,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626170770] [2020-01-16 18:32:40,049 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:40,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:40,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:40,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:40,050 INFO L87 Difference]: Start difference. First operand 184 states and 535 transitions. Second operand 8 states. [2020-01-16 18:32:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:40,116 INFO L93 Difference]: Finished difference Result 310 states and 750 transitions. [2020-01-16 18:32:40,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:40,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:40,117 INFO L225 Difference]: With dead ends: 310 [2020-01-16 18:32:40,117 INFO L226 Difference]: Without dead ends: 294 [2020-01-16 18:32:40,117 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:40,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-01-16 18:32:40,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 187. [2020-01-16 18:32:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 18:32:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 539 transitions. [2020-01-16 18:32:40,121 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 539 transitions. Word has length 19 [2020-01-16 18:32:40,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:40,121 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 539 transitions. [2020-01-16 18:32:40,121 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 539 transitions. [2020-01-16 18:32:40,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:40,122 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:40,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-01-16 18:32:40,122 INFO L426 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-01-16 18:32:40,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:40,122 INFO L82 PathProgramCache]: Analyzing trace with hash 601099510, now seen corresponding path program 370 times [2020-01-16 18:32:40,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:40,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878761937] [2020-01-16 18:32:40,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:40,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:40,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878761937] [2020-01-16 18:32:40,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:40,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:40,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071630753] [2020-01-16 18:32:40,327 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:40,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:40,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:40,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:40,328 INFO L87 Difference]: Start difference. First operand 187 states and 539 transitions. Second operand 8 states. [2020-01-16 18:32:40,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:40,389 INFO L93 Difference]: Finished difference Result 304 states and 735 transitions. [2020-01-16 18:32:40,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:40,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:40,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:40,390 INFO L225 Difference]: With dead ends: 304 [2020-01-16 18:32:40,390 INFO L226 Difference]: Without dead ends: 291 [2020-01-16 18:32:40,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-01-16 18:32:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-01-16 18:32:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 184. [2020-01-16 18:32:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-01-16 18:32:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 532 transitions. [2020-01-16 18:32:40,395 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 532 transitions. Word has length 19 [2020-01-16 18:32:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:40,395 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 532 transitions. [2020-01-16 18:32:40,395 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 532 transitions. [2020-01-16 18:32:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:40,396 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:40,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-01-16 18:32:40,396 INFO L426 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-01-16 18:32:40,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:40,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2030620292, now seen corresponding path program 371 times [2020-01-16 18:32:40,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:40,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104668667] [2020-01-16 18:32:40,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:40,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104668667] [2020-01-16 18:32:40,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:40,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:40,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910543466] [2020-01-16 18:32:40,600 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:40,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:40,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:40,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:40,601 INFO L87 Difference]: Start difference. First operand 184 states and 532 transitions. Second operand 8 states. [2020-01-16 18:32:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:40,686 INFO L93 Difference]: Finished difference Result 305 states and 739 transitions. [2020-01-16 18:32:40,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:40,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:40,687 INFO L225 Difference]: With dead ends: 305 [2020-01-16 18:32:40,687 INFO L226 Difference]: Without dead ends: 291 [2020-01-16 18:32:40,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-01-16 18:32:40,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-01-16 18:32:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 186. [2020-01-16 18:32:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 18:32:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 535 transitions. [2020-01-16 18:32:40,692 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 535 transitions. Word has length 19 [2020-01-16 18:32:40,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:40,692 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 535 transitions. [2020-01-16 18:32:40,693 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 535 transitions. [2020-01-16 18:32:40,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:40,693 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:40,693 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:40,693 INFO L426 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-01-16 18:32:40,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:40,693 INFO L82 PathProgramCache]: Analyzing trace with hash -910490462, now seen corresponding path program 372 times [2020-01-16 18:32:40,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:40,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600896542] [2020-01-16 18:32:40,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:40,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600896542] [2020-01-16 18:32:40,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:40,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:40,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533404377] [2020-01-16 18:32:40,904 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:40,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:40,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:40,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:40,904 INFO L87 Difference]: Start difference. First operand 186 states and 535 transitions. Second operand 8 states. [2020-01-16 18:32:40,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:40,971 INFO L93 Difference]: Finished difference Result 301 states and 728 transitions. [2020-01-16 18:32:40,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:40,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:40,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:40,972 INFO L225 Difference]: With dead ends: 301 [2020-01-16 18:32:40,972 INFO L226 Difference]: Without dead ends: 285 [2020-01-16 18:32:40,973 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:40,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-01-16 18:32:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 180. [2020-01-16 18:32:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-01-16 18:32:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 524 transitions. [2020-01-16 18:32:40,976 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 524 transitions. Word has length 19 [2020-01-16 18:32:40,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:40,977 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 524 transitions. [2020-01-16 18:32:40,977 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:40,977 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 524 transitions. [2020-01-16 18:32:40,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:40,977 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:40,977 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:40,977 INFO L426 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-01-16 18:32:40,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:40,977 INFO L82 PathProgramCache]: Analyzing trace with hash -304821912, now seen corresponding path program 373 times [2020-01-16 18:32:40,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:40,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146396581] [2020-01-16 18:32:40,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:41,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146396581] [2020-01-16 18:32:41,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:41,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:41,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595639495] [2020-01-16 18:32:41,178 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:41,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:41,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:41,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:41,178 INFO L87 Difference]: Start difference. First operand 180 states and 524 transitions. Second operand 8 states. [2020-01-16 18:32:41,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:41,236 INFO L93 Difference]: Finished difference Result 298 states and 719 transitions. [2020-01-16 18:32:41,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:41,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:41,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:41,238 INFO L225 Difference]: With dead ends: 298 [2020-01-16 18:32:41,238 INFO L226 Difference]: Without dead ends: 282 [2020-01-16 18:32:41,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-01-16 18:32:41,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-01-16 18:32:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 185. [2020-01-16 18:32:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-01-16 18:32:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 534 transitions. [2020-01-16 18:32:41,242 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 534 transitions. Word has length 19 [2020-01-16 18:32:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:41,242 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 534 transitions. [2020-01-16 18:32:41,242 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 534 transitions. [2020-01-16 18:32:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:41,243 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:41,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-01-16 18:32:41,243 INFO L426 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-01-16 18:32:41,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:41,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1838418838, now seen corresponding path program 374 times [2020-01-16 18:32:41,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:41,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858768404] [2020-01-16 18:32:41,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:41,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858768404] [2020-01-16 18:32:41,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:41,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:41,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792348942] [2020-01-16 18:32:41,441 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:41,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:41,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:41,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:41,441 INFO L87 Difference]: Start difference. First operand 185 states and 534 transitions. Second operand 8 states. [2020-01-16 18:32:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:41,530 INFO L93 Difference]: Finished difference Result 292 states and 704 transitions. [2020-01-16 18:32:41,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:41,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:41,531 INFO L225 Difference]: With dead ends: 292 [2020-01-16 18:32:41,531 INFO L226 Difference]: Without dead ends: 279 [2020-01-16 18:32:41,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-01-16 18:32:41,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-01-16 18:32:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 182. [2020-01-16 18:32:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-01-16 18:32:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 528 transitions. [2020-01-16 18:32:41,535 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 528 transitions. Word has length 19 [2020-01-16 18:32:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:41,535 INFO L478 AbstractCegarLoop]: Abstraction has 182 states and 528 transitions. [2020-01-16 18:32:41,535 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 528 transitions. [2020-01-16 18:32:41,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:41,535 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:41,535 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:41,536 INFO L426 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-01-16 18:32:41,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:41,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1905259766, now seen corresponding path program 375 times [2020-01-16 18:32:41,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:41,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343968987] [2020-01-16 18:32:41,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:41,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343968987] [2020-01-16 18:32:41,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:41,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:41,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981980483] [2020-01-16 18:32:41,739 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:41,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:41,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:41,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:41,740 INFO L87 Difference]: Start difference. First operand 182 states and 528 transitions. Second operand 8 states. [2020-01-16 18:32:41,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:41,798 INFO L93 Difference]: Finished difference Result 298 states and 717 transitions. [2020-01-16 18:32:41,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:41,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:41,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:41,799 INFO L225 Difference]: With dead ends: 298 [2020-01-16 18:32:41,799 INFO L226 Difference]: Without dead ends: 282 [2020-01-16 18:32:41,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-01-16 18:32:41,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-01-16 18:32:41,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 185. [2020-01-16 18:32:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-01-16 18:32:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 532 transitions. [2020-01-16 18:32:41,804 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 532 transitions. Word has length 19 [2020-01-16 18:32:41,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:41,804 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 532 transitions. [2020-01-16 18:32:41,804 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:41,804 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 532 transitions. [2020-01-16 18:32:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:41,805 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:41,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-01-16 18:32:41,805 INFO L426 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-01-16 18:32:41,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:41,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1646201540, now seen corresponding path program 376 times [2020-01-16 18:32:41,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:41,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004655949] [2020-01-16 18:32:41,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:42,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004655949] [2020-01-16 18:32:42,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:42,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:42,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936565554] [2020-01-16 18:32:42,010 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:42,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:42,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:42,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:42,010 INFO L87 Difference]: Start difference. First operand 185 states and 532 transitions. Second operand 8 states. [2020-01-16 18:32:42,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:42,080 INFO L93 Difference]: Finished difference Result 292 states and 702 transitions. [2020-01-16 18:32:42,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:42,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:42,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:42,082 INFO L225 Difference]: With dead ends: 292 [2020-01-16 18:32:42,082 INFO L226 Difference]: Without dead ends: 279 [2020-01-16 18:32:42,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:42,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-01-16 18:32:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 182. [2020-01-16 18:32:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-01-16 18:32:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 526 transitions. [2020-01-16 18:32:42,087 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 526 transitions. Word has length 19 [2020-01-16 18:32:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:42,087 INFO L478 AbstractCegarLoop]: Abstraction has 182 states and 526 transitions. [2020-01-16 18:32:42,087 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 526 transitions. [2020-01-16 18:32:42,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:42,087 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:42,087 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:42,087 INFO L426 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-01-16 18:32:42,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:42,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1408327434, now seen corresponding path program 377 times [2020-01-16 18:32:42,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:42,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584177514] [2020-01-16 18:32:42,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:42,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584177514] [2020-01-16 18:32:42,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:42,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:42,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178754528] [2020-01-16 18:32:42,295 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:42,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:42,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:42,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:42,296 INFO L87 Difference]: Start difference. First operand 182 states and 526 transitions. Second operand 8 states. [2020-01-16 18:32:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:42,375 INFO L93 Difference]: Finished difference Result 284 states and 686 transitions. [2020-01-16 18:32:42,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:42,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:42,376 INFO L225 Difference]: With dead ends: 284 [2020-01-16 18:32:42,376 INFO L226 Difference]: Without dead ends: 274 [2020-01-16 18:32:42,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-01-16 18:32:42,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-01-16 18:32:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 183. [2020-01-16 18:32:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-01-16 18:32:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 527 transitions. [2020-01-16 18:32:42,380 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 527 transitions. Word has length 19 [2020-01-16 18:32:42,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:42,380 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 527 transitions. [2020-01-16 18:32:42,380 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 527 transitions. [2020-01-16 18:32:42,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:42,381 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:42,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-01-16 18:32:42,381 INFO L426 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-01-16 18:32:42,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:42,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1168685096, now seen corresponding path program 378 times [2020-01-16 18:32:42,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:42,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919417631] [2020-01-16 18:32:42,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:42,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919417631] [2020-01-16 18:32:42,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:42,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:42,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927338868] [2020-01-16 18:32:42,594 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:42,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:42,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:42,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:42,594 INFO L87 Difference]: Start difference. First operand 183 states and 527 transitions. Second operand 8 states. [2020-01-16 18:32:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:42,653 INFO L93 Difference]: Finished difference Result 284 states and 685 transitions. [2020-01-16 18:32:42,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:42,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:42,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:42,655 INFO L225 Difference]: With dead ends: 284 [2020-01-16 18:32:42,655 INFO L226 Difference]: Without dead ends: 271 [2020-01-16 18:32:42,655 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:42,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-01-16 18:32:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 180. [2020-01-16 18:32:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-01-16 18:32:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 522 transitions. [2020-01-16 18:32:42,659 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 522 transitions. Word has length 19 [2020-01-16 18:32:42,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:42,659 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 522 transitions. [2020-01-16 18:32:42,659 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:42,659 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 522 transitions. [2020-01-16 18:32:42,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:42,660 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:42,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-01-16 18:32:42,660 INFO L426 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-01-16 18:32:42,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:42,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1264971302, now seen corresponding path program 379 times [2020-01-16 18:32:42,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:42,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580092630] [2020-01-16 18:32:42,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:42,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580092630] [2020-01-16 18:32:42,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:42,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:42,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870620888] [2020-01-16 18:32:42,864 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:42,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:42,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:42,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:42,865 INFO L87 Difference]: Start difference. First operand 180 states and 522 transitions. Second operand 8 states. [2020-01-16 18:32:42,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:42,948 INFO L93 Difference]: Finished difference Result 288 states and 699 transitions. [2020-01-16 18:32:42,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:42,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:42,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:42,950 INFO L225 Difference]: With dead ends: 288 [2020-01-16 18:32:42,950 INFO L226 Difference]: Without dead ends: 274 [2020-01-16 18:32:42,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:42,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-01-16 18:32:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 183. [2020-01-16 18:32:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-01-16 18:32:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 528 transitions. [2020-01-16 18:32:42,954 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 528 transitions. Word has length 19 [2020-01-16 18:32:42,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:42,954 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 528 transitions. [2020-01-16 18:32:42,954 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:42,954 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 528 transitions. [2020-01-16 18:32:42,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:42,955 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:42,955 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:42,955 INFO L426 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-01-16 18:32:42,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:42,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2139306628, now seen corresponding path program 380 times [2020-01-16 18:32:42,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:42,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638076943] [2020-01-16 18:32:42,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:43,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:43,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638076943] [2020-01-16 18:32:43,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:43,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:43,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705449048] [2020-01-16 18:32:43,186 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:43,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:43,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:43,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:43,187 INFO L87 Difference]: Start difference. First operand 183 states and 528 transitions. Second operand 8 states. [2020-01-16 18:32:43,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:43,264 INFO L93 Difference]: Finished difference Result 284 states and 688 transitions. [2020-01-16 18:32:43,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:43,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:43,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:43,266 INFO L225 Difference]: With dead ends: 284 [2020-01-16 18:32:43,266 INFO L226 Difference]: Without dead ends: 272 [2020-01-16 18:32:43,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:43,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-01-16 18:32:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 181. [2020-01-16 18:32:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-01-16 18:32:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 524 transitions. [2020-01-16 18:32:43,272 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 524 transitions. Word has length 19 [2020-01-16 18:32:43,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:43,272 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 524 transitions. [2020-01-16 18:32:43,272 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:43,272 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 524 transitions. [2020-01-16 18:32:43,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:43,273 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:43,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-01-16 18:32:43,273 INFO L426 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-01-16 18:32:43,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:43,273 INFO L82 PathProgramCache]: Analyzing trace with hash -103949188, now seen corresponding path program 381 times [2020-01-16 18:32:43,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:43,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789939039] [2020-01-16 18:32:43,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:43,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-01-16 18:32:43,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789939039] [2020-01-16 18:32:43,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:43,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:43,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049975295] [2020-01-16 18:32:43,477 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:43,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:43,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:43,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:43,478 INFO L87 Difference]: Start difference. First operand 181 states and 524 transitions. Second operand 8 states. [2020-01-16 18:32:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:43,548 INFO L93 Difference]: Finished difference Result 288 states and 698 transitions. [2020-01-16 18:32:43,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:43,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:43,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:43,550 INFO L225 Difference]: With dead ends: 288 [2020-01-16 18:32:43,550 INFO L226 Difference]: Without dead ends: 274 [2020-01-16 18:32:43,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:43,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-01-16 18:32:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 183. [2020-01-16 18:32:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-01-16 18:32:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 527 transitions. [2020-01-16 18:32:43,555 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 527 transitions. Word has length 19 [2020-01-16 18:32:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:43,555 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 527 transitions. [2020-01-16 18:32:43,555 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 527 transitions. [2020-01-16 18:32:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:43,556 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:43,556 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:43,556 INFO L426 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-01-16 18:32:43,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:43,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1016180642, now seen corresponding path program 382 times [2020-01-16 18:32:43,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:43,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69184860] [2020-01-16 18:32:43,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:43,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69184860] [2020-01-16 18:32:43,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:43,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:43,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072738458] [2020-01-16 18:32:43,765 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:43,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:43,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:43,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:43,766 INFO L87 Difference]: Start difference. First operand 183 states and 527 transitions. Second operand 8 states. [2020-01-16 18:32:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:43,822 INFO L93 Difference]: Finished difference Result 284 states and 687 transitions. [2020-01-16 18:32:43,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:43,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:43,823 INFO L225 Difference]: With dead ends: 284 [2020-01-16 18:32:43,823 INFO L226 Difference]: Without dead ends: 272 [2020-01-16 18:32:43,824 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:43,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-01-16 18:32:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 181. [2020-01-16 18:32:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-01-16 18:32:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 523 transitions. [2020-01-16 18:32:43,828 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 523 transitions. Word has length 19 [2020-01-16 18:32:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:43,829 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 523 transitions. [2020-01-16 18:32:43,829 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 523 transitions. [2020-01-16 18:32:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:43,829 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:43,829 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:43,829 INFO L426 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-01-16 18:32:43,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:43,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1793678558, now seen corresponding path program 383 times [2020-01-16 18:32:43,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:43,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848439278] [2020-01-16 18:32:43,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:44,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848439278] [2020-01-16 18:32:44,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:44,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:44,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062515972] [2020-01-16 18:32:44,034 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:44,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:44,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:44,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:44,035 INFO L87 Difference]: Start difference. First operand 181 states and 523 transitions. Second operand 8 states. [2020-01-16 18:32:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:44,113 INFO L93 Difference]: Finished difference Result 279 states and 676 transitions. [2020-01-16 18:32:44,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:44,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:44,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:44,115 INFO L225 Difference]: With dead ends: 279 [2020-01-16 18:32:44,115 INFO L226 Difference]: Without dead ends: 269 [2020-01-16 18:32:44,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:44,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-01-16 18:32:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 182. [2020-01-16 18:32:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-01-16 18:32:44,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 524 transitions. [2020-01-16 18:32:44,119 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 524 transitions. Word has length 19 [2020-01-16 18:32:44,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:44,119 INFO L478 AbstractCegarLoop]: Abstraction has 182 states and 524 transitions. [2020-01-16 18:32:44,119 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:44,119 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 524 transitions. [2020-01-16 18:32:44,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:44,120 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:44,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-01-16 18:32:44,120 INFO L426 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-01-16 18:32:44,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:44,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1554036220, now seen corresponding path program 384 times [2020-01-16 18:32:44,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:44,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841179156] [2020-01-16 18:32:44,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:44,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841179156] [2020-01-16 18:32:44,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:44,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:44,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011681068] [2020-01-16 18:32:44,345 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:44,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:44,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:44,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:44,345 INFO L87 Difference]: Start difference. First operand 182 states and 524 transitions. Second operand 8 states. [2020-01-16 18:32:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:44,411 INFO L93 Difference]: Finished difference Result 279 states and 675 transitions. [2020-01-16 18:32:44,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:44,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:44,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:44,412 INFO L225 Difference]: With dead ends: 279 [2020-01-16 18:32:44,412 INFO L226 Difference]: Without dead ends: 264 [2020-01-16 18:32:44,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-01-16 18:32:44,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-01-16 18:32:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 177. [2020-01-16 18:32:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-01-16 18:32:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 516 transitions. [2020-01-16 18:32:44,417 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 516 transitions. Word has length 19 [2020-01-16 18:32:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:44,417 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 516 transitions. [2020-01-16 18:32:44,417 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 516 transitions. [2020-01-16 18:32:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:44,418 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:44,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-01-16 18:32:44,418 INFO L426 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-01-16 18:32:44,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:44,418 INFO L82 PathProgramCache]: Analyzing trace with hash 22174086, now seen corresponding path program 385 times [2020-01-16 18:32:44,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:44,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728169209] [2020-01-16 18:32:44,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:44,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728169209] [2020-01-16 18:32:44,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:44,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:44,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265615935] [2020-01-16 18:32:44,618 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:44,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:44,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:44,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:44,619 INFO L87 Difference]: Start difference. First operand 177 states and 516 transitions. Second operand 8 states. [2020-01-16 18:32:44,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:44,677 INFO L93 Difference]: Finished difference Result 321 states and 784 transitions. [2020-01-16 18:32:44,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:44,678 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:44,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:44,678 INFO L225 Difference]: With dead ends: 321 [2020-01-16 18:32:44,679 INFO L226 Difference]: Without dead ends: 305 [2020-01-16 18:32:44,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:44,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-01-16 18:32:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 185. [2020-01-16 18:32:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-01-16 18:32:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 530 transitions. [2020-01-16 18:32:44,683 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 530 transitions. Word has length 19 [2020-01-16 18:32:44,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:44,683 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 530 transitions. [2020-01-16 18:32:44,683 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:44,683 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 530 transitions. [2020-01-16 18:32:44,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:44,683 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:44,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-01-16 18:32:44,684 INFO L426 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-01-16 18:32:44,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:44,684 INFO L82 PathProgramCache]: Analyzing trace with hash 396825272, now seen corresponding path program 386 times [2020-01-16 18:32:44,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:44,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409159704] [2020-01-16 18:32:44,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:44,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409159704] [2020-01-16 18:32:44,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:44,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:44,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026383812] [2020-01-16 18:32:44,884 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:44,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:44,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:44,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:44,884 INFO L87 Difference]: Start difference. First operand 185 states and 530 transitions. Second operand 8 states. [2020-01-16 18:32:44,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:44,965 INFO L93 Difference]: Finished difference Result 319 states and 774 transitions. [2020-01-16 18:32:44,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:44,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:44,966 INFO L225 Difference]: With dead ends: 319 [2020-01-16 18:32:44,967 INFO L226 Difference]: Without dead ends: 297 [2020-01-16 18:32:44,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-01-16 18:32:44,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-01-16 18:32:44,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 177. [2020-01-16 18:32:44,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-01-16 18:32:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 512 transitions. [2020-01-16 18:32:44,971 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 512 transitions. Word has length 19 [2020-01-16 18:32:44,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:44,971 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 512 transitions. [2020-01-16 18:32:44,971 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 512 transitions. [2020-01-16 18:32:44,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:44,971 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:44,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-01-16 18:32:44,971 INFO L426 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-01-16 18:32:44,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:44,972 INFO L82 PathProgramCache]: Analyzing trace with hash 226775168, now seen corresponding path program 387 times [2020-01-16 18:32:44,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:44,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101946720] [2020-01-16 18:32:44,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:45,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101946720] [2020-01-16 18:32:45,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:45,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:45,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359278033] [2020-01-16 18:32:45,165 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:45,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:45,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:45,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:45,166 INFO L87 Difference]: Start difference. First operand 177 states and 512 transitions. Second operand 8 states. [2020-01-16 18:32:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:45,218 INFO L93 Difference]: Finished difference Result 312 states and 757 transitions. [2020-01-16 18:32:45,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:45,219 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:45,219 INFO L225 Difference]: With dead ends: 312 [2020-01-16 18:32:45,220 INFO L226 Difference]: Without dead ends: 296 [2020-01-16 18:32:45,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-01-16 18:32:45,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 180. [2020-01-16 18:32:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-01-16 18:32:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 516 transitions. [2020-01-16 18:32:45,224 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 516 transitions. Word has length 19 [2020-01-16 18:32:45,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:45,224 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 516 transitions. [2020-01-16 18:32:45,224 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 516 transitions. [2020-01-16 18:32:45,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:45,224 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:45,224 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:45,224 INFO L426 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-01-16 18:32:45,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:45,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1924951378, now seen corresponding path program 388 times [2020-01-16 18:32:45,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:45,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478167724] [2020-01-16 18:32:45,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:45,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478167724] [2020-01-16 18:32:45,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:45,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:45,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56906339] [2020-01-16 18:32:45,411 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:45,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:45,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:45,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:45,412 INFO L87 Difference]: Start difference. First operand 180 states and 516 transitions. Second operand 8 states. [2020-01-16 18:32:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:45,489 INFO L93 Difference]: Finished difference Result 306 states and 742 transitions. [2020-01-16 18:32:45,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:45,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:45,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:45,491 INFO L225 Difference]: With dead ends: 306 [2020-01-16 18:32:45,491 INFO L226 Difference]: Without dead ends: 293 [2020-01-16 18:32:45,491 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:45,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-01-16 18:32:45,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 177. [2020-01-16 18:32:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-01-16 18:32:45,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 509 transitions. [2020-01-16 18:32:45,496 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 509 transitions. Word has length 19 [2020-01-16 18:32:45,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:45,496 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 509 transitions. [2020-01-16 18:32:45,496 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:45,496 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 509 transitions. [2020-01-16 18:32:45,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:45,496 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:45,496 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:45,496 INFO L426 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-01-16 18:32:45,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:45,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1171240866, now seen corresponding path program 389 times [2020-01-16 18:32:45,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:45,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239046967] [2020-01-16 18:32:45,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:45,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239046967] [2020-01-16 18:32:45,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:45,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:45,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636687421] [2020-01-16 18:32:45,687 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:45,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:45,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:45,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:45,688 INFO L87 Difference]: Start difference. First operand 177 states and 509 transitions. Second operand 8 states. [2020-01-16 18:32:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:45,763 INFO L93 Difference]: Finished difference Result 307 states and 746 transitions. [2020-01-16 18:32:45,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:45,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:45,764 INFO L225 Difference]: With dead ends: 307 [2020-01-16 18:32:45,764 INFO L226 Difference]: Without dead ends: 293 [2020-01-16 18:32:45,764 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-01-16 18:32:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 179. [2020-01-16 18:32:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-01-16 18:32:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 512 transitions. [2020-01-16 18:32:45,769 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 512 transitions. Word has length 19 [2020-01-16 18:32:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:45,769 INFO L478 AbstractCegarLoop]: Abstraction has 179 states and 512 transitions. [2020-01-16 18:32:45,769 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 512 transitions. [2020-01-16 18:32:45,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:45,770 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:45,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-01-16 18:32:45,770 INFO L426 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-01-16 18:32:45,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:45,770 INFO L82 PathProgramCache]: Analyzing trace with hash -2045576192, now seen corresponding path program 390 times [2020-01-16 18:32:45,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:45,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604077294] [2020-01-16 18:32:45,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:45,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-01-16 18:32:45,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604077294] [2020-01-16 18:32:45,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:45,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:45,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460627023] [2020-01-16 18:32:45,963 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:45,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:45,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:45,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:45,964 INFO L87 Difference]: Start difference. First operand 179 states and 512 transitions. Second operand 8 states. [2020-01-16 18:32:46,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:46,047 INFO L93 Difference]: Finished difference Result 303 states and 735 transitions. [2020-01-16 18:32:46,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:46,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:46,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:46,048 INFO L225 Difference]: With dead ends: 303 [2020-01-16 18:32:46,048 INFO L226 Difference]: Without dead ends: 287 [2020-01-16 18:32:46,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-01-16 18:32:46,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 173. [2020-01-16 18:32:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-01-16 18:32:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 500 transitions. [2020-01-16 18:32:46,052 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 500 transitions. Word has length 19 [2020-01-16 18:32:46,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:46,052 INFO L478 AbstractCegarLoop]: Abstraction has 173 states and 500 transitions. [2020-01-16 18:32:46,052 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:46,052 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 500 transitions. [2020-01-16 18:32:46,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:46,052 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:46,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-01-16 18:32:46,053 INFO L426 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-01-16 18:32:46,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:46,053 INFO L82 PathProgramCache]: Analyzing trace with hash -822797366, now seen corresponding path program 391 times [2020-01-16 18:32:46,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:46,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905795138] [2020-01-16 18:32:46,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:46,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905795138] [2020-01-16 18:32:46,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:46,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:46,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570386620] [2020-01-16 18:32:46,253 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:46,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:46,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:46,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:46,254 INFO L87 Difference]: Start difference. First operand 173 states and 500 transitions. Second operand 8 states. [2020-01-16 18:32:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:46,313 INFO L93 Difference]: Finished difference Result 321 states and 787 transitions. [2020-01-16 18:32:46,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:46,313 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:46,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:46,314 INFO L225 Difference]: With dead ends: 321 [2020-01-16 18:32:46,314 INFO L226 Difference]: Without dead ends: 305 [2020-01-16 18:32:46,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-01-16 18:32:46,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-01-16 18:32:46,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 187. [2020-01-16 18:32:46,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 18:32:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 535 transitions. [2020-01-16 18:32:46,319 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 535 transitions. Word has length 19 [2020-01-16 18:32:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:46,319 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 535 transitions. [2020-01-16 18:32:46,319 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 535 transitions. [2020-01-16 18:32:46,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:46,319 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:46,319 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:46,319 INFO L426 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-01-16 18:32:46,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:46,320 INFO L82 PathProgramCache]: Analyzing trace with hash -448146180, now seen corresponding path program 392 times [2020-01-16 18:32:46,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:46,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627972343] [2020-01-16 18:32:46,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:46,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627972343] [2020-01-16 18:32:46,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:46,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:46,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310373143] [2020-01-16 18:32:46,518 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:46,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:46,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:46,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:46,518 INFO L87 Difference]: Start difference. First operand 187 states and 535 transitions. Second operand 8 states. [2020-01-16 18:32:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:46,592 INFO L93 Difference]: Finished difference Result 319 states and 777 transitions. [2020-01-16 18:32:46,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:46,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:46,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:46,593 INFO L225 Difference]: With dead ends: 319 [2020-01-16 18:32:46,593 INFO L226 Difference]: Without dead ends: 297 [2020-01-16 18:32:46,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:46,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-01-16 18:32:46,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 179. [2020-01-16 18:32:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-01-16 18:32:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 515 transitions. [2020-01-16 18:32:46,597 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 515 transitions. Word has length 19 [2020-01-16 18:32:46,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:46,597 INFO L478 AbstractCegarLoop]: Abstraction has 179 states and 515 transitions. [2020-01-16 18:32:46,597 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:46,597 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 515 transitions. [2020-01-16 18:32:46,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:46,598 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:46,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-01-16 18:32:46,598 INFO L426 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-01-16 18:32:46,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:46,598 INFO L82 PathProgramCache]: Analyzing trace with hash 32996164, now seen corresponding path program 393 times [2020-01-16 18:32:46,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:46,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263332258] [2020-01-16 18:32:46,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:46,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263332258] [2020-01-16 18:32:46,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:46,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:46,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100720254] [2020-01-16 18:32:46,792 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:46,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:46,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:46,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:46,792 INFO L87 Difference]: Start difference. First operand 179 states and 515 transitions. Second operand 8 states. [2020-01-16 18:32:46,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:46,850 INFO L93 Difference]: Finished difference Result 308 states and 755 transitions. [2020-01-16 18:32:46,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:46,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:46,851 INFO L225 Difference]: With dead ends: 308 [2020-01-16 18:32:46,851 INFO L226 Difference]: Without dead ends: 292 [2020-01-16 18:32:46,851 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-01-16 18:32:46,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 184. [2020-01-16 18:32:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-01-16 18:32:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 524 transitions. [2020-01-16 18:32:46,856 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 524 transitions. Word has length 19 [2020-01-16 18:32:46,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:46,856 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 524 transitions. [2020-01-16 18:32:46,856 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 524 transitions. [2020-01-16 18:32:46,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:46,857 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:46,857 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:46,857 INFO L426 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-01-16 18:32:46,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:46,857 INFO L82 PathProgramCache]: Analyzing trace with hash -718065930, now seen corresponding path program 394 times [2020-01-16 18:32:46,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:46,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027132481] [2020-01-16 18:32:46,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:47,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:47,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027132481] [2020-01-16 18:32:47,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:47,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:47,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749110740] [2020-01-16 18:32:47,057 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:47,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:47,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:47,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:47,058 INFO L87 Difference]: Start difference. First operand 184 states and 524 transitions. Second operand 8 states. [2020-01-16 18:32:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:47,136 INFO L93 Difference]: Finished difference Result 295 states and 734 transitions. [2020-01-16 18:32:47,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:47,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:47,138 INFO L225 Difference]: With dead ends: 295 [2020-01-16 18:32:47,138 INFO L226 Difference]: Without dead ends: 278 [2020-01-16 18:32:47,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-01-16 18:32:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-01-16 18:32:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 179. [2020-01-16 18:32:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-01-16 18:32:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 510 transitions. [2020-01-16 18:32:47,142 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 510 transitions. Word has length 19 [2020-01-16 18:32:47,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:47,143 INFO L478 AbstractCegarLoop]: Abstraction has 179 states and 510 transitions. [2020-01-16 18:32:47,143 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 510 transitions. [2020-01-16 18:32:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:47,143 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:47,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-01-16 18:32:47,143 INFO L426 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-01-16 18:32:47,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:47,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1988186406, now seen corresponding path program 395 times [2020-01-16 18:32:47,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:47,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871860670] [2020-01-16 18:32:47,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:47,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871860670] [2020-01-16 18:32:47,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:47,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:47,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118054921] [2020-01-16 18:32:47,330 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:47,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:47,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:47,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:47,331 INFO L87 Difference]: Start difference. First operand 179 states and 510 transitions. Second operand 8 states. [2020-01-16 18:32:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:47,409 INFO L93 Difference]: Finished difference Result 305 states and 745 transitions. [2020-01-16 18:32:47,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:47,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:47,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:47,411 INFO L225 Difference]: With dead ends: 305 [2020-01-16 18:32:47,411 INFO L226 Difference]: Without dead ends: 291 [2020-01-16 18:32:47,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-01-16 18:32:47,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-01-16 18:32:47,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 183. [2020-01-16 18:32:47,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-01-16 18:32:47,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 518 transitions. [2020-01-16 18:32:47,415 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 518 transitions. Word has length 19 [2020-01-16 18:32:47,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:47,415 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 518 transitions. [2020-01-16 18:32:47,415 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:47,415 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 518 transitions. [2020-01-16 18:32:47,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:47,415 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:47,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-01-16 18:32:47,415 INFO L426 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-01-16 18:32:47,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:47,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1988781052, now seen corresponding path program 396 times [2020-01-16 18:32:47,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:47,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805133560] [2020-01-16 18:32:47,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:47,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805133560] [2020-01-16 18:32:47,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:47,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:47,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106278029] [2020-01-16 18:32:47,605 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:47,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:47,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:47,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:47,605 INFO L87 Difference]: Start difference. First operand 183 states and 518 transitions. Second operand 8 states. [2020-01-16 18:32:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:47,683 INFO L93 Difference]: Finished difference Result 294 states and 728 transitions. [2020-01-16 18:32:47,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:47,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:47,684 INFO L225 Difference]: With dead ends: 294 [2020-01-16 18:32:47,684 INFO L226 Difference]: Without dead ends: 272 [2020-01-16 18:32:47,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-01-16 18:32:47,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-01-16 18:32:47,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 173. [2020-01-16 18:32:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-01-16 18:32:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 496 transitions. [2020-01-16 18:32:47,688 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 496 transitions. Word has length 19 [2020-01-16 18:32:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:47,689 INFO L478 AbstractCegarLoop]: Abstraction has 173 states and 496 transitions. [2020-01-16 18:32:47,689 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:47,689 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 496 transitions. [2020-01-16 18:32:47,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:47,689 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:47,689 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:47,689 INFO L426 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-01-16 18:32:47,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:47,690 INFO L82 PathProgramCache]: Analyzing trace with hash 986570822, now seen corresponding path program 397 times [2020-01-16 18:32:47,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:47,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416355676] [2020-01-16 18:32:47,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:47,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416355676] [2020-01-16 18:32:47,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:47,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:47,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361814018] [2020-01-16 18:32:47,881 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:47,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:47,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:47,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:47,882 INFO L87 Difference]: Start difference. First operand 173 states and 496 transitions. Second operand 8 states. [2020-01-16 18:32:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:47,941 INFO L93 Difference]: Finished difference Result 303 states and 733 transitions. [2020-01-16 18:32:47,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:47,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:47,942 INFO L225 Difference]: With dead ends: 303 [2020-01-16 18:32:47,942 INFO L226 Difference]: Without dead ends: 287 [2020-01-16 18:32:47,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-01-16 18:32:47,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-01-16 18:32:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 179. [2020-01-16 18:32:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-01-16 18:32:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 510 transitions. [2020-01-16 18:32:47,946 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 510 transitions. Word has length 19 [2020-01-16 18:32:47,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:47,947 INFO L478 AbstractCegarLoop]: Abstraction has 179 states and 510 transitions. [2020-01-16 18:32:47,947 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 510 transitions. [2020-01-16 18:32:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:47,947 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:47,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-01-16 18:32:47,947 INFO L426 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-01-16 18:32:47,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:47,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1165155724, now seen corresponding path program 398 times [2020-01-16 18:32:47,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:47,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399930574] [2020-01-16 18:32:47,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:48,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399930574] [2020-01-16 18:32:48,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:48,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:48,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317608223] [2020-01-16 18:32:48,152 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:48,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:48,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:48,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:48,153 INFO L87 Difference]: Start difference. First operand 179 states and 510 transitions. Second operand 8 states. [2020-01-16 18:32:48,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:48,240 INFO L93 Difference]: Finished difference Result 297 states and 718 transitions. [2020-01-16 18:32:48,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:48,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:48,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:48,241 INFO L225 Difference]: With dead ends: 297 [2020-01-16 18:32:48,241 INFO L226 Difference]: Without dead ends: 284 [2020-01-16 18:32:48,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:48,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-01-16 18:32:48,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 176. [2020-01-16 18:32:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-01-16 18:32:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 503 transitions. [2020-01-16 18:32:48,245 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 503 transitions. Word has length 19 [2020-01-16 18:32:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:48,245 INFO L478 AbstractCegarLoop]: Abstraction has 176 states and 503 transitions. [2020-01-16 18:32:48,245 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 503 transitions. [2020-01-16 18:32:48,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:48,246 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:48,246 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:48,246 INFO L426 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-01-16 18:32:48,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:48,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2080662410, now seen corresponding path program 399 times [2020-01-16 18:32:48,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:48,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146181905] [2020-01-16 18:32:48,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:48,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146181905] [2020-01-16 18:32:48,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:48,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:48,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976086426] [2020-01-16 18:32:48,455 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:48,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:48,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:48,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:48,455 INFO L87 Difference]: Start difference. First operand 176 states and 503 transitions. Second operand 8 states. [2020-01-16 18:32:48,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:48,513 INFO L93 Difference]: Finished difference Result 299 states and 727 transitions. [2020-01-16 18:32:48,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:48,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:48,515 INFO L225 Difference]: With dead ends: 299 [2020-01-16 18:32:48,515 INFO L226 Difference]: Without dead ends: 283 [2020-01-16 18:32:48,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-01-16 18:32:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-01-16 18:32:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 181. [2020-01-16 18:32:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-01-16 18:32:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 512 transitions. [2020-01-16 18:32:48,519 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 512 transitions. Word has length 19 [2020-01-16 18:32:48,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:48,520 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 512 transitions. [2020-01-16 18:32:48,520 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 512 transitions. [2020-01-16 18:32:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:48,520 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:48,520 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:48,520 INFO L426 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-01-16 18:32:48,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:48,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1329600316, now seen corresponding path program 400 times [2020-01-16 18:32:48,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:48,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897169716] [2020-01-16 18:32:48,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:48,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:48,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897169716] [2020-01-16 18:32:48,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:48,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:48,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112705144] [2020-01-16 18:32:48,723 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:48,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:48,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:48,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:48,723 INFO L87 Difference]: Start difference. First operand 181 states and 512 transitions. Second operand 8 states. [2020-01-16 18:32:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:48,807 INFO L93 Difference]: Finished difference Result 286 states and 706 transitions. [2020-01-16 18:32:48,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:48,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:48,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:48,808 INFO L225 Difference]: With dead ends: 286 [2020-01-16 18:32:48,808 INFO L226 Difference]: Without dead ends: 269 [2020-01-16 18:32:48,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-01-16 18:32:48,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 176. [2020-01-16 18:32:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-01-16 18:32:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 500 transitions. [2020-01-16 18:32:48,812 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 500 transitions. Word has length 19 [2020-01-16 18:32:48,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:48,812 INFO L478 AbstractCegarLoop]: Abstraction has 176 states and 500 transitions. [2020-01-16 18:32:48,812 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 500 transitions. [2020-01-16 18:32:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:48,813 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:48,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-01-16 18:32:48,813 INFO L426 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-01-16 18:32:48,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:48,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1804719824, now seen corresponding path program 401 times [2020-01-16 18:32:48,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:48,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67324530] [2020-01-16 18:32:48,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:49,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:49,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67324530] [2020-01-16 18:32:49,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:49,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:49,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969361183] [2020-01-16 18:32:49,003 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:49,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:49,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:49,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:49,003 INFO L87 Difference]: Start difference. First operand 176 states and 500 transitions. Second operand 8 states. [2020-01-16 18:32:49,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:49,076 INFO L93 Difference]: Finished difference Result 290 states and 703 transitions. [2020-01-16 18:32:49,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:49,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:49,077 INFO L225 Difference]: With dead ends: 290 [2020-01-16 18:32:49,077 INFO L226 Difference]: Without dead ends: 280 [2020-01-16 18:32:49,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-01-16 18:32:49,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-01-16 18:32:49,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 178. [2020-01-16 18:32:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-01-16 18:32:49,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 503 transitions. [2020-01-16 18:32:49,082 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 503 transitions. Word has length 19 [2020-01-16 18:32:49,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:49,082 INFO L478 AbstractCegarLoop]: Abstraction has 178 states and 503 transitions. [2020-01-16 18:32:49,082 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:49,082 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 503 transitions. [2020-01-16 18:32:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:49,083 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:49,083 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:49,083 INFO L426 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-01-16 18:32:49,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:49,083 INFO L82 PathProgramCache]: Analyzing trace with hash -94106516, now seen corresponding path program 402 times [2020-01-16 18:32:49,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:49,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985343488] [2020-01-16 18:32:49,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:49,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985343488] [2020-01-16 18:32:49,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:49,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:49,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668821436] [2020-01-16 18:32:49,279 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:49,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:49,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:49,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:49,279 INFO L87 Difference]: Start difference. First operand 178 states and 503 transitions. Second operand 8 states. [2020-01-16 18:32:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:49,355 INFO L93 Difference]: Finished difference Result 283 states and 697 transitions. [2020-01-16 18:32:49,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:49,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:49,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:49,356 INFO L225 Difference]: With dead ends: 283 [2020-01-16 18:32:49,356 INFO L226 Difference]: Without dead ends: 266 [2020-01-16 18:32:49,357 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:49,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-01-16 18:32:49,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 173. [2020-01-16 18:32:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-01-16 18:32:49,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 493 transitions. [2020-01-16 18:32:49,361 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 493 transitions. Word has length 19 [2020-01-16 18:32:49,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:49,361 INFO L478 AbstractCegarLoop]: Abstraction has 173 states and 493 transitions. [2020-01-16 18:32:49,361 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:49,361 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 493 transitions. [2020-01-16 18:32:49,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:49,362 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:49,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-01-16 18:32:49,362 INFO L426 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-01-16 18:32:49,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:49,362 INFO L82 PathProgramCache]: Analyzing trace with hash 196668370, now seen corresponding path program 403 times [2020-01-16 18:32:49,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:49,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637467870] [2020-01-16 18:32:49,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:49,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637467870] [2020-01-16 18:32:49,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:49,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:49,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827070151] [2020-01-16 18:32:49,536 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:49,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:49,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:49,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:49,536 INFO L87 Difference]: Start difference. First operand 173 states and 493 transitions. Second operand 8 states. [2020-01-16 18:32:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:49,611 INFO L93 Difference]: Finished difference Result 294 states and 714 transitions. [2020-01-16 18:32:49,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:49,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:49,612 INFO L225 Difference]: With dead ends: 294 [2020-01-16 18:32:49,612 INFO L226 Difference]: Without dead ends: 280 [2020-01-16 18:32:49,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:49,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-01-16 18:32:49,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 177. [2020-01-16 18:32:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-01-16 18:32:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 503 transitions. [2020-01-16 18:32:49,616 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 503 transitions. Word has length 19 [2020-01-16 18:32:49,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:49,616 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 503 transitions. [2020-01-16 18:32:49,616 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:49,616 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 503 transitions. [2020-01-16 18:32:49,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:49,616 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:49,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-01-16 18:32:49,617 INFO L426 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-01-16 18:32:49,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:49,617 INFO L82 PathProgramCache]: Analyzing trace with hash -677666956, now seen corresponding path program 404 times [2020-01-16 18:32:49,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:49,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686368392] [2020-01-16 18:32:49,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:49,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-01-16 18:32:49,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686368392] [2020-01-16 18:32:49,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:49,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:49,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497914193] [2020-01-16 18:32:49,792 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:49,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:49,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:49,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:49,792 INFO L87 Difference]: Start difference. First operand 177 states and 503 transitions. Second operand 8 states. [2020-01-16 18:32:49,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:49,866 INFO L93 Difference]: Finished difference Result 290 states and 703 transitions. [2020-01-16 18:32:49,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:49,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:49,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:49,867 INFO L225 Difference]: With dead ends: 290 [2020-01-16 18:32:49,867 INFO L226 Difference]: Without dead ends: 278 [2020-01-16 18:32:49,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-01-16 18:32:49,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-01-16 18:32:49,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 175. [2020-01-16 18:32:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-01-16 18:32:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 498 transitions. [2020-01-16 18:32:49,872 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 498 transitions. Word has length 19 [2020-01-16 18:32:49,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:49,872 INFO L478 AbstractCegarLoop]: Abstraction has 175 states and 498 transitions. [2020-01-16 18:32:49,873 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 498 transitions. [2020-01-16 18:32:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:49,873 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:49,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-01-16 18:32:49,873 INFO L426 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-01-16 18:32:49,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:49,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1686073366, now seen corresponding path program 405 times [2020-01-16 18:32:49,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:49,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884873029] [2020-01-16 18:32:49,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:50,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:50,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884873029] [2020-01-16 18:32:50,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:50,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:50,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133028185] [2020-01-16 18:32:50,048 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:50,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:50,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:50,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:50,049 INFO L87 Difference]: Start difference. First operand 175 states and 498 transitions. Second operand 8 states. [2020-01-16 18:32:50,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:50,127 INFO L93 Difference]: Finished difference Result 292 states and 712 transitions. [2020-01-16 18:32:50,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:50,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:50,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:50,128 INFO L225 Difference]: With dead ends: 292 [2020-01-16 18:32:50,129 INFO L226 Difference]: Without dead ends: 278 [2020-01-16 18:32:50,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:50,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-01-16 18:32:50,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 179. [2020-01-16 18:32:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-01-16 18:32:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 506 transitions. [2020-01-16 18:32:50,133 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 506 transitions. Word has length 19 [2020-01-16 18:32:50,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:50,133 INFO L478 AbstractCegarLoop]: Abstraction has 179 states and 506 transitions. [2020-01-16 18:32:50,134 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:50,134 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 506 transitions. [2020-01-16 18:32:50,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:50,134 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:50,134 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:50,134 INFO L426 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-01-16 18:32:50,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:50,134 INFO L82 PathProgramCache]: Analyzing trace with hash 940776222, now seen corresponding path program 406 times [2020-01-16 18:32:50,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:50,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260483575] [2020-01-16 18:32:50,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:50,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260483575] [2020-01-16 18:32:50,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:50,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:50,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982914778] [2020-01-16 18:32:50,308 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:50,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:50,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:50,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:50,308 INFO L87 Difference]: Start difference. First operand 179 states and 506 transitions. Second operand 8 states. [2020-01-16 18:32:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:50,388 INFO L93 Difference]: Finished difference Result 281 states and 695 transitions. [2020-01-16 18:32:50,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:50,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:50,389 INFO L225 Difference]: With dead ends: 281 [2020-01-16 18:32:50,389 INFO L226 Difference]: Without dead ends: 265 [2020-01-16 18:32:50,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-01-16 18:32:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-01-16 18:32:50,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 175. [2020-01-16 18:32:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-01-16 18:32:50,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 496 transitions. [2020-01-16 18:32:50,394 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 496 transitions. Word has length 19 [2020-01-16 18:32:50,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:50,394 INFO L478 AbstractCegarLoop]: Abstraction has 175 states and 496 transitions. [2020-01-16 18:32:50,394 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 496 transitions. [2020-01-16 18:32:50,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:50,395 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:50,395 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:50,395 INFO L426 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-01-16 18:32:50,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:50,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1249121762, now seen corresponding path program 407 times [2020-01-16 18:32:50,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:50,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258562963] [2020-01-16 18:32:50,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:50,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258562963] [2020-01-16 18:32:50,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:50,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:50,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909950360] [2020-01-16 18:32:50,574 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:50,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:50,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:50,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:50,575 INFO L87 Difference]: Start difference. First operand 175 states and 496 transitions. Second operand 8 states. [2020-01-16 18:32:50,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:50,646 INFO L93 Difference]: Finished difference Result 286 states and 694 transitions. [2020-01-16 18:32:50,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:50,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:50,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:50,648 INFO L225 Difference]: With dead ends: 286 [2020-01-16 18:32:50,648 INFO L226 Difference]: Without dead ends: 276 [2020-01-16 18:32:50,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-01-16 18:32:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 177. [2020-01-16 18:32:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-01-16 18:32:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 499 transitions. [2020-01-16 18:32:50,652 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 499 transitions. Word has length 19 [2020-01-16 18:32:50,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:50,652 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 499 transitions. [2020-01-16 18:32:50,652 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 499 transitions. [2020-01-16 18:32:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:50,652 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:50,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-01-16 18:32:50,652 INFO L426 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-01-16 18:32:50,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:50,653 INFO L82 PathProgramCache]: Analyzing trace with hash 461491546, now seen corresponding path program 408 times [2020-01-16 18:32:50,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:50,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613795408] [2020-01-16 18:32:50,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:50,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613795408] [2020-01-16 18:32:50,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:50,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:50,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585384283] [2020-01-16 18:32:50,833 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:50,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:50,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:50,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:50,833 INFO L87 Difference]: Start difference. First operand 177 states and 499 transitions. Second operand 8 states. [2020-01-16 18:32:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:50,915 INFO L93 Difference]: Finished difference Result 279 states and 688 transitions. [2020-01-16 18:32:50,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:50,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:50,916 INFO L225 Difference]: With dead ends: 279 [2020-01-16 18:32:50,916 INFO L226 Difference]: Without dead ends: 259 [2020-01-16 18:32:50,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:50,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-01-16 18:32:50,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 169. [2020-01-16 18:32:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-01-16 18:32:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 485 transitions. [2020-01-16 18:32:50,920 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 485 transitions. Word has length 19 [2020-01-16 18:32:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:50,920 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 485 transitions. [2020-01-16 18:32:50,920 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:50,921 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 485 transitions. [2020-01-16 18:32:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:50,921 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:50,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-01-16 18:32:50,921 INFO L426 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-01-16 18:32:50,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:50,921 INFO L82 PathProgramCache]: Analyzing trace with hash -612467258, now seen corresponding path program 409 times [2020-01-16 18:32:50,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:50,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782658537] [2020-01-16 18:32:50,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:51,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782658537] [2020-01-16 18:32:51,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:51,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:51,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188840999] [2020-01-16 18:32:51,120 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:51,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:51,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:51,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:51,121 INFO L87 Difference]: Start difference. First operand 169 states and 485 transitions. Second operand 8 states. [2020-01-16 18:32:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:51,176 INFO L93 Difference]: Finished difference Result 305 states and 732 transitions. [2020-01-16 18:32:51,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:51,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:51,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:51,177 INFO L225 Difference]: With dead ends: 305 [2020-01-16 18:32:51,177 INFO L226 Difference]: Without dead ends: 289 [2020-01-16 18:32:51,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:51,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-01-16 18:32:51,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 177. [2020-01-16 18:32:51,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-01-16 18:32:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 499 transitions. [2020-01-16 18:32:51,182 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 499 transitions. Word has length 19 [2020-01-16 18:32:51,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:51,182 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 499 transitions. [2020-01-16 18:32:51,182 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:51,182 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 499 transitions. [2020-01-16 18:32:51,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:51,182 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:51,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-01-16 18:32:51,182 INFO L426 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-01-16 18:32:51,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:51,183 INFO L82 PathProgramCache]: Analyzing trace with hash -237816072, now seen corresponding path program 410 times [2020-01-16 18:32:51,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:51,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231667652] [2020-01-16 18:32:51,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:51,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231667652] [2020-01-16 18:32:51,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:51,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:51,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50291127] [2020-01-16 18:32:51,378 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:51,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:51,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:51,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:51,378 INFO L87 Difference]: Start difference. First operand 177 states and 499 transitions. Second operand 8 states. [2020-01-16 18:32:51,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:51,456 INFO L93 Difference]: Finished difference Result 303 states and 722 transitions. [2020-01-16 18:32:51,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:51,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:51,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:51,458 INFO L225 Difference]: With dead ends: 303 [2020-01-16 18:32:51,458 INFO L226 Difference]: Without dead ends: 281 [2020-01-16 18:32:51,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-01-16 18:32:51,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-01-16 18:32:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 169. [2020-01-16 18:32:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-01-16 18:32:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 481 transitions. [2020-01-16 18:32:51,463 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 481 transitions. Word has length 19 [2020-01-16 18:32:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:51,463 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 481 transitions. [2020-01-16 18:32:51,463 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 481 transitions. [2020-01-16 18:32:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:51,463 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:51,463 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:51,464 INFO L426 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-01-16 18:32:51,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:51,464 INFO L82 PathProgramCache]: Analyzing trace with hash -82269952, now seen corresponding path program 411 times [2020-01-16 18:32:51,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:51,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503708067] [2020-01-16 18:32:51,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:51,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-01-16 18:32:51,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503708067] [2020-01-16 18:32:51,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:51,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:51,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130837374] [2020-01-16 18:32:51,656 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:51,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:51,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:51,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:51,656 INFO L87 Difference]: Start difference. First operand 169 states and 481 transitions. Second operand 8 states. [2020-01-16 18:32:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:51,712 INFO L93 Difference]: Finished difference Result 296 states and 705 transitions. [2020-01-16 18:32:51,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:51,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:51,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:51,713 INFO L225 Difference]: With dead ends: 296 [2020-01-16 18:32:51,713 INFO L226 Difference]: Without dead ends: 280 [2020-01-16 18:32:51,713 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:51,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-01-16 18:32:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 172. [2020-01-16 18:32:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-01-16 18:32:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 485 transitions. [2020-01-16 18:32:51,717 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 485 transitions. Word has length 19 [2020-01-16 18:32:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:51,717 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 485 transitions. [2020-01-16 18:32:51,717 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:51,717 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 485 transitions. [2020-01-16 18:32:51,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:51,718 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:51,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-01-16 18:32:51,718 INFO L426 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-01-16 18:32:51,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:51,718 INFO L82 PathProgramCache]: Analyzing trace with hash 176788274, now seen corresponding path program 412 times [2020-01-16 18:32:51,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:51,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961338017] [2020-01-16 18:32:51,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:51,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961338017] [2020-01-16 18:32:51,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:51,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:51,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396837408] [2020-01-16 18:32:51,911 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:51,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:51,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:51,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:51,912 INFO L87 Difference]: Start difference. First operand 172 states and 485 transitions. Second operand 8 states. [2020-01-16 18:32:51,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:51,970 INFO L93 Difference]: Finished difference Result 290 states and 690 transitions. [2020-01-16 18:32:51,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:51,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:51,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:51,971 INFO L225 Difference]: With dead ends: 290 [2020-01-16 18:32:51,971 INFO L226 Difference]: Without dead ends: 277 [2020-01-16 18:32:51,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:51,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-01-16 18:32:51,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 169. [2020-01-16 18:32:51,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-01-16 18:32:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 478 transitions. [2020-01-16 18:32:51,976 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 478 transitions. Word has length 19 [2020-01-16 18:32:51,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:51,976 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 478 transitions. [2020-01-16 18:32:51,976 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:51,976 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 478 transitions. [2020-01-16 18:32:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:51,977 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:51,977 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:51,977 INFO L426 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-01-16 18:32:51,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:51,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1840035768, now seen corresponding path program 413 times [2020-01-16 18:32:51,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:51,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771320083] [2020-01-16 18:32:51,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:52,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:52,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771320083] [2020-01-16 18:32:52,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:52,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:52,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162961636] [2020-01-16 18:32:52,163 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:52,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:52,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:52,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:52,163 INFO L87 Difference]: Start difference. First operand 169 states and 478 transitions. Second operand 8 states. [2020-01-16 18:32:52,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:52,238 INFO L93 Difference]: Finished difference Result 291 states and 694 transitions. [2020-01-16 18:32:52,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:52,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:52,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:52,239 INFO L225 Difference]: With dead ends: 291 [2020-01-16 18:32:52,239 INFO L226 Difference]: Without dead ends: 277 [2020-01-16 18:32:52,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:52,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-01-16 18:32:52,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 171. [2020-01-16 18:32:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-01-16 18:32:52,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 481 transitions. [2020-01-16 18:32:52,243 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 481 transitions. Word has length 19 [2020-01-16 18:32:52,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:52,243 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 481 transitions. [2020-01-16 18:32:52,244 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 481 transitions. [2020-01-16 18:32:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:52,244 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:52,244 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:52,244 INFO L426 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-01-16 18:32:52,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:52,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1334801698, now seen corresponding path program 414 times [2020-01-16 18:32:52,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:52,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136449931] [2020-01-16 18:32:52,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:52,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-01-16 18:32:52,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136449931] [2020-01-16 18:32:52,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:52,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:52,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57877292] [2020-01-16 18:32:52,435 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:52,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:52,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:52,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:52,436 INFO L87 Difference]: Start difference. First operand 171 states and 481 transitions. Second operand 8 states. [2020-01-16 18:32:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:52,490 INFO L93 Difference]: Finished difference Result 287 states and 683 transitions. [2020-01-16 18:32:52,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:52,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:52,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:52,491 INFO L225 Difference]: With dead ends: 287 [2020-01-16 18:32:52,491 INFO L226 Difference]: Without dead ends: 271 [2020-01-16 18:32:52,491 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-01-16 18:32:52,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 165. [2020-01-16 18:32:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-01-16 18:32:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 469 transitions. [2020-01-16 18:32:52,495 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 469 transitions. Word has length 19 [2020-01-16 18:32:52,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:52,495 INFO L478 AbstractCegarLoop]: Abstraction has 165 states and 469 transitions. [2020-01-16 18:32:52,495 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 469 transitions. [2020-01-16 18:32:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:52,496 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:52,496 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:52,496 INFO L426 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-01-16 18:32:52,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:52,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1034952984, now seen corresponding path program 415 times [2020-01-16 18:32:52,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:52,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679246014] [2020-01-16 18:32:52,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:52,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-01-16 18:32:52,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679246014] [2020-01-16 18:32:52,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:52,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:52,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618670309] [2020-01-16 18:32:52,701 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:52,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:52,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:52,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:52,702 INFO L87 Difference]: Start difference. First operand 165 states and 469 transitions. Second operand 8 states. [2020-01-16 18:32:52,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:52,758 INFO L93 Difference]: Finished difference Result 299 states and 714 transitions. [2020-01-16 18:32:52,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:52,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:52,760 INFO L225 Difference]: With dead ends: 299 [2020-01-16 18:32:52,760 INFO L226 Difference]: Without dead ends: 283 [2020-01-16 18:32:52,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-01-16 18:32:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-01-16 18:32:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 165. [2020-01-16 18:32:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-01-16 18:32:52,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 462 transitions. [2020-01-16 18:32:52,764 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 462 transitions. Word has length 19 [2020-01-16 18:32:52,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:52,764 INFO L478 AbstractCegarLoop]: Abstraction has 165 states and 462 transitions. [2020-01-16 18:32:52,764 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 462 transitions. [2020-01-16 18:32:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:52,764 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:52,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-01-16 18:32:52,764 INFO L426 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-01-16 18:32:52,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:52,765 INFO L82 PathProgramCache]: Analyzing trace with hash -660301798, now seen corresponding path program 416 times [2020-01-16 18:32:52,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:52,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321549417] [2020-01-16 18:32:52,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:52,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321549417] [2020-01-16 18:32:52,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:52,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:52,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48052728] [2020-01-16 18:32:52,960 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:52,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:52,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:52,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:52,961 INFO L87 Difference]: Start difference. First operand 165 states and 462 transitions. Second operand 8 states. [2020-01-16 18:32:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:53,034 INFO L93 Difference]: Finished difference Result 297 states and 704 transitions. [2020-01-16 18:32:53,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:53,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:53,035 INFO L225 Difference]: With dead ends: 297 [2020-01-16 18:32:53,035 INFO L226 Difference]: Without dead ends: 275 [2020-01-16 18:32:53,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-01-16 18:32:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-01-16 18:32:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 157. [2020-01-16 18:32:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-01-16 18:32:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 442 transitions. [2020-01-16 18:32:53,039 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 442 transitions. Word has length 19 [2020-01-16 18:32:53,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:53,039 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 442 transitions. [2020-01-16 18:32:53,039 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:53,040 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 442 transitions. [2020-01-16 18:32:53,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:53,040 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:53,040 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:53,040 INFO L426 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-01-16 18:32:53,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:53,040 INFO L82 PathProgramCache]: Analyzing trace with hash -179159454, now seen corresponding path program 417 times [2020-01-16 18:32:53,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:53,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749312515] [2020-01-16 18:32:53,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:53,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-01-16 18:32:53,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749312515] [2020-01-16 18:32:53,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:53,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:53,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141291104] [2020-01-16 18:32:53,246 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:53,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:53,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:53,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:53,246 INFO L87 Difference]: Start difference. First operand 157 states and 442 transitions. Second operand 8 states. [2020-01-16 18:32:53,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:53,306 INFO L93 Difference]: Finished difference Result 286 states and 682 transitions. [2020-01-16 18:32:53,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:53,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:53,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:53,307 INFO L225 Difference]: With dead ends: 286 [2020-01-16 18:32:53,308 INFO L226 Difference]: Without dead ends: 270 [2020-01-16 18:32:53,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-01-16 18:32:53,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 162. [2020-01-16 18:32:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-01-16 18:32:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 451 transitions. [2020-01-16 18:32:53,312 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 451 transitions. Word has length 19 [2020-01-16 18:32:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:53,312 INFO L478 AbstractCegarLoop]: Abstraction has 162 states and 451 transitions. [2020-01-16 18:32:53,312 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:53,313 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 451 transitions. [2020-01-16 18:32:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:53,313 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:53,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-01-16 18:32:53,313 INFO L426 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-01-16 18:32:53,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:53,313 INFO L82 PathProgramCache]: Analyzing trace with hash -930221548, now seen corresponding path program 418 times [2020-01-16 18:32:53,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:53,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929006719] [2020-01-16 18:32:53,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:53,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929006719] [2020-01-16 18:32:53,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:53,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:53,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527483204] [2020-01-16 18:32:53,506 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:53,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:53,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:53,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:53,507 INFO L87 Difference]: Start difference. First operand 162 states and 451 transitions. Second operand 8 states. [2020-01-16 18:32:53,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:53,584 INFO L93 Difference]: Finished difference Result 273 states and 661 transitions. [2020-01-16 18:32:53,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:53,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:53,585 INFO L225 Difference]: With dead ends: 273 [2020-01-16 18:32:53,585 INFO L226 Difference]: Without dead ends: 256 [2020-01-16 18:32:53,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:53,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-01-16 18:32:53,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 157. [2020-01-16 18:32:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-01-16 18:32:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 437 transitions. [2020-01-16 18:32:53,589 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 437 transitions. Word has length 19 [2020-01-16 18:32:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:53,589 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 437 transitions. [2020-01-16 18:32:53,589 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 437 transitions. [2020-01-16 18:32:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:53,590 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:53,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-01-16 18:32:53,590 INFO L426 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-01-16 18:32:53,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:53,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2094625272, now seen corresponding path program 419 times [2020-01-16 18:32:53,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:53,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934944332] [2020-01-16 18:32:53,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:53,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934944332] [2020-01-16 18:32:53,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:53,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:53,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833958371] [2020-01-16 18:32:53,780 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:53,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:53,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:53,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:53,781 INFO L87 Difference]: Start difference. First operand 157 states and 437 transitions. Second operand 8 states. [2020-01-16 18:32:53,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:53,853 INFO L93 Difference]: Finished difference Result 283 states and 672 transitions. [2020-01-16 18:32:53,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:53,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:53,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:53,854 INFO L225 Difference]: With dead ends: 283 [2020-01-16 18:32:53,854 INFO L226 Difference]: Without dead ends: 269 [2020-01-16 18:32:53,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-01-16 18:32:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-01-16 18:32:53,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 161. [2020-01-16 18:32:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-01-16 18:32:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 445 transitions. [2020-01-16 18:32:53,858 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 445 transitions. Word has length 19 [2020-01-16 18:32:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:53,859 INFO L478 AbstractCegarLoop]: Abstraction has 161 states and 445 transitions. [2020-01-16 18:32:53,859 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 445 transitions. [2020-01-16 18:32:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:53,859 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:53,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-01-16 18:32:53,859 INFO L426 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-01-16 18:32:53,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:53,859 INFO L82 PathProgramCache]: Analyzing trace with hash 2094030626, now seen corresponding path program 420 times [2020-01-16 18:32:53,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:53,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002949005] [2020-01-16 18:32:53,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:54,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002949005] [2020-01-16 18:32:54,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:54,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:54,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739238722] [2020-01-16 18:32:54,048 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:54,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:54,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:54,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:54,048 INFO L87 Difference]: Start difference. First operand 161 states and 445 transitions. Second operand 8 states. [2020-01-16 18:32:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:54,123 INFO L93 Difference]: Finished difference Result 272 states and 655 transitions. [2020-01-16 18:32:54,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:54,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:54,124 INFO L225 Difference]: With dead ends: 272 [2020-01-16 18:32:54,124 INFO L226 Difference]: Without dead ends: 250 [2020-01-16 18:32:54,125 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:54,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-01-16 18:32:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 151. [2020-01-16 18:32:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 18:32:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 423 transitions. [2020-01-16 18:32:54,129 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 423 transitions. Word has length 19 [2020-01-16 18:32:54,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:54,129 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 423 transitions. [2020-01-16 18:32:54,129 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:54,129 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 423 transitions. [2020-01-16 18:32:54,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:54,129 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:54,129 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:54,129 INFO L426 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-01-16 18:32:54,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:54,130 INFO L82 PathProgramCache]: Analyzing trace with hash 677525702, now seen corresponding path program 421 times [2020-01-16 18:32:54,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:54,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421554210] [2020-01-16 18:32:54,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:54,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421554210] [2020-01-16 18:32:54,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:54,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:54,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160991158] [2020-01-16 18:32:54,327 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:54,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:54,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:54,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:54,328 INFO L87 Difference]: Start difference. First operand 151 states and 423 transitions. Second operand 8 states. [2020-01-16 18:32:54,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:54,387 INFO L93 Difference]: Finished difference Result 273 states and 645 transitions. [2020-01-16 18:32:54,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:54,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:54,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:54,388 INFO L225 Difference]: With dead ends: 273 [2020-01-16 18:32:54,389 INFO L226 Difference]: Without dead ends: 257 [2020-01-16 18:32: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-01-16 18:32:54,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-01-16 18:32:54,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 157. [2020-01-16 18:32:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-01-16 18:32:54,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 437 transitions. [2020-01-16 18:32:54,394 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 437 transitions. Word has length 19 [2020-01-16 18:32:54,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:54,394 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 437 transitions. [2020-01-16 18:32:54,394 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:54,394 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 437 transitions. [2020-01-16 18:32:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:54,395 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:54,395 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:54,395 INFO L426 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-01-16 18:32:54,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:54,395 INFO L82 PathProgramCache]: Analyzing trace with hash 936583928, now seen corresponding path program 422 times [2020-01-16 18:32:54,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:54,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307641177] [2020-01-16 18:32:54,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:54,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307641177] [2020-01-16 18:32:54,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:54,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:54,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345568041] [2020-01-16 18:32:54,589 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:54,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:54,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:54,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:54,590 INFO L87 Difference]: Start difference. First operand 157 states and 437 transitions. Second operand 8 states. [2020-01-16 18:32:54,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:54,654 INFO L93 Difference]: Finished difference Result 267 states and 630 transitions. [2020-01-16 18:32:54,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:54,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:54,655 INFO L225 Difference]: With dead ends: 267 [2020-01-16 18:32:54,655 INFO L226 Difference]: Without dead ends: 254 [2020-01-16 18:32:54,655 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:54,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-01-16 18:32:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 154. [2020-01-16 18:32:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-01-16 18:32:54,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 430 transitions. [2020-01-16 18:32:54,659 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 430 transitions. Word has length 19 [2020-01-16 18:32:54,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:54,659 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 430 transitions. [2020-01-16 18:32:54,659 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 430 transitions. [2020-01-16 18:32:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:54,659 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:54,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-01-16 18:32:54,660 INFO L426 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-01-16 18:32:54,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:54,660 INFO L82 PathProgramCache]: Analyzing trace with hash -922912152, now seen corresponding path program 423 times [2020-01-16 18:32:54,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:54,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740749468] [2020-01-16 18:32:54,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:54,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:54,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740749468] [2020-01-16 18:32:54,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:54,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:54,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129364648] [2020-01-16 18:32:54,859 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:54,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:54,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:54,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:54,859 INFO L87 Difference]: Start difference. First operand 154 states and 430 transitions. Second operand 8 states. [2020-01-16 18:32:54,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:54,921 INFO L93 Difference]: Finished difference Result 264 states and 625 transitions. [2020-01-16 18:32:54,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:54,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:54,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:54,922 INFO L225 Difference]: With dead ends: 264 [2020-01-16 18:32:54,922 INFO L226 Difference]: Without dead ends: 248 [2020-01-16 18:32:54,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-01-16 18:32:54,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-01-16 18:32:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 159. [2020-01-16 18:32:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-01-16 18:32:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 439 transitions. [2020-01-16 18:32:54,926 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 439 transitions. Word has length 19 [2020-01-16 18:32:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:54,927 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 439 transitions. [2020-01-16 18:32:54,927 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 439 transitions. [2020-01-16 18:32:54,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:54,927 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:54,927 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:54,927 INFO L426 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-01-16 18:32:54,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:54,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1673974246, now seen corresponding path program 424 times [2020-01-16 18:32:54,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:54,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624381256] [2020-01-16 18:32:54,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:55,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624381256] [2020-01-16 18:32:55,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:55,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:55,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779328924] [2020-01-16 18:32:55,120 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:55,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:55,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:55,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:55,121 INFO L87 Difference]: Start difference. First operand 159 states and 439 transitions. Second operand 8 states. [2020-01-16 18:32:55,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:55,200 INFO L93 Difference]: Finished difference Result 251 states and 604 transitions. [2020-01-16 18:32:55,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:55,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:55,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:55,201 INFO L225 Difference]: With dead ends: 251 [2020-01-16 18:32:55,201 INFO L226 Difference]: Without dead ends: 234 [2020-01-16 18:32:55,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:55,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-01-16 18:32:55,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 154. [2020-01-16 18:32:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-01-16 18:32:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 427 transitions. [2020-01-16 18:32:55,206 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 427 transitions. Word has length 19 [2020-01-16 18:32:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:55,206 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 427 transitions. [2020-01-16 18:32:55,206 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:55,206 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 427 transitions. [2020-01-16 18:32:55,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:55,206 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:55,206 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:55,206 INFO L426 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-01-16 18:32:55,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:55,207 INFO L82 PathProgramCache]: Analyzing trace with hash -522490524, now seen corresponding path program 425 times [2020-01-16 18:32:55,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:55,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693124590] [2020-01-16 18:32:55,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:55,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693124590] [2020-01-16 18:32:55,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:55,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:55,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919951473] [2020-01-16 18:32:55,411 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:55,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:55,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:55,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:55,412 INFO L87 Difference]: Start difference. First operand 154 states and 427 transitions. Second operand 8 states. [2020-01-16 18:32:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:55,476 INFO L93 Difference]: Finished difference Result 246 states and 592 transitions. [2020-01-16 18:32:55,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:55,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:55,477 INFO L225 Difference]: With dead ends: 246 [2020-01-16 18:32:55,477 INFO L226 Difference]: Without dead ends: 236 [2020-01-16 18:32:55,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:55,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-01-16 18:32:55,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 156. [2020-01-16 18:32:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-01-16 18:32:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 430 transitions. [2020-01-16 18:32:55,481 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 430 transitions. Word has length 19 [2020-01-16 18:32:55,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:55,482 INFO L478 AbstractCegarLoop]: Abstraction has 156 states and 430 transitions. [2020-01-16 18:32:55,482 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:55,482 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 430 transitions. [2020-01-16 18:32:55,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:55,482 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:55,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:55,482 INFO L426 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-01-16 18:32:55,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:55,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1377797178, now seen corresponding path program 426 times [2020-01-16 18:32:55,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:55,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890653154] [2020-01-16 18:32:55,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:55,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890653154] [2020-01-16 18:32:55,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:55,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:55,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833713153] [2020-01-16 18:32:55,683 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:55,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:55,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:55,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:55,684 INFO L87 Difference]: Start difference. First operand 156 states and 430 transitions. Second operand 8 states. [2020-01-16 18:32:55,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:55,767 INFO L93 Difference]: Finished difference Result 235 states and 578 transitions. [2020-01-16 18:32:55,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:55,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:55,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:55,768 INFO L225 Difference]: With dead ends: 235 [2020-01-16 18:32:55,768 INFO L226 Difference]: Without dead ends: 218 [2020-01-16 18:32:55,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-01-16 18:32:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-01-16 18:32:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 151. [2020-01-16 18:32:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 18:32:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 420 transitions. [2020-01-16 18:32:55,772 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 420 transitions. Word has length 19 [2020-01-16 18:32:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:55,773 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 420 transitions. [2020-01-16 18:32:55,773 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 420 transitions. [2020-01-16 18:32:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:55,773 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:55,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-01-16 18:32:55,773 INFO L426 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-01-16 18:32:55,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:55,774 INFO L82 PathProgramCache]: Analyzing trace with hash -722039428, now seen corresponding path program 427 times [2020-01-16 18:32:55,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:55,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698402000] [2020-01-16 18:32:55,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:55,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698402000] [2020-01-16 18:32:55,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:55,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:55,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72633583] [2020-01-16 18:32:55,954 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:55,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:55,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:55,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:55,955 INFO L87 Difference]: Start difference. First operand 151 states and 420 transitions. Second operand 8 states. [2020-01-16 18:32:56,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:56,030 INFO L93 Difference]: Finished difference Result 266 states and 629 transitions. [2020-01-16 18:32:56,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:56,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:56,031 INFO L225 Difference]: With dead ends: 266 [2020-01-16 18:32:56,031 INFO L226 Difference]: Without dead ends: 252 [2020-01-16 18:32:56,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2020-01-16 18:32:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 155. [2020-01-16 18:32:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-01-16 18:32:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 430 transitions. [2020-01-16 18:32:56,036 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 430 transitions. Word has length 19 [2020-01-16 18:32:56,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:56,036 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 430 transitions. [2020-01-16 18:32:56,036 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 430 transitions. [2020-01-16 18:32:56,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:56,036 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:56,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-01-16 18:32:56,037 INFO L426 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-01-16 18:32:56,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:56,037 INFO L82 PathProgramCache]: Analyzing trace with hash 398090402, now seen corresponding path program 428 times [2020-01-16 18:32:56,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:56,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700799240] [2020-01-16 18:32:56,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:56,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700799240] [2020-01-16 18:32:56,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:56,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:56,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487974000] [2020-01-16 18:32:56,211 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:56,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:56,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:56,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:56,212 INFO L87 Difference]: Start difference. First operand 155 states and 430 transitions. Second operand 8 states. [2020-01-16 18:32:56,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:56,272 INFO L93 Difference]: Finished difference Result 262 states and 618 transitions. [2020-01-16 18:32:56,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:56,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:56,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:56,274 INFO L225 Difference]: With dead ends: 262 [2020-01-16 18:32:56,274 INFO L226 Difference]: Without dead ends: 250 [2020-01-16 18:32:56,274 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-01-16 18:32:56,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-01-16 18:32:56,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 153. [2020-01-16 18:32:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-01-16 18:32:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 425 transitions. [2020-01-16 18:32:56,278 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 425 transitions. Word has length 19 [2020-01-16 18:32:56,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:56,278 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 425 transitions. [2020-01-16 18:32:56,278 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:56,278 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 425 transitions. [2020-01-16 18:32:56,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:56,279 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:56,279 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:56,279 INFO L426 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-01-16 18:32:56,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:56,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1466741926, now seen corresponding path program 429 times [2020-01-16 18:32:56,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:56,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39221832] [2020-01-16 18:32:56,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:56,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39221832] [2020-01-16 18:32:56,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:56,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:56,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419814094] [2020-01-16 18:32:56,452 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:56,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:56,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:56,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:56,453 INFO L87 Difference]: Start difference. First operand 153 states and 425 transitions. Second operand 8 states. [2020-01-16 18:32:56,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:56,533 INFO L93 Difference]: Finished difference Result 260 states and 615 transitions. [2020-01-16 18:32:56,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:56,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:56,534 INFO L225 Difference]: With dead ends: 260 [2020-01-16 18:32:56,534 INFO L226 Difference]: Without dead ends: 246 [2020-01-16 18:32:56,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-01-16 18:32:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-01-16 18:32:56,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 157. [2020-01-16 18:32:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-01-16 18:32:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 433 transitions. [2020-01-16 18:32:56,538 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 433 transitions. Word has length 19 [2020-01-16 18:32:56,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:56,538 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 433 transitions. [2020-01-16 18:32:56,538 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 433 transitions. [2020-01-16 18:32:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:56,539 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:56,539 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:56,539 INFO L426 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-01-16 18:32:56,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:56,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2082928226, now seen corresponding path program 430 times [2020-01-16 18:32:56,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:56,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730911161] [2020-01-16 18:32:56,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:56,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730911161] [2020-01-16 18:32:56,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:56,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:56,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101385475] [2020-01-16 18:32:56,716 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:56,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:56,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:56,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:56,716 INFO L87 Difference]: Start difference. First operand 157 states and 433 transitions. Second operand 8 states. [2020-01-16 18:32:56,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:56,795 INFO L93 Difference]: Finished difference Result 249 states and 598 transitions. [2020-01-16 18:32:56,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:56,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:56,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:56,796 INFO L225 Difference]: With dead ends: 249 [2020-01-16 18:32:56,796 INFO L226 Difference]: Without dead ends: 233 [2020-01-16 18:32:56,796 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:56,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-01-16 18:32:56,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 153. [2020-01-16 18:32:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-01-16 18:32:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 423 transitions. [2020-01-16 18:32:56,800 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 423 transitions. Word has length 19 [2020-01-16 18:32:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:56,800 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 423 transitions. [2020-01-16 18:32:56,800 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 423 transitions. [2020-01-16 18:32:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:56,801 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:56,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-01-16 18:32:56,801 INFO L426 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-01-16 18:32:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:56,801 INFO L82 PathProgramCache]: Analyzing trace with hash -137139400, now seen corresponding path program 431 times [2020-01-16 18:32:56,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:56,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089823394] [2020-01-16 18:32:56,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:57,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:57,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089823394] [2020-01-16 18:32:57,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:57,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:57,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777139105] [2020-01-16 18:32:57,004 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:57,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:57,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:57,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:57,004 INFO L87 Difference]: Start difference. First operand 153 states and 423 transitions. Second operand 8 states. [2020-01-16 18:32:57,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:57,067 INFO L93 Difference]: Finished difference Result 245 states and 588 transitions. [2020-01-16 18:32:57,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:57,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:57,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:57,067 INFO L225 Difference]: With dead ends: 245 [2020-01-16 18:32:57,068 INFO L226 Difference]: Without dead ends: 235 [2020-01-16 18:32:57,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:57,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-01-16 18:32:57,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 155. [2020-01-16 18:32:57,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-01-16 18:32:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 426 transitions. [2020-01-16 18:32:57,071 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 426 transitions. Word has length 19 [2020-01-16 18:32:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:57,071 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 426 transitions. [2020-01-16 18:32:57,071 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 426 transitions. [2020-01-16 18:32:57,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:57,072 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:57,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-01-16 18:32:57,072 INFO L426 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-01-16 18:32:57,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:57,072 INFO L82 PathProgramCache]: Analyzing trace with hash -992446054, now seen corresponding path program 432 times [2020-01-16 18:32:57,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:57,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348520159] [2020-01-16 18:32:57,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:57,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348520159] [2020-01-16 18:32:57,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:57,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:57,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291625886] [2020-01-16 18:32:57,255 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:57,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:57,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:57,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:57,255 INFO L87 Difference]: Start difference. First operand 155 states and 426 transitions. Second operand 8 states. [2020-01-16 18:32:57,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:57,332 INFO L93 Difference]: Finished difference Result 234 states and 574 transitions. [2020-01-16 18:32:57,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:57,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:57,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:57,333 INFO L225 Difference]: With dead ends: 234 [2020-01-16 18:32:57,333 INFO L226 Difference]: Without dead ends: 214 [2020-01-16 18:32:57,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:57,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-01-16 18:32:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 147. [2020-01-16 18:32:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 18:32:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 412 transitions. [2020-01-16 18:32:57,337 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 412 transitions. Word has length 19 [2020-01-16 18:32:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:57,337 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 412 transitions. [2020-01-16 18:32:57,337 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 412 transitions. [2020-01-16 18:32:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:57,338 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32: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-01-16 18:32:57,338 INFO L426 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-01-16 18:32:57,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:57,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1774006882, now seen corresponding path program 433 times [2020-01-16 18:32:57,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:57,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653734177] [2020-01-16 18:32:57,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:57,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:57,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653734177] [2020-01-16 18:32:57,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:57,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:57,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617649062] [2020-01-16 18:32:57,535 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:57,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:57,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:57,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:57,535 INFO L87 Difference]: Start difference. First operand 147 states and 412 transitions. Second operand 8 states. [2020-01-16 18:32:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:57,597 INFO L93 Difference]: Finished difference Result 260 states and 610 transitions. [2020-01-16 18:32:57,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:57,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:57,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:57,598 INFO L225 Difference]: With dead ends: 260 [2020-01-16 18:32:57,598 INFO L226 Difference]: Without dead ends: 244 [2020-01-16 18:32:57,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:57,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-01-16 18:32:57,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 154. [2020-01-16 18:32:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-01-16 18:32:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 430 transitions. [2020-01-16 18:32:57,602 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 430 transitions. Word has length 19 [2020-01-16 18:32:57,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:57,602 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 430 transitions. [2020-01-16 18:32:57,602 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 430 transitions. [2020-01-16 18:32:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:57,602 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:57,602 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:57,602 INFO L426 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-01-16 18:32:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:57,603 INFO L82 PathProgramCache]: Analyzing trace with hash -377719664, now seen corresponding path program 434 times [2020-01-16 18:32:57,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:57,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939541381] [2020-01-16 18:32:57,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:57,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:57,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939541381] [2020-01-16 18:32:57,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:57,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:57,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962401488] [2020-01-16 18:32:57,801 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:57,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:57,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:57,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:57,802 INFO L87 Difference]: Start difference. First operand 154 states and 430 transitions. Second operand 8 states. [2020-01-16 18:32:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:57,880 INFO L93 Difference]: Finished difference Result 254 states and 595 transitions. [2020-01-16 18:32:57,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:57,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:57,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:57,881 INFO L225 Difference]: With dead ends: 254 [2020-01-16 18:32:57,881 INFO L226 Difference]: Without dead ends: 241 [2020-01-16 18:32:57,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-01-16 18:32:57,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-01-16 18:32:57,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 151. [2020-01-16 18:32:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 18:32:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 424 transitions. [2020-01-16 18:32:57,886 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 424 transitions. Word has length 19 [2020-01-16 18:32:57,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:57,886 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 424 transitions. [2020-01-16 18:32:57,886 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 424 transitions. [2020-01-16 18:32:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:57,886 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:57,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-01-16 18:32:57,887 INFO L426 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-01-16 18:32:57,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:57,887 INFO L82 PathProgramCache]: Analyzing trace with hash 173569028, now seen corresponding path program 435 times [2020-01-16 18:32:57,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:57,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923057894] [2020-01-16 18:32:57,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:58,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923057894] [2020-01-16 18:32:58,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:58,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:58,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937339270] [2020-01-16 18:32:58,091 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:58,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:58,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:58,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:58,091 INFO L87 Difference]: Start difference. First operand 151 states and 424 transitions. Second operand 8 states. [2020-01-16 18:32:58,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:58,146 INFO L93 Difference]: Finished difference Result 260 states and 608 transitions. [2020-01-16 18:32:58,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:58,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:58,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:58,147 INFO L225 Difference]: With dead ends: 260 [2020-01-16 18:32:58,147 INFO L226 Difference]: Without dead ends: 244 [2020-01-16 18:32:58,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-01-16 18:32:58,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 154. [2020-01-16 18:32:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-01-16 18:32:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 428 transitions. [2020-01-16 18:32:58,151 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 428 transitions. Word has length 19 [2020-01-16 18:32:58,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:58,151 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 428 transitions. [2020-01-16 18:32:58,151 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 428 transitions. [2020-01-16 18:32:58,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:58,152 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:58,152 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:58,152 INFO L426 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-01-16 18:32:58,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:58,152 INFO L82 PathProgramCache]: Analyzing trace with hash 432627254, now seen corresponding path program 436 times [2020-01-16 18:32:58,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:58,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136766612] [2020-01-16 18:32:58,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:58,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:58,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136766612] [2020-01-16 18:32:58,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:58,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:58,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506723370] [2020-01-16 18:32:58,366 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:58,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:58,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:58,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:58,367 INFO L87 Difference]: Start difference. First operand 154 states and 428 transitions. Second operand 8 states. [2020-01-16 18:32:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:58,424 INFO L93 Difference]: Finished difference Result 254 states and 593 transitions. [2020-01-16 18:32:58,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:58,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:58,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:58,426 INFO L225 Difference]: With dead ends: 254 [2020-01-16 18:32:58,426 INFO L226 Difference]: Without dead ends: 241 [2020-01-16 18:32:58,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-01-16 18:32:58,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-01-16 18:32:58,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 151. [2020-01-16 18:32:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 18:32:58,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 422 transitions. [2020-01-16 18:32:58,429 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 422 transitions. Word has length 19 [2020-01-16 18:32:58,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:58,430 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 422 transitions. [2020-01-16 18:32:58,430 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:58,430 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 422 transitions. [2020-01-16 18:32:58,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:58,430 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:58,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-01-16 18:32:58,430 INFO L426 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-01-16 18:32:58,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:58,430 INFO L82 PathProgramCache]: Analyzing trace with hash -807811068, now seen corresponding path program 437 times [2020-01-16 18:32:58,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:58,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476429828] [2020-01-16 18:32:58,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:58,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:58,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476429828] [2020-01-16 18:32:58,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:58,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:58,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917896012] [2020-01-16 18:32:58,637 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:58,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:58,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:58,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:58,638 INFO L87 Difference]: Start difference. First operand 151 states and 422 transitions. Second operand 8 states. [2020-01-16 18:32:58,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:58,716 INFO L93 Difference]: Finished difference Result 246 states and 577 transitions. [2020-01-16 18:32:58,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:58,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:58,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:58,717 INFO L225 Difference]: With dead ends: 246 [2020-01-16 18:32:58,717 INFO L226 Difference]: Without dead ends: 236 [2020-01-16 18:32:58,718 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:58,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-01-16 18:32:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 152. [2020-01-16 18:32:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 18:32:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 423 transitions. [2020-01-16 18:32:58,722 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 423 transitions. Word has length 19 [2020-01-16 18:32:58,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:58,722 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 423 transitions. [2020-01-16 18:32:58,722 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 423 transitions. [2020-01-16 18:32:58,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:58,722 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:58,722 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:58,722 INFO L426 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-01-16 18:32:58,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:58,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1047453406, now seen corresponding path program 438 times [2020-01-16 18:32:58,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:58,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59906845] [2020-01-16 18:32:58,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:58,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59906845] [2020-01-16 18:32:58,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:58,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:58,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574608291] [2020-01-16 18:32:58,945 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:58,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:58,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:58,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:58,946 INFO L87 Difference]: Start difference. First operand 152 states and 423 transitions. Second operand 8 states. [2020-01-16 18:32:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:59,010 INFO L93 Difference]: Finished difference Result 246 states and 576 transitions. [2020-01-16 18:32:59,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:59,010 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:59,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:59,011 INFO L225 Difference]: With dead ends: 246 [2020-01-16 18:32:59,011 INFO L226 Difference]: Without dead ends: 233 [2020-01-16 18:32:59,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-01-16 18:32:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-01-16 18:32:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 149. [2020-01-16 18:32:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 18:32:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 418 transitions. [2020-01-16 18:32:59,014 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 418 transitions. Word has length 19 [2020-01-16 18:32:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:59,015 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 418 transitions. [2020-01-16 18:32:59,015 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 418 transitions. [2020-01-16 18:32:59,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:59,015 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:59,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-01-16 18:32:59,015 INFO L426 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-01-16 18:32:59,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:59,015 INFO L82 PathProgramCache]: Analyzing trace with hash -594926336, now seen corresponding path program 439 times [2020-01-16 18:32:59,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:59,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022791040] [2020-01-16 18:32:59,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:59,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022791040] [2020-01-16 18:32:59,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:59,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:59,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933938158] [2020-01-16 18:32:59,215 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:59,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:59,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:59,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:59,215 INFO L87 Difference]: Start difference. First operand 149 states and 418 transitions. Second operand 8 states. [2020-01-16 18:32:59,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:59,274 INFO L93 Difference]: Finished difference Result 258 states and 603 transitions. [2020-01-16 18:32:59,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:59,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:59,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:59,275 INFO L225 Difference]: With dead ends: 258 [2020-01-16 18:32:59,275 INFO L226 Difference]: Without dead ends: 242 [2020-01-16 18:32:59,276 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-01-16 18:32:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 155. [2020-01-16 18:32:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-01-16 18:32:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 432 transitions. [2020-01-16 18:32:59,279 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 432 transitions. Word has length 19 [2020-01-16 18:32:59,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:59,280 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 432 transitions. [2020-01-16 18:32:59,280 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 432 transitions. [2020-01-16 18:32:59,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:59,280 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:59,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-01-16 18:32:59,280 INFO L426 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-01-16 18:32:59,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:59,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1548314414, now seen corresponding path program 440 times [2020-01-16 18:32:59,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:59,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707898520] [2020-01-16 18:32:59,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:59,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707898520] [2020-01-16 18:32:59,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:59,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:59,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838999626] [2020-01-16 18:32:59,481 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:59,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:59,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:59,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:59,482 INFO L87 Difference]: Start difference. First operand 155 states and 432 transitions. Second operand 8 states. [2020-01-16 18:32:59,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:59,562 INFO L93 Difference]: Finished difference Result 252 states and 588 transitions. [2020-01-16 18:32:59,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:59,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:59,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:59,563 INFO L225 Difference]: With dead ends: 252 [2020-01-16 18:32:59,563 INFO L226 Difference]: Without dead ends: 239 [2020-01-16 18:32:59,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:32:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-01-16 18:32:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 152. [2020-01-16 18:32:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 18:32:59,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 425 transitions. [2020-01-16 18:32:59,566 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 425 transitions. Word has length 19 [2020-01-16 18:32:59,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:59,566 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 425 transitions. [2020-01-16 18:32:59,566 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 425 transitions. [2020-01-16 18:32:59,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:59,567 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:59,567 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:32:59,567 INFO L426 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-01-16 18:32:59,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:59,567 INFO L82 PathProgramCache]: Analyzing trace with hash 499165252, now seen corresponding path program 441 times [2020-01-16 18:32:59,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:59,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76940233] [2020-01-16 18:32:59,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:32:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:32:59,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76940233] [2020-01-16 18:32:59,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:32:59,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:32:59,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833116945] [2020-01-16 18:32:59,776 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:32:59,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:32:59,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:32:59,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:32:59,777 INFO L87 Difference]: Start difference. First operand 152 states and 425 transitions. Second operand 8 states. [2020-01-16 18:32:59,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:32:59,835 INFO L93 Difference]: Finished difference Result 254 states and 597 transitions. [2020-01-16 18:32:59,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:32:59,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:32:59,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:32:59,836 INFO L225 Difference]: With dead ends: 254 [2020-01-16 18:32:59,836 INFO L226 Difference]: Without dead ends: 238 [2020-01-16 18:32:59,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-01-16 18:32:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-01-16 18:32:59,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 157. [2020-01-16 18:32:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-01-16 18:32:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 434 transitions. [2020-01-16 18:32:59,840 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 434 transitions. Word has length 19 [2020-01-16 18:32:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:32:59,841 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 434 transitions. [2020-01-16 18:32:59,841 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:32:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 434 transitions. [2020-01-16 18:32:59,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:32:59,841 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:32:59,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-01-16 18:32:59,841 INFO L426 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-01-16 18:32:59,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:32:59,841 INFO L82 PathProgramCache]: Analyzing trace with hash -251896842, now seen corresponding path program 442 times [2020-01-16 18:32:59,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:32:59,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567647102] [2020-01-16 18:32:59,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:32:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:00,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567647102] [2020-01-16 18:33:00,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:00,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:00,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003340168] [2020-01-16 18:33:00,044 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:00,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:00,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:00,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:00,045 INFO L87 Difference]: Start difference. First operand 157 states and 434 transitions. Second operand 8 states. [2020-01-16 18:33:00,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:00,122 INFO L93 Difference]: Finished difference Result 241 states and 576 transitions. [2020-01-16 18:33:00,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:00,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:00,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:00,123 INFO L225 Difference]: With dead ends: 241 [2020-01-16 18:33:00,124 INFO L226 Difference]: Without dead ends: 224 [2020-01-16 18:33:00,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:00,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-01-16 18:33:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 152. [2020-01-16 18:33:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 18:33:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 422 transitions. [2020-01-16 18:33:00,127 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 422 transitions. Word has length 19 [2020-01-16 18:33:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:00,127 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 422 transitions. [2020-01-16 18:33:00,127 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:00,127 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 422 transitions. [2020-01-16 18:33:00,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:00,128 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:00,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-01-16 18:33:00,128 INFO L426 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-01-16 18:33:00,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:00,128 INFO L82 PathProgramCache]: Analyzing trace with hash 908750314, now seen corresponding path program 443 times [2020-01-16 18:33:00,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:00,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794943397] [2020-01-16 18:33:00,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:00,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794943397] [2020-01-16 18:33:00,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:00,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:00,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067322451] [2020-01-16 18:33:00,328 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:00,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:00,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:00,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:00,328 INFO L87 Difference]: Start difference. First operand 152 states and 422 transitions. Second operand 8 states. [2020-01-16 18:33:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:00,418 INFO L93 Difference]: Finished difference Result 245 states and 573 transitions. [2020-01-16 18:33:00,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:00,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:00,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:00,419 INFO L225 Difference]: With dead ends: 245 [2020-01-16 18:33:00,419 INFO L226 Difference]: Without dead ends: 235 [2020-01-16 18:33:00,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-01-16 18:33:00,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-01-16 18:33:00,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 154. [2020-01-16 18:33:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-01-16 18:33:00,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 425 transitions. [2020-01-16 18:33:00,423 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 425 transitions. Word has length 19 [2020-01-16 18:33:00,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:00,424 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 425 transitions. [2020-01-16 18:33:00,424 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:00,424 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 425 transitions. [2020-01-16 18:33:00,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:00,424 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:00,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-01-16 18:33:00,424 INFO L426 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-01-16 18:33:00,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:00,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1675603674, now seen corresponding path program 444 times [2020-01-16 18:33:00,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:00,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933363682] [2020-01-16 18:33:00,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:00,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933363682] [2020-01-16 18:33:00,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:00,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:00,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324021019] [2020-01-16 18:33:00,628 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:00,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:00,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:00,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:00,629 INFO L87 Difference]: Start difference. First operand 154 states and 425 transitions. Second operand 8 states. [2020-01-16 18:33:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:00,707 INFO L93 Difference]: Finished difference Result 238 states and 567 transitions. [2020-01-16 18:33:00,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:00,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:00,708 INFO L225 Difference]: With dead ends: 238 [2020-01-16 18:33:00,709 INFO L226 Difference]: Without dead ends: 221 [2020-01-16 18:33:00,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-01-16 18:33:00,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-01-16 18:33:00,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 149. [2020-01-16 18:33:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 18:33:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 416 transitions. [2020-01-16 18:33:00,713 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 416 transitions. Word has length 19 [2020-01-16 18:33:00,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:00,713 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 416 transitions. [2020-01-16 18:33:00,713 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 416 transitions. [2020-01-16 18:33:00,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:00,714 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:00,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-01-16 18:33:00,714 INFO L426 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-01-16 18:33:00,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:00,714 INFO L82 PathProgramCache]: Analyzing trace with hash -269330112, now seen corresponding path program 445 times [2020-01-16 18:33:00,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:00,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220458032] [2020-01-16 18:33:00,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:00,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220458032] [2020-01-16 18:33:00,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:00,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:00,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404728540] [2020-01-16 18:33:00,933 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:00,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:00,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:00,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:00,934 INFO L87 Difference]: Start difference. First operand 149 states and 416 transitions. Second operand 8 states. [2020-01-16 18:33:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:00,994 INFO L93 Difference]: Finished difference Result 244 states and 569 transitions. [2020-01-16 18:33:00,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:00,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:00,995 INFO L225 Difference]: With dead ends: 244 [2020-01-16 18:33:00,996 INFO L226 Difference]: Without dead ends: 228 [2020-01-16 18:33:00,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-01-16 18:33:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-01-16 18:33:00,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 155. [2020-01-16 18:33:00,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-01-16 18:33:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 430 transitions. [2020-01-16 18:33:01,000 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 430 transitions. Word has length 19 [2020-01-16 18:33:01,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:01,000 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 430 transitions. [2020-01-16 18:33:01,000 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 430 transitions. [2020-01-16 18:33:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:01,001 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:01,001 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:01,001 INFO L426 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-01-16 18:33:01,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:01,001 INFO L82 PathProgramCache]: Analyzing trace with hash -10271886, now seen corresponding path program 446 times [2020-01-16 18:33:01,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:01,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193080978] [2020-01-16 18:33:01,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:01,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193080978] [2020-01-16 18:33:01,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:01,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:01,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747970126] [2020-01-16 18:33:01,208 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:01,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:01,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:01,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:01,208 INFO L87 Difference]: Start difference. First operand 155 states and 430 transitions. Second operand 8 states. [2020-01-16 18:33:01,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:01,263 INFO L93 Difference]: Finished difference Result 238 states and 554 transitions. [2020-01-16 18:33:01,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:01,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:01,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:01,264 INFO L225 Difference]: With dead ends: 238 [2020-01-16 18:33:01,264 INFO L226 Difference]: Without dead ends: 225 [2020-01-16 18:33:01,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:01,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-01-16 18:33:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 152. [2020-01-16 18:33:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 18:33:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 423 transitions. [2020-01-16 18:33:01,268 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 423 transitions. Word has length 19 [2020-01-16 18:33:01,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:01,268 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 423 transitions. [2020-01-16 18:33:01,268 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:01,268 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 423 transitions. [2020-01-16 18:33:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:01,269 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:01,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-01-16 18:33:01,269 INFO L426 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-01-16 18:33:01,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:01,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1869767966, now seen corresponding path program 447 times [2020-01-16 18:33:01,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:01,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677955719] [2020-01-16 18:33:01,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:01,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-01-16 18:33:01,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677955719] [2020-01-16 18:33:01,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:01,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:01,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627219903] [2020-01-16 18:33:01,477 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:01,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:01,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:01,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:01,478 INFO L87 Difference]: Start difference. First operand 152 states and 423 transitions. Second operand 8 states. [2020-01-16 18:33:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:01,535 INFO L93 Difference]: Finished difference Result 235 states and 549 transitions. [2020-01-16 18:33:01,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:01,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:01,536 INFO L225 Difference]: With dead ends: 235 [2020-01-16 18:33:01,536 INFO L226 Difference]: Without dead ends: 219 [2020-01-16 18:33:01,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-01-16 18:33:01,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-01-16 18:33:01,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 157. [2020-01-16 18:33:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-01-16 18:33:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 432 transitions. [2020-01-16 18:33:01,541 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 432 transitions. Word has length 19 [2020-01-16 18:33:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:01,541 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 432 transitions. [2020-01-16 18:33:01,541 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:01,541 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 432 transitions. [2020-01-16 18:33:01,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:01,541 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:01,541 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:01,541 INFO L426 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-01-16 18:33:01,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:01,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1674137236, now seen corresponding path program 448 times [2020-01-16 18:33:01,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:01,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582545520] [2020-01-16 18:33:01,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:01,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582545520] [2020-01-16 18:33:01,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:01,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:01,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384504479] [2020-01-16 18:33:01,749 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:01,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:01,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:01,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:01,749 INFO L87 Difference]: Start difference. First operand 157 states and 432 transitions. Second operand 8 states. [2020-01-16 18:33:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:01,832 INFO L93 Difference]: Finished difference Result 222 states and 528 transitions. [2020-01-16 18:33:01,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:01,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:01,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:01,833 INFO L225 Difference]: With dead ends: 222 [2020-01-16 18:33:01,834 INFO L226 Difference]: Without dead ends: 205 [2020-01-16 18:33:01,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:01,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-01-16 18:33:01,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 152. [2020-01-16 18:33:01,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 18:33:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 420 transitions. [2020-01-16 18:33:01,837 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 420 transitions. Word has length 19 [2020-01-16 18:33:01,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:01,838 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 420 transitions. [2020-01-16 18:33:01,838 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 420 transitions. [2020-01-16 18:33:01,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:01,838 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:01,838 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:01,838 INFO L426 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-01-16 18:33:01,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:01,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1469346338, now seen corresponding path program 449 times [2020-01-16 18:33:01,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:01,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305003367] [2020-01-16 18:33:01,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:02,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305003367] [2020-01-16 18:33:02,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:02,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:02,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794330415] [2020-01-16 18:33:02,047 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:02,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:02,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:02,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:02,047 INFO L87 Difference]: Start difference. First operand 152 states and 420 transitions. Second operand 8 states. [2020-01-16 18:33:02,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:02,105 INFO L93 Difference]: Finished difference Result 217 states and 516 transitions. [2020-01-16 18:33:02,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:02,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:02,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:02,106 INFO L225 Difference]: With dead ends: 217 [2020-01-16 18:33:02,106 INFO L226 Difference]: Without dead ends: 207 [2020-01-16 18:33:02,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-01-16 18:33:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-01-16 18:33:02,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 154. [2020-01-16 18:33:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-01-16 18:33:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 423 transitions. [2020-01-16 18:33:02,109 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 423 transitions. Word has length 19 [2020-01-16 18:33:02,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:02,109 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 423 transitions. [2020-01-16 18:33:02,109 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:02,109 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 423 transitions. [2020-01-16 18:33:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:02,110 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:02,110 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:02,110 INFO L426 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-01-16 18:33:02,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:02,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1970314304, now seen corresponding path program 450 times [2020-01-16 18:33:02,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:02,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089352909] [2020-01-16 18:33:02,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:02,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089352909] [2020-01-16 18:33:02,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:02,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:02,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169729453] [2020-01-16 18:33:02,315 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:02,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:02,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:02,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:02,316 INFO L87 Difference]: Start difference. First operand 154 states and 423 transitions. Second operand 8 states. [2020-01-16 18:33:02,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:02,390 INFO L93 Difference]: Finished difference Result 206 states and 502 transitions. [2020-01-16 18:33:02,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:02,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:02,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:02,391 INFO L225 Difference]: With dead ends: 206 [2020-01-16 18:33:02,391 INFO L226 Difference]: Without dead ends: 189 [2020-01-16 18:33:02,391 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-01-16 18:33:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 149. [2020-01-16 18:33:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 18:33:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 414 transitions. [2020-01-16 18:33:02,395 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 414 transitions. Word has length 19 [2020-01-16 18:33:02,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:02,396 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 414 transitions. [2020-01-16 18:33:02,396 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:02,396 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 414 transitions. [2020-01-16 18:33:02,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:02,396 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:02,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:02,396 INFO L426 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-01-16 18:33:02,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:02,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1205521176, now seen corresponding path program 451 times [2020-01-16 18:33:02,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:02,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525742368] [2020-01-16 18:33:02,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:02,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:02,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525742368] [2020-01-16 18:33:02,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:02,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:02,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867777895] [2020-01-16 18:33:02,614 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:02,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:02,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:02,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:02,614 INFO L87 Difference]: Start difference. First operand 149 states and 414 transitions. Second operand 8 states. [2020-01-16 18:33:02,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:02,694 INFO L93 Difference]: Finished difference Result 214 states and 510 transitions. [2020-01-16 18:33:02,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:02,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:02,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:02,696 INFO L225 Difference]: With dead ends: 214 [2020-01-16 18:33:02,696 INFO L226 Difference]: Without dead ends: 204 [2020-01-16 18:33:02,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:02,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-01-16 18:33:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 151. [2020-01-16 18:33:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 18:33:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 418 transitions. [2020-01-16 18:33:02,700 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 418 transitions. Word has length 19 [2020-01-16 18:33:02,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:02,700 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 418 transitions. [2020-01-16 18:33:02,700 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:02,700 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 418 transitions. [2020-01-16 18:33:02,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:02,700 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:02,701 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:02,701 INFO L426 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-01-16 18:33:02,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:02,701 INFO L82 PathProgramCache]: Analyzing trace with hash 965878838, now seen corresponding path program 452 times [2020-01-16 18:33:02,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:02,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297191284] [2020-01-16 18:33:02,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:02,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297191284] [2020-01-16 18:33:02,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:02,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:02,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259496150] [2020-01-16 18:33:02,916 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:02,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:02,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:02,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:02,916 INFO L87 Difference]: Start difference. First operand 151 states and 418 transitions. Second operand 8 states. [2020-01-16 18:33:02,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:02,977 INFO L93 Difference]: Finished difference Result 214 states and 509 transitions. [2020-01-16 18:33:02,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:02,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:02,978 INFO L225 Difference]: With dead ends: 214 [2020-01-16 18:33:02,978 INFO L226 Difference]: Without dead ends: 203 [2020-01-16 18:33:02,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-01-16 18:33:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-01-16 18:33:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 150. [2020-01-16 18:33:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 18:33:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-01-16 18:33:02,982 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-01-16 18:33:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:02,982 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-01-16 18:33:02,982 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:02,983 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-01-16 18:33:02,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:02,983 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:02,983 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:02,983 INFO L426 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-01-16 18:33:02,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:02,983 INFO L82 PathProgramCache]: Analyzing trace with hash 460818678, now seen corresponding path program 453 times [2020-01-16 18:33:02,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:02,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619656276] [2020-01-16 18:33:02,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:03,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:03,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619656276] [2020-01-16 18:33:03,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:03,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:03,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035072573] [2020-01-16 18:33:03,190 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:03,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:03,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:03,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:03,191 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-01-16 18:33:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:03,268 INFO L93 Difference]: Finished difference Result 211 states and 504 transitions. [2020-01-16 18:33:03,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:03,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:03,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:03,269 INFO L225 Difference]: With dead ends: 211 [2020-01-16 18:33:03,269 INFO L226 Difference]: Without dead ends: 201 [2020-01-16 18:33:03,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-01-16 18:33:03,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-01-16 18:33:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 152. [2020-01-16 18:33:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 18:33:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 419 transitions. [2020-01-16 18:33:03,273 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 419 transitions. Word has length 19 [2020-01-16 18:33:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:03,273 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 419 transitions. [2020-01-16 18:33:03,273 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 419 transitions. [2020-01-16 18:33:03,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:03,273 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:03,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:03,273 INFO L426 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-01-16 18:33:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:03,274 INFO L82 PathProgramCache]: Analyzing trace with hash -2123535310, now seen corresponding path program 454 times [2020-01-16 18:33:03,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:03,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146290522] [2020-01-16 18:33:03,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:03,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146290522] [2020-01-16 18:33:03,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:03,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:03,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112141943] [2020-01-16 18:33:03,524 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:03,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:03,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:03,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:03,525 INFO L87 Difference]: Start difference. First operand 152 states and 419 transitions. Second operand 8 states. [2020-01-16 18:33:03,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:03,599 INFO L93 Difference]: Finished difference Result 204 states and 498 transitions. [2020-01-16 18:33:03,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:03,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:03,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:03,600 INFO L225 Difference]: With dead ends: 204 [2020-01-16 18:33:03,600 INFO L226 Difference]: Without dead ends: 190 [2020-01-16 18:33:03,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:03,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-01-16 18:33:03,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 150. [2020-01-16 18:33:03,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 18:33:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 415 transitions. [2020-01-16 18:33:03,604 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 415 transitions. Word has length 19 [2020-01-16 18:33:03,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:03,604 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 415 transitions. [2020-01-16 18:33:03,604 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 415 transitions. [2020-01-16 18:33:03,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:03,605 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:03,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-01-16 18:33:03,605 INFO L426 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-01-16 18:33:03,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:03,605 INFO L82 PathProgramCache]: Analyzing trace with hash -107206542, now seen corresponding path program 455 times [2020-01-16 18:33:03,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:03,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374986864] [2020-01-16 18:33:03,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:03,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:03,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374986864] [2020-01-16 18:33:03,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:03,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:03,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510117771] [2020-01-16 18:33:03,828 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:03,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:03,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:03,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:03,829 INFO L87 Difference]: Start difference. First operand 150 states and 415 transitions. Second operand 8 states. [2020-01-16 18:33:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:03,882 INFO L93 Difference]: Finished difference Result 198 states and 486 transitions. [2020-01-16 18:33:03,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:03,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:03,883 INFO L225 Difference]: With dead ends: 198 [2020-01-16 18:33:03,883 INFO L226 Difference]: Without dead ends: 188 [2020-01-16 18:33:03,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:03,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-01-16 18:33:03,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 152. [2020-01-16 18:33:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 18:33:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 418 transitions. [2020-01-16 18:33:03,886 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 418 transitions. Word has length 19 [2020-01-16 18:33:03,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:03,886 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 418 transitions. [2020-01-16 18:33:03,887 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 418 transitions. [2020-01-16 18:33:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:03,887 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:03,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-01-16 18:33:03,887 INFO L426 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-01-16 18:33:03,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:03,887 INFO L82 PathProgramCache]: Analyzing trace with hash -962513196, now seen corresponding path program 456 times [2020-01-16 18:33:03,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:03,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954259838] [2020-01-16 18:33:03,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:04,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954259838] [2020-01-16 18:33:04,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:04,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:04,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180984161] [2020-01-16 18:33:04,092 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:04,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:04,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:04,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:04,092 INFO L87 Difference]: Start difference. First operand 152 states and 418 transitions. Second operand 8 states. [2020-01-16 18:33:04,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:04,162 INFO L93 Difference]: Finished difference Result 187 states and 472 transitions. [2020-01-16 18:33:04,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:04,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:04,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:04,163 INFO L225 Difference]: With dead ends: 187 [2020-01-16 18:33:04,163 INFO L226 Difference]: Without dead ends: 170 [2020-01-16 18:33:04,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-01-16 18:33:04,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-01-16 18:33:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 147. [2020-01-16 18:33:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 18:33:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 410 transitions. [2020-01-16 18:33:04,168 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 410 transitions. Word has length 19 [2020-01-16 18:33:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:04,169 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 410 transitions. [2020-01-16 18:33:04,169 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 410 transitions. [2020-01-16 18:33:04,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:04,169 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:04,169 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:04,169 INFO L426 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-01-16 18:33:04,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:04,170 INFO L82 PathProgramCache]: Analyzing trace with hash 915076246, now seen corresponding path program 457 times [2020-01-16 18:33:04,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:04,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960552785] [2020-01-16 18:33:04,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:04,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960552785] [2020-01-16 18:33:04,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:04,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:04,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459692083] [2020-01-16 18:33:04,355 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:04,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:04,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:04,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:04,355 INFO L87 Difference]: Start difference. First operand 147 states and 410 transitions. Second operand 8 states. [2020-01-16 18:33:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:04,439 INFO L93 Difference]: Finished difference Result 246 states and 578 transitions. [2020-01-16 18:33:04,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:04,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:04,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:04,440 INFO L225 Difference]: With dead ends: 246 [2020-01-16 18:33:04,440 INFO L226 Difference]: Without dead ends: 232 [2020-01-16 18:33:04,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-01-16 18:33:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-01-16 18:33:04,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 151. [2020-01-16 18:33:04,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 18:33:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 420 transitions. [2020-01-16 18:33:04,443 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 420 transitions. Word has length 19 [2020-01-16 18:33:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:04,443 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 420 transitions. [2020-01-16 18:33:04,443 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:04,444 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 420 transitions. [2020-01-16 18:33:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:04,444 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:04,444 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:04,444 INFO L426 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-01-16 18:33:04,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:04,444 INFO L82 PathProgramCache]: Analyzing trace with hash 40740920, now seen corresponding path program 458 times [2020-01-16 18:33:04,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:04,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416301684] [2020-01-16 18:33:04,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:04,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416301684] [2020-01-16 18:33:04,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:04,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:04,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47904506] [2020-01-16 18:33:04,632 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:04,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:04,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:04,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:04,632 INFO L87 Difference]: Start difference. First operand 151 states and 420 transitions. Second operand 8 states. [2020-01-16 18:33:04,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:04,713 INFO L93 Difference]: Finished difference Result 242 states and 567 transitions. [2020-01-16 18:33:04,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:04,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:04,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:04,714 INFO L225 Difference]: With dead ends: 242 [2020-01-16 18:33:04,715 INFO L226 Difference]: Without dead ends: 230 [2020-01-16 18:33:04,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:04,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-01-16 18:33:04,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 149. [2020-01-16 18:33:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 18:33:04,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 416 transitions. [2020-01-16 18:33:04,719 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 416 transitions. Word has length 19 [2020-01-16 18:33:04,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:04,719 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 416 transitions. [2020-01-16 18:33:04,719 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:04,719 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 416 transitions. [2020-01-16 18:33:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:04,720 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:04,720 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:04,720 INFO L426 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-01-16 18:33:04,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:04,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2076098360, now seen corresponding path program 459 times [2020-01-16 18:33:04,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:04,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597453418] [2020-01-16 18:33:04,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:04,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597453418] [2020-01-16 18:33:04,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:04,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:04,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957329823] [2020-01-16 18:33:04,914 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:04,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:04,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:04,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:04,914 INFO L87 Difference]: Start difference. First operand 149 states and 416 transitions. Second operand 8 states. [2020-01-16 18:33:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:04,988 INFO L93 Difference]: Finished difference Result 246 states and 577 transitions. [2020-01-16 18:33:04,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:04,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:04,990 INFO L225 Difference]: With dead ends: 246 [2020-01-16 18:33:04,990 INFO L226 Difference]: Without dead ends: 232 [2020-01-16 18:33:04,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-01-16 18:33:04,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-01-16 18:33:04,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 151. [2020-01-16 18:33:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 18:33:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 419 transitions. [2020-01-16 18:33:04,994 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 419 transitions. Word has length 19 [2020-01-16 18:33:04,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:04,994 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 419 transitions. [2020-01-16 18:33:04,994 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:04,994 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 419 transitions. [2020-01-16 18:33:04,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:04,994 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:04,994 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:04,994 INFO L426 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-01-16 18:33:04,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:04,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1098739106, now seen corresponding path program 460 times [2020-01-16 18:33:04,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:04,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075104055] [2020-01-16 18:33:04,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:05,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075104055] [2020-01-16 18:33:05,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:05,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:05,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652718422] [2020-01-16 18:33:05,193 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:05,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:05,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:05,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:05,193 INFO L87 Difference]: Start difference. First operand 151 states and 419 transitions. Second operand 8 states. [2020-01-16 18:33:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:05,258 INFO L93 Difference]: Finished difference Result 242 states and 566 transitions. [2020-01-16 18:33:05,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:05,258 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:05,259 INFO L225 Difference]: With dead ends: 242 [2020-01-16 18:33:05,259 INFO L226 Difference]: Without dead ends: 230 [2020-01-16 18:33:05,259 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:05,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-01-16 18:33:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 149. [2020-01-16 18:33:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 18:33:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 415 transitions. [2020-01-16 18:33:05,262 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 415 transitions. Word has length 19 [2020-01-16 18:33:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:05,263 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 415 transitions. [2020-01-16 18:33:05,263 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 415 transitions. [2020-01-16 18:33:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:05,263 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:05,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-01-16 18:33:05,263 INFO L426 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-01-16 18:33:05,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:05,263 INFO L82 PathProgramCache]: Analyzing trace with hash -321241190, now seen corresponding path program 461 times [2020-01-16 18:33:05,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:05,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689046731] [2020-01-16 18:33:05,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:05,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689046731] [2020-01-16 18:33:05,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:05,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:05,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65897020] [2020-01-16 18:33:05,460 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:05,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:05,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:05,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:05,461 INFO L87 Difference]: Start difference. First operand 149 states and 415 transitions. Second operand 8 states. [2020-01-16 18:33:05,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:05,541 INFO L93 Difference]: Finished difference Result 237 states and 555 transitions. [2020-01-16 18:33:05,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:05,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:05,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:05,543 INFO L225 Difference]: With dead ends: 237 [2020-01-16 18:33:05,543 INFO L226 Difference]: Without dead ends: 227 [2020-01-16 18:33:05,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:05,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-01-16 18:33:05,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 150. [2020-01-16 18:33:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 18:33:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-01-16 18:33:05,547 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-01-16 18:33:05,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:05,547 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-01-16 18:33:05,547 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:05,547 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-01-16 18:33:05,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:05,548 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:05,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:05,548 INFO L426 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-01-16 18:33:05,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:05,548 INFO L82 PathProgramCache]: Analyzing trace with hash -560883528, now seen corresponding path program 462 times [2020-01-16 18:33:05,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:05,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128635716] [2020-01-16 18:33:05,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:05,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128635716] [2020-01-16 18:33:05,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:05,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:05,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482923902] [2020-01-16 18:33:05,753 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:05,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:05,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:05,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:05,753 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-01-16 18:33:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:05,821 INFO L93 Difference]: Finished difference Result 237 states and 554 transitions. [2020-01-16 18:33:05,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:05,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:05,822 INFO L225 Difference]: With dead ends: 237 [2020-01-16 18:33:05,822 INFO L226 Difference]: Without dead ends: 225 [2020-01-16 18:33:05,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-01-16 18:33:05,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-01-16 18:33:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 148. [2020-01-16 18:33:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-01-16 18:33:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 413 transitions. [2020-01-16 18:33:05,826 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 413 transitions. Word has length 19 [2020-01-16 18:33:05,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:05,826 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 413 transitions. [2020-01-16 18:33:05,826 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:05,826 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 413 transitions. [2020-01-16 18:33:05,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:05,827 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:05,827 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:05,827 INFO L426 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-01-16 18:33:05,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:05,827 INFO L82 PathProgramCache]: Analyzing trace with hash -695864712, now seen corresponding path program 463 times [2020-01-16 18:33:05,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:05,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034076864] [2020-01-16 18:33:05,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:05,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:05,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034076864] [2020-01-16 18:33:05,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:05,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:05,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598823416] [2020-01-16 18:33:05,999 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:05,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:05,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:06,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:06,000 INFO L87 Difference]: Start difference. First operand 148 states and 413 transitions. Second operand 8 states. [2020-01-16 18:33:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:06,081 INFO L93 Difference]: Finished difference Result 246 states and 577 transitions. [2020-01-16 18:33:06,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:06,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:06,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:06,082 INFO L225 Difference]: With dead ends: 246 [2020-01-16 18:33:06,082 INFO L226 Difference]: Without dead ends: 232 [2020-01-16 18:33:06,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:06,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-01-16 18:33:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 152. [2020-01-16 18:33:06,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 18:33:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 423 transitions. [2020-01-16 18:33:06,086 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 423 transitions. Word has length 19 [2020-01-16 18:33:06,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:06,086 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 423 transitions. [2020-01-16 18:33:06,086 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 423 transitions. [2020-01-16 18:33:06,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:06,087 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:06,087 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:06,087 INFO L426 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-01-16 18:33:06,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:06,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1570200038, now seen corresponding path program 464 times [2020-01-16 18:33:06,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:06,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730794728] [2020-01-16 18:33:06,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:06,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730794728] [2020-01-16 18:33:06,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:06,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:06,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342205313] [2020-01-16 18:33:06,262 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:06,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:06,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:06,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:06,262 INFO L87 Difference]: Start difference. First operand 152 states and 423 transitions. Second operand 8 states. [2020-01-16 18:33:06,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:06,340 INFO L93 Difference]: Finished difference Result 242 states and 566 transitions. [2020-01-16 18:33:06,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:06,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:06,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:06,341 INFO L225 Difference]: With dead ends: 242 [2020-01-16 18:33:06,341 INFO L226 Difference]: Without dead ends: 230 [2020-01-16 18:33:06,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-01-16 18:33:06,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 150. [2020-01-16 18:33:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 18:33:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 418 transitions. [2020-01-16 18:33:06,344 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 418 transitions. Word has length 19 [2020-01-16 18:33:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:06,344 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 418 transitions. [2020-01-16 18:33:06,344 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 418 transitions. [2020-01-16 18:33:06,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:06,345 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:06,345 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:06,345 INFO L426 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-01-16 18:33:06,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:06,345 INFO L82 PathProgramCache]: Analyzing trace with hash 793540284, now seen corresponding path program 465 times [2020-01-16 18:33:06,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:06,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195117432] [2020-01-16 18:33:06,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:06,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195117432] [2020-01-16 18:33:06,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:06,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:06,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331291698] [2020-01-16 18:33:06,517 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:06,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:06,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:06,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:06,517 INFO L87 Difference]: Start difference. First operand 150 states and 418 transitions. Second operand 8 states. [2020-01-16 18:33:06,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:06,595 INFO L93 Difference]: Finished difference Result 244 states and 575 transitions. [2020-01-16 18:33:06,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:06,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:06,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:06,597 INFO L225 Difference]: With dead ends: 244 [2020-01-16 18:33:06,597 INFO L226 Difference]: Without dead ends: 230 [2020-01-16 18:33:06,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-01-16 18:33:06,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 154. [2020-01-16 18:33:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-01-16 18:33:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 426 transitions. [2020-01-16 18:33:06,600 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 426 transitions. Word has length 19 [2020-01-16 18:33:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:06,600 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 426 transitions. [2020-01-16 18:33:06,600 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 426 transitions. [2020-01-16 18:33:06,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:06,601 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:06,601 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:06,601 INFO L426 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-01-16 18:33:06,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:06,601 INFO L82 PathProgramCache]: Analyzing trace with hash 48243140, now seen corresponding path program 466 times [2020-01-16 18:33:06,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:06,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312106171] [2020-01-16 18:33:06,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:06,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312106171] [2020-01-16 18:33:06,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:06,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:06,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619968173] [2020-01-16 18:33:06,779 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:06,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:06,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:06,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:06,779 INFO L87 Difference]: Start difference. First operand 154 states and 426 transitions. Second operand 8 states. [2020-01-16 18:33:06,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:06,855 INFO L93 Difference]: Finished difference Result 233 states and 558 transitions. [2020-01-16 18:33:06,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:06,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:06,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:06,856 INFO L225 Difference]: With dead ends: 233 [2020-01-16 18:33:06,856 INFO L226 Difference]: Without dead ends: 217 [2020-01-16 18:33:06,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:06,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-01-16 18:33:06,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 150. [2020-01-16 18:33:06,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 18:33:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-01-16 18:33:06,860 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-01-16 18:33:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:06,860 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-01-16 18:33:06,861 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-01-16 18:33:06,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:06,861 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:06,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:06,861 INFO L426 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-01-16 18:33:06,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:06,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2141654844, now seen corresponding path program 467 times [2020-01-16 18:33:06,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:06,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916154214] [2020-01-16 18:33:06,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:07,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:07,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916154214] [2020-01-16 18:33:07,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:07,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:07,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491003155] [2020-01-16 18:33:07,038 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:07,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:07,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:07,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:07,039 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-01-16 18:33:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:07,134 INFO L93 Difference]: Finished difference Result 238 states and 557 transitions. [2020-01-16 18:33:07,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:07,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:07,135 INFO L225 Difference]: With dead ends: 238 [2020-01-16 18:33:07,135 INFO L226 Difference]: Without dead ends: 228 [2020-01-16 18:33:07,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-01-16 18:33:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-01-16 18:33:07,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 152. [2020-01-16 18:33:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 18:33:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 419 transitions. [2020-01-16 18:33:07,138 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 419 transitions. Word has length 19 [2020-01-16 18:33:07,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:07,138 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 419 transitions. [2020-01-16 18:33:07,139 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:07,139 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 419 transitions. [2020-01-16 18:33:07,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:07,139 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:07,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-01-16 18:33:07,139 INFO L426 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-01-16 18:33:07,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:07,139 INFO L82 PathProgramCache]: Analyzing trace with hash -431041536, now seen corresponding path program 468 times [2020-01-16 18:33:07,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:07,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272581470] [2020-01-16 18:33:07,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:07,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272581470] [2020-01-16 18:33:07,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:07,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:07,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251393649] [2020-01-16 18:33:07,321 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:07,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:07,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:07,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:07,321 INFO L87 Difference]: Start difference. First operand 152 states and 419 transitions. Second operand 8 states. [2020-01-16 18:33:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:07,411 INFO L93 Difference]: Finished difference Result 231 states and 551 transitions. [2020-01-16 18:33:07,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:07,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:07,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:07,412 INFO L225 Difference]: With dead ends: 231 [2020-01-16 18:33:07,412 INFO L226 Difference]: Without dead ends: 215 [2020-01-16 18:33:07,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-01-16 18:33:07,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-01-16 18:33:07,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 148. [2020-01-16 18:33:07,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-01-16 18:33:07,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 412 transitions. [2020-01-16 18:33:07,416 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 412 transitions. Word has length 19 [2020-01-16 18:33:07,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:07,417 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 412 transitions. [2020-01-16 18:33:07,417 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:07,417 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 412 transitions. [2020-01-16 18:33:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:07,417 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:07,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-01-16 18:33:07,417 INFO L426 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-01-16 18:33:07,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:07,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1124777348, now seen corresponding path program 469 times [2020-01-16 18:33:07,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:07,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138959240] [2020-01-16 18:33:07,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:07,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-01-16 18:33:07,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138959240] [2020-01-16 18:33:07,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:07,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:07,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119434470] [2020-01-16 18:33:07,596 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:07,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:07,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:07,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:07,596 INFO L87 Difference]: Start difference. First operand 148 states and 412 transitions. Second operand 8 states. [2020-01-16 18:33:07,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:07,666 INFO L93 Difference]: Finished difference Result 236 states and 552 transitions. [2020-01-16 18:33:07,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:07,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:07,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:07,667 INFO L225 Difference]: With dead ends: 236 [2020-01-16 18:33:07,668 INFO L226 Difference]: Without dead ends: 222 [2020-01-16 18:33:07,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-01-16 18:33:07,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-01-16 18:33:07,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 152. [2020-01-16 18:33:07,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 18:33:07,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 422 transitions. [2020-01-16 18:33:07,672 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 422 transitions. Word has length 19 [2020-01-16 18:33:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:07,672 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 422 transitions. [2020-01-16 18:33:07,672 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 422 transitions. [2020-01-16 18:33:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:07,672 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:07,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-01-16 18:33:07,673 INFO L426 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-01-16 18:33:07,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:07,673 INFO L82 PathProgramCache]: Analyzing trace with hash -4647518, now seen corresponding path program 470 times [2020-01-16 18:33:07,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:07,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639792851] [2020-01-16 18:33:07,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:07,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639792851] [2020-01-16 18:33:07,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:07,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:07,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452646831] [2020-01-16 18:33:07,853 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:07,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:07,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:07,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:07,854 INFO L87 Difference]: Start difference. First operand 152 states and 422 transitions. Second operand 8 states. [2020-01-16 18:33:07,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:07,915 INFO L93 Difference]: Finished difference Result 232 states and 541 transitions. [2020-01-16 18:33:07,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:07,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:07,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:07,916 INFO L225 Difference]: With dead ends: 232 [2020-01-16 18:33:07,916 INFO L226 Difference]: Without dead ends: 220 [2020-01-16 18:33:07,916 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-01-16 18:33:07,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-01-16 18:33:07,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 150. [2020-01-16 18:33:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 18:33:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 417 transitions. [2020-01-16 18:33:07,919 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 417 transitions. Word has length 19 [2020-01-16 18:33:07,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:07,920 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 417 transitions. [2020-01-16 18:33:07,920 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:07,920 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 417 transitions. [2020-01-16 18:33:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:07,920 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:07,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:07,920 INFO L426 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-01-16 18:33:07,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:07,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1869479846, now seen corresponding path program 471 times [2020-01-16 18:33:07,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:07,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629917754] [2020-01-16 18:33:07,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:08,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629917754] [2020-01-16 18:33:08,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:08,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:08,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53938084] [2020-01-16 18:33:08,095 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:08,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:08,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:08,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:08,096 INFO L87 Difference]: Start difference. First operand 150 states and 417 transitions. Second operand 8 states. [2020-01-16 18:33:08,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:08,173 INFO L93 Difference]: Finished difference Result 230 states and 538 transitions. [2020-01-16 18:33:08,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:08,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:08,174 INFO L225 Difference]: With dead ends: 230 [2020-01-16 18:33:08,174 INFO L226 Difference]: Without dead ends: 216 [2020-01-16 18:33:08,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-01-16 18:33:08,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-01-16 18:33:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 154. [2020-01-16 18:33:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-01-16 18:33:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 425 transitions. [2020-01-16 18:33:08,177 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 425 transitions. Word has length 19 [2020-01-16 18:33:08,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:08,177 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 425 transitions. [2020-01-16 18:33:08,177 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 425 transitions. [2020-01-16 18:33:08,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:08,178 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:08,178 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:08,178 INFO L426 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-01-16 18:33:08,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:08,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1680190306, now seen corresponding path program 472 times [2020-01-16 18:33:08,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:08,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525928302] [2020-01-16 18:33:08,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:08,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-01-16 18:33:08,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525928302] [2020-01-16 18:33:08,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:08,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:08,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531768398] [2020-01-16 18:33:08,354 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:08,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:08,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:08,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:08,354 INFO L87 Difference]: Start difference. First operand 154 states and 425 transitions. Second operand 8 states. [2020-01-16 18:33:08,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:08,434 INFO L93 Difference]: Finished difference Result 219 states and 521 transitions. [2020-01-16 18:33:08,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:08,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:08,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:08,435 INFO L225 Difference]: With dead ends: 219 [2020-01-16 18:33:08,435 INFO L226 Difference]: Without dead ends: 203 [2020-01-16 18:33:08,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-01-16 18:33:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-01-16 18:33:08,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 150. [2020-01-16 18:33:08,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 18:33:08,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 415 transitions. [2020-01-16 18:33:08,439 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 415 transitions. Word has length 19 [2020-01-16 18:33:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:08,439 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 415 transitions. [2020-01-16 18:33:08,439 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:08,440 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 415 transitions. [2020-01-16 18:33:08,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:08,440 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:08,440 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:08,440 INFO L426 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-01-16 18:33:08,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:08,440 INFO L82 PathProgramCache]: Analyzing trace with hash -539877320, now seen corresponding path program 473 times [2020-01-16 18:33:08,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:08,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65591278] [2020-01-16 18:33:08,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:08,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65591278] [2020-01-16 18:33:08,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:08,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:08,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977852807] [2020-01-16 18:33:08,624 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:08,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:08,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:08,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:08,625 INFO L87 Difference]: Start difference. First operand 150 states and 415 transitions. Second operand 8 states. [2020-01-16 18:33:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:08,686 INFO L93 Difference]: Finished difference Result 215 states and 511 transitions. [2020-01-16 18:33:08,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:08,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:08,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:08,687 INFO L225 Difference]: With dead ends: 215 [2020-01-16 18:33:08,687 INFO L226 Difference]: Without dead ends: 205 [2020-01-16 18:33:08,687 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-01-16 18:33:08,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-01-16 18:33:08,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 152. [2020-01-16 18:33:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 18:33:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 418 transitions. [2020-01-16 18:33:08,691 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 418 transitions. Word has length 19 [2020-01-16 18:33:08,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:08,691 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 418 transitions. [2020-01-16 18:33:08,691 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:08,691 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 418 transitions. [2020-01-16 18:33:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:08,692 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:08,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-01-16 18:33:08,692 INFO L426 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-01-16 18:33:08,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:08,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1395183974, now seen corresponding path program 474 times [2020-01-16 18:33:08,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:08,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693946855] [2020-01-16 18:33:08,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:08,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693946855] [2020-01-16 18:33:08,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:08,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:08,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187796773] [2020-01-16 18:33:08,872 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:08,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:08,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:08,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:08,873 INFO L87 Difference]: Start difference. First operand 152 states and 418 transitions. Second operand 8 states. [2020-01-16 18:33:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:08,952 INFO L93 Difference]: Finished difference Result 204 states and 497 transitions. [2020-01-16 18:33:08,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:08,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:08,953 INFO L225 Difference]: With dead ends: 204 [2020-01-16 18:33:08,953 INFO L226 Difference]: Without dead ends: 188 [2020-01-16 18:33:08,954 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-01-16 18:33:08,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 148. [2020-01-16 18:33:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-01-16 18:33:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 411 transitions. [2020-01-16 18:33:08,958 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 411 transitions. Word has length 19 [2020-01-16 18:33:08,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:08,958 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 411 transitions. [2020-01-16 18:33:08,958 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:08,958 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 411 transitions. [2020-01-16 18:33:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:08,958 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:08,959 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:08,959 INFO L426 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-01-16 18:33:08,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:08,959 INFO L82 PathProgramCache]: Analyzing trace with hash 266504132, now seen corresponding path program 475 times [2020-01-16 18:33:08,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:08,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409029819] [2020-01-16 18:33:08,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:09,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:09,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409029819] [2020-01-16 18:33:09,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:09,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:09,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604434228] [2020-01-16 18:33:09,159 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:09,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:09,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:09,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:09,159 INFO L87 Difference]: Start difference. First operand 148 states and 411 transitions. Second operand 8 states. [2020-01-16 18:33:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:09,236 INFO L93 Difference]: Finished difference Result 213 states and 507 transitions. [2020-01-16 18:33:09,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:09,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:09,237 INFO L225 Difference]: With dead ends: 213 [2020-01-16 18:33:09,237 INFO L226 Difference]: Without dead ends: 203 [2020-01-16 18:33:09,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-01-16 18:33:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-01-16 18:33:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 150. [2020-01-16 18:33:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 18:33:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 415 transitions. [2020-01-16 18:33:09,240 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 415 transitions. Word has length 19 [2020-01-16 18:33:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:09,240 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 415 transitions. [2020-01-16 18:33:09,240 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:09,240 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 415 transitions. [2020-01-16 18:33:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:09,241 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:09,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-01-16 18:33:09,241 INFO L426 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-01-16 18:33:09,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:09,241 INFO L82 PathProgramCache]: Analyzing trace with hash 26861794, now seen corresponding path program 476 times [2020-01-16 18:33:09,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:09,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099395898] [2020-01-16 18:33:09,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:09,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099395898] [2020-01-16 18:33:09,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:09,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:09,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740719938] [2020-01-16 18:33:09,444 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:09,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:09,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:09,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:09,444 INFO L87 Difference]: Start difference. First operand 150 states and 415 transitions. Second operand 8 states. [2020-01-16 18:33:09,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:09,509 INFO L93 Difference]: Finished difference Result 213 states and 506 transitions. [2020-01-16 18:33:09,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:09,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:09,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:09,510 INFO L225 Difference]: With dead ends: 213 [2020-01-16 18:33:09,510 INFO L226 Difference]: Without dead ends: 202 [2020-01-16 18:33:09,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-01-16 18:33:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-01-16 18:33:09,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 149. [2020-01-16 18:33:09,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 18:33:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 413 transitions. [2020-01-16 18:33:09,514 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 413 transitions. Word has length 19 [2020-01-16 18:33:09,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:09,514 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 413 transitions. [2020-01-16 18:33:09,514 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 413 transitions. [2020-01-16 18:33:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:09,514 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:09,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-01-16 18:33:09,514 INFO L426 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-01-16 18:33:09,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:09,515 INFO L82 PathProgramCache]: Analyzing trace with hash -478198366, now seen corresponding path program 477 times [2020-01-16 18:33:09,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:09,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530156645] [2020-01-16 18:33:09,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:09,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:09,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530156645] [2020-01-16 18:33:09,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:09,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:09,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258624745] [2020-01-16 18:33:09,715 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:09,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:09,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:09,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:09,715 INFO L87 Difference]: Start difference. First operand 149 states and 413 transitions. Second operand 8 states. [2020-01-16 18:33:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:09,792 INFO L93 Difference]: Finished difference Result 210 states and 501 transitions. [2020-01-16 18:33:09,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:09,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:09,793 INFO L225 Difference]: With dead ends: 210 [2020-01-16 18:33:09,793 INFO L226 Difference]: Without dead ends: 200 [2020-01-16 18:33:09,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-01-16 18:33:09,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-01-16 18:33:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 151. [2020-01-16 18:33:09,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 18:33:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 416 transitions. [2020-01-16 18:33:09,796 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 416 transitions. Word has length 19 [2020-01-16 18:33:09,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:09,797 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 416 transitions. [2020-01-16 18:33:09,797 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 416 transitions. [2020-01-16 18:33:09,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:09,797 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:09,797 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:09,797 INFO L426 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-01-16 18:33:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:09,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1232414942, now seen corresponding path program 478 times [2020-01-16 18:33:09,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:09,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883205273] [2020-01-16 18:33:09,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:09,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:09,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883205273] [2020-01-16 18:33:09,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:09,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:09,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356283669] [2020-01-16 18:33:09,997 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:09,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:09,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:09,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:09,997 INFO L87 Difference]: Start difference. First operand 151 states and 416 transitions. Second operand 8 states. [2020-01-16 18:33:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:10,077 INFO L93 Difference]: Finished difference Result 203 states and 495 transitions. [2020-01-16 18:33:10,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:10,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:10,078 INFO L225 Difference]: With dead ends: 203 [2020-01-16 18:33:10,078 INFO L226 Difference]: Without dead ends: 189 [2020-01-16 18:33:10,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-01-16 18:33:10,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-01-16 18:33:10,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 149. [2020-01-16 18:33:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 18:33:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 412 transitions. [2020-01-16 18:33:10,082 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 412 transitions. Word has length 19 [2020-01-16 18:33:10,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:10,082 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 412 transitions. [2020-01-16 18:33:10,082 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 412 transitions. [2020-01-16 18:33:10,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:10,083 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:10,083 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:10,083 INFO L426 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-01-16 18:33:10,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:10,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1046223586, now seen corresponding path program 479 times [2020-01-16 18:33:10,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:10,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575985992] [2020-01-16 18:33:10,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:10,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575985992] [2020-01-16 18:33:10,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:10,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:10,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481032150] [2020-01-16 18:33:10,284 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:10,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:10,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:10,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:10,284 INFO L87 Difference]: Start difference. First operand 149 states and 412 transitions. Second operand 8 states. [2020-01-16 18:33:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:10,344 INFO L93 Difference]: Finished difference Result 197 states and 483 transitions. [2020-01-16 18:33:10,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:10,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:10,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:10,345 INFO L225 Difference]: With dead ends: 197 [2020-01-16 18:33:10,345 INFO L226 Difference]: Without dead ends: 187 [2020-01-16 18:33:10,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-01-16 18:33:10,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-01-16 18:33:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 151. [2020-01-16 18:33:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 18:33:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 415 transitions. [2020-01-16 18:33:10,349 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 415 transitions. Word has length 19 [2020-01-16 18:33:10,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:10,349 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 415 transitions. [2020-01-16 18:33:10,349 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 415 transitions. [2020-01-16 18:33:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:10,349 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:10,349 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:10,349 INFO L426 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-01-16 18:33:10,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:10,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1901530240, now seen corresponding path program 480 times [2020-01-16 18:33:10,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:10,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56499936] [2020-01-16 18:33:10,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:10,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56499936] [2020-01-16 18:33:10,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:10,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:10,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334432278] [2020-01-16 18:33:10,544 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:10,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:10,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:10,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:10,545 INFO L87 Difference]: Start difference. First operand 151 states and 415 transitions. Second operand 8 states. [2020-01-16 18:33:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:10,613 INFO L93 Difference]: Finished difference Result 186 states and 469 transitions. [2020-01-16 18:33:10,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:10,614 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:10,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:10,614 INFO L225 Difference]: With dead ends: 186 [2020-01-16 18:33:10,614 INFO L226 Difference]: Without dead ends: 167 [2020-01-16 18:33:10,614 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2020-01-16 18:33:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 144. [2020-01-16 18:33:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-01-16 18:33:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 404 transitions. [2020-01-16 18:33:10,617 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 404 transitions. Word has length 19 [2020-01-16 18:33:10,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:10,618 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 404 transitions. [2020-01-16 18:33:10,618 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 404 transitions. [2020-01-16 18:33:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:10,618 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:10,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:10,618 INFO L426 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-01-16 18:33:10,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:10,618 INFO L82 PathProgramCache]: Analyzing trace with hash -700822424, now seen corresponding path program 481 times [2020-01-16 18:33:10,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:10,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132048762] [2020-01-16 18:33:10,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:10,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132048762] [2020-01-16 18:33:10,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:10,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:10,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041556336] [2020-01-16 18:33:10,833 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:10,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:10,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:10,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:10,833 INFO L87 Difference]: Start difference. First operand 144 states and 404 transitions. Second operand 8 states. [2020-01-16 18:33:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:10,890 INFO L93 Difference]: Finished difference Result 244 states and 560 transitions. [2020-01-16 18:33:10,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:10,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:10,892 INFO L225 Difference]: With dead ends: 244 [2020-01-16 18:33:10,892 INFO L226 Difference]: Without dead ends: 228 [2020-01-16 18:33:10,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-01-16 18:33:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-01-16 18:33:10,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-01-16 18:33:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 18:33:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 414 transitions. [2020-01-16 18:33:10,896 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 414 transitions. Word has length 19 [2020-01-16 18:33:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:10,896 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 414 transitions. [2020-01-16 18:33:10,897 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 414 transitions. [2020-01-16 18:33:10,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:10,897 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:10,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-01-16 18:33:10,897 INFO L426 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-01-16 18:33:10,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:10,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1442418326, now seen corresponding path program 482 times [2020-01-16 18:33:10,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:10,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807361200] [2020-01-16 18:33:10,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:11,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807361200] [2020-01-16 18:33:11,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:11,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:11,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614816752] [2020-01-16 18:33:11,108 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:11,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:11,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:11,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:11,109 INFO L87 Difference]: Start difference. First operand 149 states and 414 transitions. Second operand 8 states. [2020-01-16 18:33:11,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:11,188 INFO L93 Difference]: Finished difference Result 238 states and 545 transitions. [2020-01-16 18:33:11,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:11,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:11,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:11,189 INFO L225 Difference]: With dead ends: 238 [2020-01-16 18:33:11,189 INFO L226 Difference]: Without dead ends: 225 [2020-01-16 18:33:11,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:11,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-01-16 18:33:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 146. [2020-01-16 18:33:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-01-16 18:33:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 408 transitions. [2020-01-16 18:33:11,193 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 408 transitions. Word has length 19 [2020-01-16 18:33:11,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:11,193 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 408 transitions. [2020-01-16 18:33:11,193 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 408 transitions. [2020-01-16 18:33:11,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:11,193 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:11,194 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:11,194 INFO L426 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-01-16 18:33:11,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:11,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1993707018, now seen corresponding path program 483 times [2020-01-16 18:33:11,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:11,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474252871] [2020-01-16 18:33:11,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:11,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474252871] [2020-01-16 18:33:11,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:11,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:11,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220534195] [2020-01-16 18:33:11,408 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:11,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:11,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:11,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:11,409 INFO L87 Difference]: Start difference. First operand 146 states and 408 transitions. Second operand 8 states. [2020-01-16 18:33:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:11,485 INFO L93 Difference]: Finished difference Result 244 states and 558 transitions. [2020-01-16 18:33:11,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:11,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:11,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:11,486 INFO L225 Difference]: With dead ends: 244 [2020-01-16 18:33:11,486 INFO L226 Difference]: Without dead ends: 228 [2020-01-16 18:33: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-01-16 18:33:11,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-01-16 18:33:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-01-16 18:33:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 18:33:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 412 transitions. [2020-01-16 18:33:11,490 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 412 transitions. Word has length 19 [2020-01-16 18:33:11,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:11,490 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 412 transitions. [2020-01-16 18:33:11,490 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:11,490 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 412 transitions. [2020-01-16 18:33:11,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:11,491 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:11,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-01-16 18:33:11,491 INFO L426 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-01-16 18:33:11,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:11,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2042202052, now seen corresponding path program 484 times [2020-01-16 18:33:11,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:11,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097960897] [2020-01-16 18:33:11,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:11,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097960897] [2020-01-16 18:33:11,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:11,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:11,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879703299] [2020-01-16 18:33:11,694 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:11,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:11,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:11,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:11,694 INFO L87 Difference]: Start difference. First operand 149 states and 412 transitions. Second operand 8 states. [2020-01-16 18:33:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:11,754 INFO L93 Difference]: Finished difference Result 238 states and 543 transitions. [2020-01-16 18:33:11,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:11,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:11,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:11,755 INFO L225 Difference]: With dead ends: 238 [2020-01-16 18:33:11,755 INFO L226 Difference]: Without dead ends: 225 [2020-01-16 18:33:11,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-01-16 18:33:11,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-01-16 18:33:11,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 146. [2020-01-16 18:33:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-01-16 18:33:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 406 transitions. [2020-01-16 18:33:11,759 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 406 transitions. Word has length 19 [2020-01-16 18:33:11,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:11,759 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 406 transitions. [2020-01-16 18:33:11,759 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:11,759 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 406 transitions. [2020-01-16 18:33:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:11,760 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:11,760 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:11,760 INFO L426 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-01-16 18:33:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:11,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1012326922, now seen corresponding path program 485 times [2020-01-16 18:33:11,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:11,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011501697] [2020-01-16 18:33:11,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:11,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011501697] [2020-01-16 18:33:11,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:11,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:11,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271937915] [2020-01-16 18:33:11,975 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:11,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:11,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:11,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:11,975 INFO L87 Difference]: Start difference. First operand 146 states and 406 transitions. Second operand 8 states. [2020-01-16 18:33:12,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:12,058 INFO L93 Difference]: Finished difference Result 230 states and 527 transitions. [2020-01-16 18:33:12,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:12,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:12,059 INFO L225 Difference]: With dead ends: 230 [2020-01-16 18:33:12,059 INFO L226 Difference]: Without dead ends: 220 [2020-01-16 18:33:12,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-01-16 18:33:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-01-16 18:33:12,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 147. [2020-01-16 18:33:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 18:33:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 407 transitions. [2020-01-16 18:33:12,064 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 407 transitions. Word has length 19 [2020-01-16 18:33:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:12,064 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 407 transitions. [2020-01-16 18:33:12,064 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 407 transitions. [2020-01-16 18:33:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:12,064 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:12,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-01-16 18:33:12,064 INFO L426 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-01-16 18:33:12,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:12,065 INFO L82 PathProgramCache]: Analyzing trace with hash 772684584, now seen corresponding path program 486 times [2020-01-16 18:33:12,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:12,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802404755] [2020-01-16 18:33:12,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:12,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-01-16 18:33:12,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802404755] [2020-01-16 18:33:12,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:12,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:12,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976779772] [2020-01-16 18:33:12,281 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:12,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:12,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:12,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:12,281 INFO L87 Difference]: Start difference. First operand 147 states and 407 transitions. Second operand 8 states. [2020-01-16 18:33:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:12,345 INFO L93 Difference]: Finished difference Result 230 states and 526 transitions. [2020-01-16 18:33:12,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:12,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:12,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:12,346 INFO L225 Difference]: With dead ends: 230 [2020-01-16 18:33:12,346 INFO L226 Difference]: Without dead ends: 217 [2020-01-16 18:33:12,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-01-16 18:33:12,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-01-16 18:33:12,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 144. [2020-01-16 18:33:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-01-16 18:33:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 402 transitions. [2020-01-16 18:33:12,349 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 402 transitions. Word has length 19 [2020-01-16 18:33:12,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:12,349 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 402 transitions. [2020-01-16 18:33:12,350 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:12,350 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 402 transitions. [2020-01-16 18:33:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:12,350 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33: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-01-16 18:33:12,350 INFO L426 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-01-16 18:33:12,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:12,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1225211654, now seen corresponding path program 487 times [2020-01-16 18:33:12,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:12,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159079280] [2020-01-16 18:33:12,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:12,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159079280] [2020-01-16 18:33:12,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:12,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:12,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124351716] [2020-01-16 18:33:12,563 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:12,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:12,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:12,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:12,564 INFO L87 Difference]: Start difference. First operand 144 states and 402 transitions. Second operand 8 states. [2020-01-16 18:33:12,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:12,625 INFO L93 Difference]: Finished difference Result 250 states and 577 transitions. [2020-01-16 18:33:12,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:12,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:12,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:12,626 INFO L225 Difference]: With dead ends: 250 [2020-01-16 18:33:12,626 INFO L226 Difference]: Without dead ends: 234 [2020-01-16 18:33:12,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:12,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-01-16 18:33:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 150. [2020-01-16 18:33:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 18:33:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-01-16 18:33:12,631 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-01-16 18:33:12,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:12,631 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-01-16 18:33:12,631 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-01-16 18:33:12,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:12,631 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:12,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-01-16 18:33:12,631 INFO L426 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-01-16 18:33:12,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:12,632 INFO L82 PathProgramCache]: Analyzing trace with hash -926514892, now seen corresponding path program 488 times [2020-01-16 18:33:12,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:12,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105415655] [2020-01-16 18:33:12,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:12,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105415655] [2020-01-16 18:33:12,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:12,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:12,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002722979] [2020-01-16 18:33:12,835 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:12,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:12,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:12,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:12,836 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-01-16 18:33:12,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:12,913 INFO L93 Difference]: Finished difference Result 244 states and 562 transitions. [2020-01-16 18:33:12,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:12,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:12,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:12,914 INFO L225 Difference]: With dead ends: 244 [2020-01-16 18:33:12,914 INFO L226 Difference]: Without dead ends: 231 [2020-01-16 18:33:12,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:12,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-01-16 18:33:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 147. [2020-01-16 18:33:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 18:33:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 409 transitions. [2020-01-16 18:33:12,918 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 409 transitions. Word has length 19 [2020-01-16 18:33:12,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:12,918 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 409 transitions. [2020-01-16 18:33:12,918 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:12,918 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 409 transitions. [2020-01-16 18:33:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:12,919 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:12,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-01-16 18:33:12,919 INFO L426 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-01-16 18:33:12,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:12,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1975664054, now seen corresponding path program 489 times [2020-01-16 18:33:12,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:12,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020802132] [2020-01-16 18:33:12,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:13,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020802132] [2020-01-16 18:33:13,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:13,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:13,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14059184] [2020-01-16 18:33:13,136 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:13,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:13,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:13,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:13,136 INFO L87 Difference]: Start difference. First operand 147 states and 409 transitions. Second operand 8 states. [2020-01-16 18:33:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:13,195 INFO L93 Difference]: Finished difference Result 254 states and 586 transitions. [2020-01-16 18:33:13,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:13,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:13,196 INFO L225 Difference]: With dead ends: 254 [2020-01-16 18:33:13,197 INFO L226 Difference]: Without dead ends: 238 [2020-01-16 18:33:13,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-01-16 18:33:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-01-16 18:33:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 152. [2020-01-16 18:33:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 18:33:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 418 transitions. [2020-01-16 18:33:13,201 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 418 transitions. Word has length 19 [2020-01-16 18:33:13,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:13,201 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 418 transitions. [2020-01-16 18:33:13,201 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:13,201 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 418 transitions. [2020-01-16 18:33:13,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:13,202 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:13,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-01-16 18:33:13,202 INFO L426 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-01-16 18:33:13,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:13,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1568241148, now seen corresponding path program 490 times [2020-01-16 18:33:13,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:13,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597011318] [2020-01-16 18:33:13,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:13,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:13,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597011318] [2020-01-16 18:33:13,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:13,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:13,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409728415] [2020-01-16 18:33:13,409 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:13,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:13,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:13,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:13,409 INFO L87 Difference]: Start difference. First operand 152 states and 418 transitions. Second operand 8 states. [2020-01-16 18:33:13,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:13,484 INFO L93 Difference]: Finished difference Result 250 states and 574 transitions. [2020-01-16 18:33:13,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:13,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:13,485 INFO L225 Difference]: With dead ends: 250 [2020-01-16 18:33:13,485 INFO L226 Difference]: Without dead ends: 233 [2020-01-16 18:33:13,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-01-16 18:33:13,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 147. [2020-01-16 18:33:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 18:33:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 406 transitions. [2020-01-16 18:33:13,489 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 406 transitions. Word has length 19 [2020-01-16 18:33:13,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:13,489 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 406 transitions. [2020-01-16 18:33:13,489 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:13,490 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 406 transitions. [2020-01-16 18:33:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:13,490 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:13,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-01-16 18:33:13,490 INFO L426 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-01-16 18:33:13,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:13,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1566078992, now seen corresponding path program 491 times [2020-01-16 18:33:13,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:13,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473481923] [2020-01-16 18:33:13,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:13,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473481923] [2020-01-16 18:33:13,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:13,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:13,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586861676] [2020-01-16 18:33:13,700 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:13,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:13,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:13,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:13,701 INFO L87 Difference]: Start difference. First operand 147 states and 406 transitions. Second operand 8 states. [2020-01-16 18:33:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:13,776 INFO L93 Difference]: Finished difference Result 239 states and 550 transitions. [2020-01-16 18:33:13,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:13,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:13,777 INFO L225 Difference]: With dead ends: 239 [2020-01-16 18:33:13,778 INFO L226 Difference]: Without dead ends: 229 [2020-01-16 18:33:13,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-01-16 18:33:13,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-01-16 18:33:13,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 149. [2020-01-16 18:33:13,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 18:33:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 409 transitions. [2020-01-16 18:33:13,782 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 409 transitions. Word has length 19 [2020-01-16 18:33:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:13,782 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 409 transitions. [2020-01-16 18:33:13,782 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:13,782 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 409 transitions. [2020-01-16 18:33:13,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:13,782 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:13,782 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:13,782 INFO L426 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-01-16 18:33:13,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:13,783 INFO L82 PathProgramCache]: Analyzing trace with hash 144534316, now seen corresponding path program 492 times [2020-01-16 18:33:13,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:13,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556785729] [2020-01-16 18:33:13,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:13,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556785729] [2020-01-16 18:33:13,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:13,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:13,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019969498] [2020-01-16 18:33:13,995 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:13,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:13,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:13,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:13,995 INFO L87 Difference]: Start difference. First operand 149 states and 409 transitions. Second operand 8 states. [2020-01-16 18:33:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:14,083 INFO L93 Difference]: Finished difference Result 241 states and 553 transitions. [2020-01-16 18:33:14,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:14,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:14,084 INFO L225 Difference]: With dead ends: 241 [2020-01-16 18:33:14,084 INFO L226 Difference]: Without dead ends: 224 [2020-01-16 18:33:14,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-01-16 18:33:14,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2020-01-16 18:33:14,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-01-16 18:33:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 400 transitions. [2020-01-16 18:33:14,088 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 400 transitions. Word has length 19 [2020-01-16 18:33:14,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:14,088 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 400 transitions. [2020-01-16 18:33:14,089 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:14,089 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 400 transitions. [2020-01-16 18:33:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:14,089 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:14,089 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:14,089 INFO L426 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-01-16 18:33:14,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:14,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1550807878, now seen corresponding path program 493 times [2020-01-16 18:33:14,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:14,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901588290] [2020-01-16 18:33:14,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:14,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901588290] [2020-01-16 18:33:14,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:14,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:14,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425543165] [2020-01-16 18:33:14,301 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:14,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:14,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:14,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:14,302 INFO L87 Difference]: Start difference. First operand 144 states and 400 transitions. Second operand 8 states. [2020-01-16 18:33:14,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:14,365 INFO L93 Difference]: Finished difference Result 250 states and 575 transitions. [2020-01-16 18:33:14,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:14,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:14,366 INFO L225 Difference]: With dead ends: 250 [2020-01-16 18:33:14,366 INFO L226 Difference]: Without dead ends: 234 [2020-01-16 18:33:14,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-01-16 18:33:14,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-01-16 18:33:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 150. [2020-01-16 18:33:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 18:33:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 414 transitions. [2020-01-16 18:33:14,370 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 414 transitions. Word has length 19 [2020-01-16 18:33:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:14,370 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 414 transitions. [2020-01-16 18:33:14,371 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 414 transitions. [2020-01-16 18:33:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:14,371 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:14,371 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:14,371 INFO L426 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-01-16 18:33:14,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:14,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1809866104, now seen corresponding path program 494 times [2020-01-16 18:33:14,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:14,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730383284] [2020-01-16 18:33:14,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:14,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-01-16 18:33:14,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730383284] [2020-01-16 18:33:14,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:14,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:14,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740444290] [2020-01-16 18:33:14,585 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:14,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:14,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:14,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:14,585 INFO L87 Difference]: Start difference. First operand 150 states and 414 transitions. Second operand 8 states. [2020-01-16 18:33:14,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:14,652 INFO L93 Difference]: Finished difference Result 244 states and 560 transitions. [2020-01-16 18:33:14,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:14,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:14,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:14,653 INFO L225 Difference]: With dead ends: 244 [2020-01-16 18:33:14,653 INFO L226 Difference]: Without dead ends: 231 [2020-01-16 18:33:14,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:14,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-01-16 18:33:14,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 147. [2020-01-16 18:33:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 18:33:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 407 transitions. [2020-01-16 18:33:14,657 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 407 transitions. Word has length 19 [2020-01-16 18:33:14,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:14,657 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 407 transitions. [2020-01-16 18:33:14,657 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 407 transitions. [2020-01-16 18:33:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:14,658 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:14,658 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:14,658 INFO L426 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-01-16 18:33:14,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:14,658 INFO L82 PathProgramCache]: Analyzing trace with hash -49629976, now seen corresponding path program 495 times [2020-01-16 18:33:14,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:14,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640237424] [2020-01-16 18:33:14,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:14,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640237424] [2020-01-16 18:33:14,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:14,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:14,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979320577] [2020-01-16 18:33:14,874 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:14,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:14,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:14,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:14,875 INFO L87 Difference]: Start difference. First operand 147 states and 407 transitions. Second operand 8 states. [2020-01-16 18:33:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:14,939 INFO L93 Difference]: Finished difference Result 254 states and 584 transitions. [2020-01-16 18:33:14,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:14,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:14,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:14,940 INFO L225 Difference]: With dead ends: 254 [2020-01-16 18:33:14,940 INFO L226 Difference]: Without dead ends: 238 [2020-01-16 18:33:14,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:14,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-01-16 18:33:14,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 152. [2020-01-16 18:33:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 18:33:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 416 transitions. [2020-01-16 18:33:14,944 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 416 transitions. Word has length 19 [2020-01-16 18:33:14,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:14,944 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 416 transitions. [2020-01-16 18:33:14,944 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 416 transitions. [2020-01-16 18:33:14,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:14,945 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:14,945 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:14,945 INFO L426 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-01-16 18:33:14,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:14,945 INFO L82 PathProgramCache]: Analyzing trace with hash -800692070, now seen corresponding path program 496 times [2020-01-16 18:33:14,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:14,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603749881] [2020-01-16 18:33:14,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:15,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603749881] [2020-01-16 18:33:15,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:15,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:15,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522102646] [2020-01-16 18:33:15,158 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:15,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:15,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:15,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:15,158 INFO L87 Difference]: Start difference. First operand 152 states and 416 transitions. Second operand 8 states. [2020-01-16 18:33:15,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:15,246 INFO L93 Difference]: Finished difference Result 250 states and 572 transitions. [2020-01-16 18:33:15,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:15,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:15,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:15,247 INFO L225 Difference]: With dead ends: 250 [2020-01-16 18:33:15,247 INFO L226 Difference]: Without dead ends: 233 [2020-01-16 18:33:15,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-01-16 18:33:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-01-16 18:33:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 147. [2020-01-16 18:33:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 18:33:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 404 transitions. [2020-01-16 18:33:15,252 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 404 transitions. Word has length 19 [2020-01-16 18:33:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:15,252 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 404 transitions. [2020-01-16 18:33:15,252 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 404 transitions. [2020-01-16 18:33:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:15,253 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:15,253 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:15,253 INFO L426 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-01-16 18:33:15,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:15,253 INFO L82 PathProgramCache]: Analyzing trace with hash 350791652, now seen corresponding path program 497 times [2020-01-16 18:33:15,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:15,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329979618] [2020-01-16 18:33:15,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:15,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329979618] [2020-01-16 18:33:15,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:15,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:15,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507488062] [2020-01-16 18:33:15,474 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:15,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:15,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:15,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:15,474 INFO L87 Difference]: Start difference. First operand 147 states and 404 transitions. Second operand 8 states. [2020-01-16 18:33:15,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:15,542 INFO L93 Difference]: Finished difference Result 239 states and 548 transitions. [2020-01-16 18:33:15,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:15,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:15,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:15,543 INFO L225 Difference]: With dead ends: 239 [2020-01-16 18:33:15,543 INFO L226 Difference]: Without dead ends: 229 [2020-01-16 18:33:15,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:15,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-01-16 18:33:15,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 149. [2020-01-16 18:33:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 18:33:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 407 transitions. [2020-01-16 18:33:15,547 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 407 transitions. Word has length 19 [2020-01-16 18:33:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:15,547 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 407 transitions. [2020-01-16 18:33:15,547 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:15,547 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 407 transitions. [2020-01-16 18:33:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:15,548 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:15,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:15,548 INFO L426 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-01-16 18:33:15,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:15,548 INFO L82 PathProgramCache]: Analyzing trace with hash -504515002, now seen corresponding path program 498 times [2020-01-16 18:33:15,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:15,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137265874] [2020-01-16 18:33:15,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:15,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137265874] [2020-01-16 18:33:15,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:15,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:15,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544710032] [2020-01-16 18:33:15,759 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:15,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:15,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:15,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:15,760 INFO L87 Difference]: Start difference. First operand 149 states and 407 transitions. Second operand 8 states. [2020-01-16 18:33:15,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:15,843 INFO L93 Difference]: Finished difference Result 241 states and 551 transitions. [2020-01-16 18:33:15,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:15,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:15,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:15,844 INFO L225 Difference]: With dead ends: 241 [2020-01-16 18:33:15,844 INFO L226 Difference]: Without dead ends: 224 [2020-01-16 18:33:15,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-01-16 18:33:15,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-01-16 18:33:15,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2020-01-16 18:33:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-01-16 18:33:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 398 transitions. [2020-01-16 18:33:15,847 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 398 transitions. Word has length 19 [2020-01-16 18:33:15,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:15,848 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 398 transitions. [2020-01-16 18:33:15,848 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 398 transitions. [2020-01-16 18:33:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:15,848 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:15,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-01-16 18:33:15,848 INFO L426 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-01-16 18:33:15,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:15,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1269308130, now seen corresponding path program 499 times [2020-01-16 18:33:15,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:15,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102668081] [2020-01-16 18:33:15,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:16,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102668081] [2020-01-16 18:33:16,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:16,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:16,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805251683] [2020-01-16 18:33:16,063 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:16,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:16,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:16,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:16,063 INFO L87 Difference]: Start difference. First operand 144 states and 398 transitions. Second operand 8 states. [2020-01-16 18:33:16,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:16,150 INFO L93 Difference]: Finished difference Result 223 states and 511 transitions. [2020-01-16 18:33:16,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:16,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:16,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:16,151 INFO L225 Difference]: With dead ends: 223 [2020-01-16 18:33:16,151 INFO L226 Difference]: Without dead ends: 213 [2020-01-16 18:33:16,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:16,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-01-16 18:33:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 146. [2020-01-16 18:33:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-01-16 18:33:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 402 transitions. [2020-01-16 18:33:16,155 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 402 transitions. Word has length 19 [2020-01-16 18:33:16,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:16,156 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 402 transitions. [2020-01-16 18:33:16,156 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:16,156 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 402 transitions. [2020-01-16 18:33:16,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:16,156 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:16,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-01-16 18:33:16,156 INFO L426 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-01-16 18:33:16,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:16,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1508950468, now seen corresponding path program 500 times [2020-01-16 18:33:16,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:16,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650160329] [2020-01-16 18:33:16,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:16,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650160329] [2020-01-16 18:33:16,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:16,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:16,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228809533] [2020-01-16 18:33:16,380 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:16,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:16,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:16,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:16,381 INFO L87 Difference]: Start difference. First operand 146 states and 402 transitions. Second operand 8 states. [2020-01-16 18:33:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:16,452 INFO L93 Difference]: Finished difference Result 223 states and 510 transitions. [2020-01-16 18:33:16,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:16,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:16,453 INFO L225 Difference]: With dead ends: 223 [2020-01-16 18:33:16,454 INFO L226 Difference]: Without dead ends: 212 [2020-01-16 18:33:16,454 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:16,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-01-16 18:33:16,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 145. [2020-01-16 18:33:16,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-01-16 18:33:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 400 transitions. [2020-01-16 18:33:16,457 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 400 transitions. Word has length 19 [2020-01-16 18:33:16,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:16,457 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 400 transitions. [2020-01-16 18:33:16,457 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 400 transitions. [2020-01-16 18:33:16,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:16,458 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:16,458 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:16,458 INFO L426 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-01-16 18:33:16,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:16,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2014010628, now seen corresponding path program 501 times [2020-01-16 18:33:16,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:16,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886018138] [2020-01-16 18:33:16,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:16,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886018138] [2020-01-16 18:33:16,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:16,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:16,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586874132] [2020-01-16 18:33:16,668 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:16,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:16,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:16,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:16,669 INFO L87 Difference]: Start difference. First operand 145 states and 400 transitions. Second operand 8 states. [2020-01-16 18:33:16,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:16,759 INFO L93 Difference]: Finished difference Result 226 states and 518 transitions. [2020-01-16 18:33:16,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:16,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:16,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:16,760 INFO L225 Difference]: With dead ends: 226 [2020-01-16 18:33:16,760 INFO L226 Difference]: Without dead ends: 216 [2020-01-16 18:33:16,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-01-16 18:33:16,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-01-16 18:33:16,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 147. [2020-01-16 18:33:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 18:33:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 403 transitions. [2020-01-16 18:33:16,764 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 403 transitions. Word has length 19 [2020-01-16 18:33:16,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:16,764 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 403 transitions. [2020-01-16 18:33:16,764 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:16,764 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 403 transitions. [2020-01-16 18:33:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:16,765 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:16,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-01-16 18:33:16,765 INFO L426 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-01-16 18:33:16,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:16,765 INFO L82 PathProgramCache]: Analyzing trace with hash -303397320, now seen corresponding path program 502 times [2020-01-16 18:33:16,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:16,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778224900] [2020-01-16 18:33:16,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:16,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778224900] [2020-01-16 18:33:16,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:16,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:16,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047170548] [2020-01-16 18:33:16,975 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:16,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:16,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:16,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:16,976 INFO L87 Difference]: Start difference. First operand 147 states and 403 transitions. Second operand 8 states. [2020-01-16 18:33:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:17,067 INFO L93 Difference]: Finished difference Result 228 states and 521 transitions. [2020-01-16 18:33:17,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:17,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:17,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:17,068 INFO L225 Difference]: With dead ends: 228 [2020-01-16 18:33:17,068 INFO L226 Difference]: Without dead ends: 214 [2020-01-16 18:33:17,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:17,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-01-16 18:33:17,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 145. [2020-01-16 18:33:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-01-16 18:33:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 399 transitions. [2020-01-16 18:33:17,072 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 399 transitions. Word has length 19 [2020-01-16 18:33:17,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:17,072 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 399 transitions. [2020-01-16 18:33:17,072 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:17,072 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 399 transitions. [2020-01-16 18:33:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:17,073 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:17,073 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:17,073 INFO L426 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-01-16 18:33:17,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:17,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1712931448, now seen corresponding path program 503 times [2020-01-16 18:33:17,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:17,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437669434] [2020-01-16 18:33:17,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:17,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437669434] [2020-01-16 18:33:17,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:17,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:17,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353672973] [2020-01-16 18:33:17,286 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:17,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:17,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:17,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:17,286 INFO L87 Difference]: Start difference. First operand 145 states and 399 transitions. Second operand 8 states. [2020-01-16 18:33:17,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:17,352 INFO L93 Difference]: Finished difference Result 226 states and 517 transitions. [2020-01-16 18:33:17,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:17,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:17,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:17,353 INFO L225 Difference]: With dead ends: 226 [2020-01-16 18:33:17,353 INFO L226 Difference]: Without dead ends: 216 [2020-01-16 18:33:17,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:17,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-01-16 18:33:17,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 147. [2020-01-16 18:33:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 18:33:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 402 transitions. [2020-01-16 18:33:17,357 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 402 transitions. Word has length 19 [2020-01-16 18:33:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:17,358 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 402 transitions. [2020-01-16 18:33:17,358 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:17,358 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 402 transitions. [2020-01-16 18:33:17,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:17,358 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:17,358 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:17,358 INFO L426 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-01-16 18:33:17,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:17,358 INFO L82 PathProgramCache]: Analyzing trace with hash 857624794, now seen corresponding path program 504 times [2020-01-16 18:33:17,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:17,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748861628] [2020-01-16 18:33:17,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:17,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748861628] [2020-01-16 18:33:17,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:17,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:17,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078975659] [2020-01-16 18:33:17,583 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:17,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:17,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:17,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:17,584 INFO L87 Difference]: Start difference. First operand 147 states and 402 transitions. Second operand 8 states. [2020-01-16 18:33:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:17,675 INFO L93 Difference]: Finished difference Result 228 states and 520 transitions. [2020-01-16 18:33:17,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:17,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:17,676 INFO L225 Difference]: With dead ends: 228 [2020-01-16 18:33:17,676 INFO L226 Difference]: Without dead ends: 211 [2020-01-16 18:33:17,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:17,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-01-16 18:33:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 142. [2020-01-16 18:33:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-01-16 18:33:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 394 transitions. [2020-01-16 18:33:17,679 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 394 transitions. Word has length 19 [2020-01-16 18:33:17,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:17,679 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 394 transitions. [2020-01-16 18:33:17,679 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:17,679 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 394 transitions. [2020-01-16 18:33:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:17,680 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:17,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-01-16 18:33:17,680 INFO L426 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-01-16 18:33:17,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:17,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1123308150, now seen corresponding path program 505 times [2020-01-16 18:33:17,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:17,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362155410] [2020-01-16 18:33:17,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:17,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-01-16 18:33:17,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362155410] [2020-01-16 18:33:17,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:17,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:17,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093859268] [2020-01-16 18:33:17,873 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:17,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:17,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:17,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:17,874 INFO L87 Difference]: Start difference. First operand 142 states and 394 transitions. Second operand 8 states. [2020-01-16 18:33:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:17,936 INFO L93 Difference]: Finished difference Result 241 states and 546 transitions. [2020-01-16 18:33:17,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:17,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:17,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:17,937 INFO L225 Difference]: With dead ends: 241 [2020-01-16 18:33:17,937 INFO L226 Difference]: Without dead ends: 225 [2020-01-16 18:33:17,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-01-16 18:33:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-01-16 18:33:17,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 145. [2020-01-16 18:33:17,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-01-16 18:33:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 398 transitions. [2020-01-16 18:33:17,941 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 398 transitions. Word has length 19 [2020-01-16 18:33:17,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:17,941 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 398 transitions. [2020-01-16 18:33:17,941 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:17,941 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 398 transitions. [2020-01-16 18:33:17,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:17,942 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:17,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-01-16 18:33:17,942 INFO L426 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-01-16 18:33:17,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:17,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1019932600, now seen corresponding path program 506 times [2020-01-16 18:33:17,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:17,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860494835] [2020-01-16 18:33:17,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:18,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860494835] [2020-01-16 18:33:18,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:18,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:18,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795665501] [2020-01-16 18:33:18,133 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:18,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:18,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:18,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:18,134 INFO L87 Difference]: Start difference. First operand 145 states and 398 transitions. Second operand 8 states. [2020-01-16 18:33:18,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:18,210 INFO L93 Difference]: Finished difference Result 235 states and 531 transitions. [2020-01-16 18:33:18,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:18,211 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:18,211 INFO L225 Difference]: With dead ends: 235 [2020-01-16 18:33:18,211 INFO L226 Difference]: Without dead ends: 222 [2020-01-16 18:33:18,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-01-16 18:33:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 142. [2020-01-16 18:33:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-01-16 18:33:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 392 transitions. [2020-01-16 18:33:18,216 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 392 transitions. Word has length 19 [2020-01-16 18:33:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:18,216 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 392 transitions. [2020-01-16 18:33:18,216 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 392 transitions. [2020-01-16 18:33:18,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:18,216 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:18,216 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:18,216 INFO L426 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-01-16 18:33:18,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:18,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1571221292, now seen corresponding path program 507 times [2020-01-16 18:33:18,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:18,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116554504] [2020-01-16 18:33:18,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:18,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116554504] [2020-01-16 18:33:18,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:18,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:18,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667170723] [2020-01-16 18:33:18,413 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:18,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:18,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:18,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:18,414 INFO L87 Difference]: Start difference. First operand 142 states and 392 transitions. Second operand 8 states. [2020-01-16 18:33:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:18,471 INFO L93 Difference]: Finished difference Result 241 states and 544 transitions. [2020-01-16 18:33:18,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:18,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:18,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:18,473 INFO L225 Difference]: With dead ends: 241 [2020-01-16 18:33:18,473 INFO L226 Difference]: Without dead ends: 225 [2020-01-16 18:33:18,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-01-16 18:33:18,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 145. [2020-01-16 18:33:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-01-16 18:33:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 396 transitions. [2020-01-16 18:33:18,477 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 396 transitions. Word has length 19 [2020-01-16 18:33:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:18,477 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 396 transitions. [2020-01-16 18:33:18,477 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 396 transitions. [2020-01-16 18:33:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:18,478 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:18,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-01-16 18:33:18,478 INFO L426 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-01-16 18:33:18,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:18,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1830279518, now seen corresponding path program 508 times [2020-01-16 18:33:18,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:18,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018109889] [2020-01-16 18:33:18,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:18,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-01-16 18:33:18,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018109889] [2020-01-16 18:33:18,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:18,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:18,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172447042] [2020-01-16 18:33:18,680 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:18,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:18,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:18,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:18,681 INFO L87 Difference]: Start difference. First operand 145 states and 396 transitions. Second operand 8 states. [2020-01-16 18:33:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:18,752 INFO L93 Difference]: Finished difference Result 235 states and 529 transitions. [2020-01-16 18:33:18,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:18,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:18,753 INFO L225 Difference]: With dead ends: 235 [2020-01-16 18:33:18,754 INFO L226 Difference]: Without dead ends: 222 [2020-01-16 18:33:18,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-01-16 18:33:18,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 142. [2020-01-16 18:33:18,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-01-16 18:33:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 390 transitions. [2020-01-16 18:33:18,760 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 390 transitions. Word has length 19 [2020-01-16 18:33:18,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:18,760 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 390 transitions. [2020-01-16 18:33:18,760 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:18,760 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 390 transitions. [2020-01-16 18:33:18,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:18,761 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:18,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-01-16 18:33:18,761 INFO L426 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-01-16 18:33:18,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:18,762 INFO L82 PathProgramCache]: Analyzing trace with hash 589841196, now seen corresponding path program 509 times [2020-01-16 18:33:18,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:18,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024863006] [2020-01-16 18:33:18,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:18,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024863006] [2020-01-16 18:33:18,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:18,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:18,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465171678] [2020-01-16 18:33:18,960 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:18,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:18,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:18,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:18,961 INFO L87 Difference]: Start difference. First operand 142 states and 390 transitions. Second operand 8 states. [2020-01-16 18:33:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:19,047 INFO L93 Difference]: Finished difference Result 227 states and 513 transitions. [2020-01-16 18:33:19,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:19,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:19,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:19,048 INFO L225 Difference]: With dead ends: 227 [2020-01-16 18:33:19,048 INFO L226 Difference]: Without dead ends: 217 [2020-01-16 18:33:19,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:19,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-01-16 18:33:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 143. [2020-01-16 18:33:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-01-16 18:33:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 391 transitions. [2020-01-16 18:33:19,052 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 391 transitions. Word has length 19 [2020-01-16 18:33:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:19,052 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 391 transitions. [2020-01-16 18:33:19,053 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 391 transitions. [2020-01-16 18:33:19,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:19,053 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:19,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-01-16 18:33:19,053 INFO L426 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-01-16 18:33:19,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:19,053 INFO L82 PathProgramCache]: Analyzing trace with hash 350198858, now seen corresponding path program 510 times [2020-01-16 18:33:19,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:19,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935748091] [2020-01-16 18:33:19,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:19,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-01-16 18:33:19,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935748091] [2020-01-16 18:33:19,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:19,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:19,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920228543] [2020-01-16 18:33:19,253 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:19,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:19,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:19,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:19,254 INFO L87 Difference]: Start difference. First operand 143 states and 391 transitions. Second operand 8 states. [2020-01-16 18:33:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:19,323 INFO L93 Difference]: Finished difference Result 227 states and 512 transitions. [2020-01-16 18:33:19,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:19,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:19,324 INFO L225 Difference]: With dead ends: 227 [2020-01-16 18:33:19,324 INFO L226 Difference]: Without dead ends: 214 [2020-01-16 18:33:19,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-01-16 18:33:19,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-01-16 18:33:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 140. [2020-01-16 18:33:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-01-16 18:33:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 386 transitions. [2020-01-16 18:33:19,328 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 386 transitions. Word has length 19 [2020-01-16 18:33:19,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:19,329 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 386 transitions. [2020-01-16 18:33:19,329 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:19,329 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 386 transitions. [2020-01-16 18:33:19,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:19,329 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:19,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-01-16 18:33:19,329 INFO L426 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-01-16 18:33:19,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:19,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1566207290, now seen corresponding path program 511 times [2020-01-16 18:33:19,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:19,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519053992] [2020-01-16 18:33:19,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:19,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-01-16 18:33:19,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519053992] [2020-01-16 18:33:19,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:19,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:19,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703909259] [2020-01-16 18:33:19,509 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:19,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:19,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:19,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:19,509 INFO L87 Difference]: Start difference. First operand 140 states and 386 transitions. Second operand 8 states. [2020-01-16 18:33:19,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:19,573 INFO L93 Difference]: Finished difference Result 246 states and 561 transitions. [2020-01-16 18:33:19,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:19,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:19,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:19,574 INFO L225 Difference]: With dead ends: 246 [2020-01-16 18:33:19,574 INFO L226 Difference]: Without dead ends: 230 [2020-01-16 18:33:19,574 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-01-16 18:33:19,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-01-16 18:33:19,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 146. [2020-01-16 18:33:19,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-01-16 18:33:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 400 transitions. [2020-01-16 18:33:19,577 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 400 transitions. Word has length 19 [2020-01-16 18:33:19,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:19,577 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 400 transitions. [2020-01-16 18:33:19,577 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:19,577 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 400 transitions. [2020-01-16 18:33:19,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:19,578 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:19,578 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:19,578 INFO L426 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-01-16 18:33:19,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:19,578 INFO L82 PathProgramCache]: Analyzing trace with hash 577033460, now seen corresponding path program 512 times [2020-01-16 18:33:19,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:19,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565644638] [2020-01-16 18:33:19,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:19,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565644638] [2020-01-16 18:33:19,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:19,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:19,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778384326] [2020-01-16 18:33:19,753 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:19,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:19,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:19,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:19,754 INFO L87 Difference]: Start difference. First operand 146 states and 400 transitions. Second operand 8 states. [2020-01-16 18:33:19,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:19,840 INFO L93 Difference]: Finished difference Result 240 states and 546 transitions. [2020-01-16 18:33:19,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:19,841 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:19,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:19,841 INFO L225 Difference]: With dead ends: 240 [2020-01-16 18:33:19,841 INFO L226 Difference]: Without dead ends: 227 [2020-01-16 18:33:19,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:19,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-01-16 18:33:19,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2020-01-16 18:33:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-01-16 18:33:19,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 393 transitions. [2020-01-16 18:33:19,845 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 393 transitions. Word has length 19 [2020-01-16 18:33:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:19,845 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 393 transitions. [2020-01-16 18:33:19,845 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 393 transitions. [2020-01-16 18:33:19,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:19,846 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:19,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-01-16 18:33:19,846 INFO L426 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-01-16 18:33:19,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:19,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2072553556, now seen corresponding path program 513 times [2020-01-16 18:33:19,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:19,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098017489] [2020-01-16 18:33:19,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:20,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098017489] [2020-01-16 18:33:20,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:20,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:20,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489434417] [2020-01-16 18:33:20,029 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:20,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:20,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:20,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:20,029 INFO L87 Difference]: Start difference. First operand 143 states and 393 transitions. Second operand 8 states. [2020-01-16 18:33:20,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:20,095 INFO L93 Difference]: Finished difference Result 244 states and 560 transitions. [2020-01-16 18:33:20,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:20,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:20,096 INFO L225 Difference]: With dead ends: 244 [2020-01-16 18:33:20,096 INFO L226 Difference]: Without dead ends: 228 [2020-01-16 18:33:20,096 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-01-16 18:33:20,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-01-16 18:33:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-01-16 18:33:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 18:33:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 404 transitions. [2020-01-16 18:33:20,100 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 404 transitions. Word has length 19 [2020-01-16 18:33:20,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:20,100 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 404 transitions. [2020-01-16 18:33:20,100 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 404 transitions. [2020-01-16 18:33:20,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:20,101 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:20,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-01-16 18:33:20,101 INFO L426 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-01-16 18:33:20,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:20,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1246208990, now seen corresponding path program 514 times [2020-01-16 18:33:20,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:20,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019837669] [2020-01-16 18:33:20,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:20,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-01-16 18:33:20,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019837669] [2020-01-16 18:33:20,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:20,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:20,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80403391] [2020-01-16 18:33:20,281 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:20,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:20,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:20,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:20,282 INFO L87 Difference]: Start difference. First operand 149 states and 404 transitions. Second operand 8 states. [2020-01-16 18:33:20,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:20,368 INFO L93 Difference]: Finished difference Result 232 states and 540 transitions. [2020-01-16 18:33:20,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:20,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:20,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:20,369 INFO L225 Difference]: With dead ends: 232 [2020-01-16 18:33:20,369 INFO L226 Difference]: Without dead ends: 213 [2020-01-16 18:33:20,369 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:20,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-01-16 18:33:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 143. [2020-01-16 18:33:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-01-16 18:33:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 390 transitions. [2020-01-16 18:33:20,373 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 390 transitions. Word has length 19 [2020-01-16 18:33:20,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:20,373 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 390 transitions. [2020-01-16 18:33:20,373 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 390 transitions. [2020-01-16 18:33:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:20,374 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:20,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-01-16 18:33:20,374 INFO L426 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-01-16 18:33:20,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:20,374 INFO L82 PathProgramCache]: Analyzing trace with hash 692674962, now seen corresponding path program 515 times [2020-01-16 18:33:20,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:20,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106322767] [2020-01-16 18:33:20,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:20,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106322767] [2020-01-16 18:33:20,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:20,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:20,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636144961] [2020-01-16 18:33:20,549 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:20,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:20,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:20,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:20,550 INFO L87 Difference]: Start difference. First operand 143 states and 390 transitions. Second operand 8 states. [2020-01-16 18:33:20,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:20,633 INFO L93 Difference]: Finished difference Result 234 states and 533 transitions. [2020-01-16 18:33:20,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:20,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:20,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:20,634 INFO L225 Difference]: With dead ends: 234 [2020-01-16 18:33:20,634 INFO L226 Difference]: Without dead ends: 224 [2020-01-16 18:33:20,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-01-16 18:33:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-01-16 18:33:20,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 145. [2020-01-16 18:33:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-01-16 18:33:20,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 393 transitions. [2020-01-16 18:33:20,638 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 393 transitions. Word has length 19 [2020-01-16 18:33:20,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:20,638 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 393 transitions. [2020-01-16 18:33:20,638 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 393 transitions. [2020-01-16 18:33:20,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:20,639 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:20,639 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:20,639 INFO L426 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-01-16 18:33:20,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:20,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1036372372, now seen corresponding path program 516 times [2020-01-16 18:33:20,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:20,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896637404] [2020-01-16 18:33:20,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:20,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-01-16 18:33:20,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896637404] [2020-01-16 18:33:20,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:20,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:20,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611881613] [2020-01-16 18:33:20,816 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:20,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:20,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:20,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:20,817 INFO L87 Difference]: Start difference. First operand 145 states and 393 transitions. Second operand 8 states. [2020-01-16 18:33:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:20,906 INFO L93 Difference]: Finished difference Result 228 states and 529 transitions. [2020-01-16 18:33:20,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:20,907 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:20,907 INFO L225 Difference]: With dead ends: 228 [2020-01-16 18:33:20,907 INFO L226 Difference]: Without dead ends: 210 [2020-01-16 18:33:20,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-01-16 18:33:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-01-16 18:33:20,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 140. [2020-01-16 18:33:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-01-16 18:33:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 384 transitions. [2020-01-16 18:33:20,911 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 384 transitions. Word has length 19 [2020-01-16 18:33:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:20,912 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 384 transitions. [2020-01-16 18:33:20,912 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 384 transitions. [2020-01-16 18:33:20,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:20,912 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:20,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-01-16 18:33:20,912 INFO L426 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-01-16 18:33:20,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:20,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1240611066, now seen corresponding path program 517 times [2020-01-16 18:33:20,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:20,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548822901] [2020-01-16 18:33:20,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:21,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548822901] [2020-01-16 18:33:21,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:21,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:21,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524086981] [2020-01-16 18:33:21,100 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:21,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:21,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:21,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:21,101 INFO L87 Difference]: Start difference. First operand 140 states and 384 transitions. Second operand 8 states. [2020-01-16 18:33:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:21,165 INFO L93 Difference]: Finished difference Result 246 states and 559 transitions. [2020-01-16 18:33:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:21,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:21,166 INFO L225 Difference]: With dead ends: 246 [2020-01-16 18:33:21,166 INFO L226 Difference]: Without dead ends: 230 [2020-01-16 18:33:21,166 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:21,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-01-16 18:33:21,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 146. [2020-01-16 18:33:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-01-16 18:33:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 398 transitions. [2020-01-16 18:33:21,169 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 398 transitions. Word has length 19 [2020-01-16 18:33:21,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:21,170 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 398 transitions. [2020-01-16 18:33:21,170 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:21,170 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 398 transitions. [2020-01-16 18:33:21,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:21,170 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:21,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-01-16 18:33:21,170 INFO L426 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-01-16 18:33:21,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:21,170 INFO L82 PathProgramCache]: Analyzing trace with hash -981552840, now seen corresponding path program 518 times [2020-01-16 18:33:21,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:21,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506084057] [2020-01-16 18:33:21,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:21,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506084057] [2020-01-16 18:33:21,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:21,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:21,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637111580] [2020-01-16 18:33:21,366 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:21,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:21,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:21,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:21,367 INFO L87 Difference]: Start difference. First operand 146 states and 398 transitions. Second operand 8 states. [2020-01-16 18:33:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:21,431 INFO L93 Difference]: Finished difference Result 240 states and 544 transitions. [2020-01-16 18:33:21,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:21,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:21,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:21,433 INFO L225 Difference]: With dead ends: 240 [2020-01-16 18:33:21,433 INFO L226 Difference]: Without dead ends: 227 [2020-01-16 18:33:21,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:21,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-01-16 18:33:21,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2020-01-16 18:33:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-01-16 18:33:21,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 391 transitions. [2020-01-16 18:33:21,436 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 391 transitions. Word has length 19 [2020-01-16 18:33:21,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:21,436 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 391 transitions. [2020-01-16 18:33:21,436 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:21,437 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 391 transitions. [2020-01-16 18:33:21,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:21,437 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:21,437 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:21,437 INFO L426 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-01-16 18:33:21,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:21,437 INFO L82 PathProgramCache]: Analyzing trace with hash -146519478, now seen corresponding path program 519 times [2020-01-16 18:33:21,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:21,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111643128] [2020-01-16 18:33:21,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:21,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111643128] [2020-01-16 18:33:21,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:21,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:21,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096581458] [2020-01-16 18:33:21,631 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:21,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:21,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:21,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:21,632 INFO L87 Difference]: Start difference. First operand 143 states and 391 transitions. Second operand 8 states. [2020-01-16 18:33:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:21,698 INFO L93 Difference]: Finished difference Result 244 states and 558 transitions. [2020-01-16 18:33:21,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:21,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:21,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:21,699 INFO L225 Difference]: With dead ends: 244 [2020-01-16 18:33:21,699 INFO L226 Difference]: Without dead ends: 228 [2020-01-16 18:33:21,700 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:21,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-01-16 18:33:21,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-01-16 18:33:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 18:33:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 402 transitions. [2020-01-16 18:33:21,703 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 402 transitions. Word has length 19 [2020-01-16 18:33:21,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:21,703 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 402 transitions. [2020-01-16 18:33:21,703 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 402 transitions. [2020-01-16 18:33:21,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:21,704 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:21,704 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:21,704 INFO L426 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-01-16 18:33:21,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:21,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1122724228, now seen corresponding path program 520 times [2020-01-16 18:33:21,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:21,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501636641] [2020-01-16 18:33:21,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:21,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501636641] [2020-01-16 18:33:21,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:21,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:21,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155719703] [2020-01-16 18:33:21,893 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:21,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:21,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:21,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:21,894 INFO L87 Difference]: Start difference. First operand 149 states and 402 transitions. Second operand 8 states. [2020-01-16 18:33:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:21,974 INFO L93 Difference]: Finished difference Result 232 states and 538 transitions. [2020-01-16 18:33:21,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:21,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:21,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:21,976 INFO L225 Difference]: With dead ends: 232 [2020-01-16 18:33:21,976 INFO L226 Difference]: Without dead ends: 213 [2020-01-16 18:33:21,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:21,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-01-16 18:33:21,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 143. [2020-01-16 18:33:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-01-16 18:33:21,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 388 transitions. [2020-01-16 18:33:21,979 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 388 transitions. Word has length 19 [2020-01-16 18:33:21,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:21,979 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 388 transitions. [2020-01-16 18:33:21,979 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 388 transitions. [2020-01-16 18:33:21,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:21,980 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:21,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-01-16 18:33:21,980 INFO L426 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-01-16 18:33:21,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:21,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1864843108, now seen corresponding path program 521 times [2020-01-16 18:33:21,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:21,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092233234] [2020-01-16 18:33:21,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:22,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092233234] [2020-01-16 18:33:22,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:22,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:22,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206003468] [2020-01-16 18:33:22,171 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:22,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:22,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:22,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:22,172 INFO L87 Difference]: Start difference. First operand 143 states and 388 transitions. Second operand 8 states. [2020-01-16 18:33:22,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:22,238 INFO L93 Difference]: Finished difference Result 234 states and 531 transitions. [2020-01-16 18:33:22,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:22,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:22,239 INFO L225 Difference]: With dead ends: 234 [2020-01-16 18:33:22,239 INFO L226 Difference]: Without dead ends: 224 [2020-01-16 18:33:22,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-01-16 18:33:22,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 145. [2020-01-16 18:33:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-01-16 18:33:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 391 transitions. [2020-01-16 18:33:22,242 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 391 transitions. Word has length 19 [2020-01-16 18:33:22,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:22,242 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 391 transitions. [2020-01-16 18:33:22,242 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 391 transitions. [2020-01-16 18:33:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:22,243 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:22,243 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:22,243 INFO L426 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-01-16 18:33:22,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:22,243 INFO L82 PathProgramCache]: Analyzing trace with hash -940719192, now seen corresponding path program 522 times [2020-01-16 18:33:22,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:22,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307578298] [2020-01-16 18:33:22,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:22,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307578298] [2020-01-16 18:33:22,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:22,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:22,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330613256] [2020-01-16 18:33:22,432 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:22,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:22,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:22,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:22,433 INFO L87 Difference]: Start difference. First operand 145 states and 391 transitions. Second operand 8 states. [2020-01-16 18:33:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:22,520 INFO L93 Difference]: Finished difference Result 228 states and 527 transitions. [2020-01-16 18:33:22,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:22,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:22,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:22,521 INFO L225 Difference]: With dead ends: 228 [2020-01-16 18:33:22,521 INFO L226 Difference]: Without dead ends: 210 [2020-01-16 18:33:22,521 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-01-16 18:33:22,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 140. [2020-01-16 18:33:22,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-01-16 18:33:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 382 transitions. [2020-01-16 18:33:22,525 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 382 transitions. Word has length 19 [2020-01-16 18:33:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:22,525 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 382 transitions. [2020-01-16 18:33:22,525 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 382 transitions. [2020-01-16 18:33:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:22,526 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:22,526 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:22,526 INFO L426 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-01-16 18:33:22,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:22,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1366197632, now seen corresponding path program 523 times [2020-01-16 18:33:22,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:22,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001801009] [2020-01-16 18:33:22,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:22,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001801009] [2020-01-16 18:33:22,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:22,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:22,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985095341] [2020-01-16 18:33:22,721 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:22,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:22,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:22,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:22,722 INFO L87 Difference]: Start difference. First operand 140 states and 382 transitions. Second operand 8 states. [2020-01-16 18:33:22,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:22,811 INFO L93 Difference]: Finished difference Result 220 states and 497 transitions. [2020-01-16 18:33:22,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:22,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:22,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:22,812 INFO L225 Difference]: With dead ends: 220 [2020-01-16 18:33:22,812 INFO L226 Difference]: Without dead ends: 210 [2020-01-16 18:33:22,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-01-16 18:33:22,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 142. [2020-01-16 18:33:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-01-16 18:33:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 386 transitions. [2020-01-16 18:33:22,815 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 386 transitions. Word has length 19 [2020-01-16 18:33:22,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:22,815 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 386 transitions. [2020-01-16 18:33:22,815 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:22,815 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 386 transitions. [2020-01-16 18:33:22,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:22,815 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:22,815 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:22,815 INFO L426 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-01-16 18:33:22,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:22,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1605839970, now seen corresponding path program 524 times [2020-01-16 18:33:22,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:22,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695865099] [2020-01-16 18:33:22,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:23,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-01-16 18:33:23,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695865099] [2020-01-16 18:33:23,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:23,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:23,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909331678] [2020-01-16 18:33:23,021 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:23,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:23,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:23,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:23,022 INFO L87 Difference]: Start difference. First operand 142 states and 386 transitions. Second operand 8 states. [2020-01-16 18:33:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:23,080 INFO L93 Difference]: Finished difference Result 220 states and 496 transitions. [2020-01-16 18:33:23,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:23,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:23,081 INFO L225 Difference]: With dead ends: 220 [2020-01-16 18:33:23,081 INFO L226 Difference]: Without dead ends: 209 [2020-01-16 18:33:23,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:23,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-01-16 18:33:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 141. [2020-01-16 18:33:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-01-16 18:33:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 384 transitions. [2020-01-16 18:33:23,085 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 384 transitions. Word has length 19 [2020-01-16 18:33:23,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:23,085 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 384 transitions. [2020-01-16 18:33:23,085 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:23,085 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 384 transitions. [2020-01-16 18:33:23,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:23,086 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:23,086 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:23,086 INFO L426 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-01-16 18:33:23,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:23,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1855684284, now seen corresponding path program 525 times [2020-01-16 18:33:23,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:23,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341608567] [2020-01-16 18:33:23,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:23,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341608567] [2020-01-16 18:33:23,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:23,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:23,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422778284] [2020-01-16 18:33:23,264 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:23,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:23,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:23,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:23,264 INFO L87 Difference]: Start difference. First operand 141 states and 384 transitions. Second operand 8 states. [2020-01-16 18:33:23,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:23,338 INFO L93 Difference]: Finished difference Result 222 states and 503 transitions. [2020-01-16 18:33:23,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:23,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:23,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:23,339 INFO L225 Difference]: With dead ends: 222 [2020-01-16 18:33:23,340 INFO L226 Difference]: Without dead ends: 212 [2020-01-16 18:33:23,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:23,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-01-16 18:33:23,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2020-01-16 18:33:23,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-01-16 18:33:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 387 transitions. [2020-01-16 18:33:23,344 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 387 transitions. Word has length 19 [2020-01-16 18:33:23,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:23,344 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 387 transitions. [2020-01-16 18:33:23,344 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 387 transitions. [2020-01-16 18:33:23,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:23,344 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:23,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-01-16 18:33:23,344 INFO L426 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-01-16 18:33:23,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:23,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1484304008, now seen corresponding path program 526 times [2020-01-16 18:33:23,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:23,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791669220] [2020-01-16 18:33:23,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:23,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:23,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791669220] [2020-01-16 18:33:23,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:23,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:23,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367445849] [2020-01-16 18:33:23,531 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:23,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:23,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:23,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:23,532 INFO L87 Difference]: Start difference. First operand 143 states and 387 transitions. Second operand 8 states. [2020-01-16 18:33:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:23,619 INFO L93 Difference]: Finished difference Result 216 states and 499 transitions. [2020-01-16 18:33:23,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:23,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:23,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:23,620 INFO L225 Difference]: With dead ends: 216 [2020-01-16 18:33:23,620 INFO L226 Difference]: Without dead ends: 201 [2020-01-16 18:33:23,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-01-16 18:33:23,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-01-16 18:33:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 141. [2020-01-16 18:33:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-01-16 18:33:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 383 transitions. [2020-01-16 18:33:23,624 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 383 transitions. Word has length 19 [2020-01-16 18:33:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:23,624 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 383 transitions. [2020-01-16 18:33:23,624 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 383 transitions. [2020-01-16 18:33:23,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:23,625 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:23,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-01-16 18:33:23,625 INFO L426 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-01-16 18:33:23,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:23,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1067984392, now seen corresponding path program 527 times [2020-01-16 18:33:23,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:23,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158333540] [2020-01-16 18:33:23,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:23,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-01-16 18:33:23,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158333540] [2020-01-16 18:33:23,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:23,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:23,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452976369] [2020-01-16 18:33:23,818 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:23,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:23,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:23,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:23,819 INFO L87 Difference]: Start difference. First operand 141 states and 383 transitions. Second operand 8 states. [2020-01-16 18:33:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:23,883 INFO L93 Difference]: Finished difference Result 222 states and 502 transitions. [2020-01-16 18:33:23,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:23,884 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:23,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:23,884 INFO L225 Difference]: With dead ends: 222 [2020-01-16 18:33:23,885 INFO L226 Difference]: Without dead ends: 212 [2020-01-16 18:33:23,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-01-16 18:33:23,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2020-01-16 18:33:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-01-16 18:33:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 386 transitions. [2020-01-16 18:33:23,888 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 386 transitions. Word has length 19 [2020-01-16 18:33:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:23,888 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 386 transitions. [2020-01-16 18:33:23,888 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 386 transitions. [2020-01-16 18:33:23,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:23,888 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:23,888 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:23,889 INFO L426 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-01-16 18:33:23,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:23,889 INFO L82 PathProgramCache]: Analyzing trace with hash 421420604, now seen corresponding path program 528 times [2020-01-16 18:33:23,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:23,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125177017] [2020-01-16 18:33:23,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:24,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125177017] [2020-01-16 18:33:24,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:24,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:24,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308480716] [2020-01-16 18:33:24,082 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:24,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:24,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:24,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:24,083 INFO L87 Difference]: Start difference. First operand 143 states and 386 transitions. Second operand 8 states. [2020-01-16 18:33:24,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:24,169 INFO L93 Difference]: Finished difference Result 216 states and 498 transitions. [2020-01-16 18:33:24,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:24,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:24,170 INFO L225 Difference]: With dead ends: 216 [2020-01-16 18:33:24,170 INFO L226 Difference]: Without dead ends: 198 [2020-01-16 18:33:24,170 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:24,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-01-16 18:33:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 138. [2020-01-16 18:33:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-01-16 18:33:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 378 transitions. [2020-01-16 18:33:24,174 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 378 transitions. Word has length 19 [2020-01-16 18:33:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:24,174 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 378 transitions. [2020-01-16 18:33:24,174 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 378 transitions. [2020-01-16 18:33:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:24,175 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:24,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-01-16 18:33:24,175 INFO L426 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-01-16 18:33:24,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:24,175 INFO L82 PathProgramCache]: Analyzing trace with hash 380240202, now seen corresponding path program 529 times [2020-01-16 18:33:24,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:24,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725780751] [2020-01-16 18:33:24,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:24,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725780751] [2020-01-16 18:33:24,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:24,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:24,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304588975] [2020-01-16 18:33:24,381 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:24,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:24,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:24,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:24,381 INFO L87 Difference]: Start difference. First operand 138 states and 378 transitions. Second operand 8 states. [2020-01-16 18:33:24,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:24,443 INFO L93 Difference]: Finished difference Result 245 states and 557 transitions. [2020-01-16 18:33:24,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:24,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:24,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:24,444 INFO L225 Difference]: With dead ends: 245 [2020-01-16 18:33:24,444 INFO L226 Difference]: Without dead ends: 229 [2020-01-16 18:33:24,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-01-16 18:33:24,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-01-16 18:33:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 141. [2020-01-16 18:33:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-01-16 18:33:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 382 transitions. [2020-01-16 18:33:24,448 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 382 transitions. Word has length 19 [2020-01-16 18:33:24,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:24,448 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 382 transitions. [2020-01-16 18:33:24,448 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:24,448 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 382 transitions. [2020-01-16 18:33:24,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:24,449 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:24,449 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:24,449 INFO L426 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-01-16 18:33:24,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:24,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1771486344, now seen corresponding path program 530 times [2020-01-16 18:33:24,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:24,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768006778] [2020-01-16 18:33:24,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:24,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:24,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768006778] [2020-01-16 18:33:24,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:24,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:24,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129650703] [2020-01-16 18:33:24,651 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:24,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:24,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:24,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:24,652 INFO L87 Difference]: Start difference. First operand 141 states and 382 transitions. Second operand 8 states. [2020-01-16 18:33:24,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:24,738 INFO L93 Difference]: Finished difference Result 239 states and 542 transitions. [2020-01-16 18:33:24,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:24,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:24,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:24,740 INFO L225 Difference]: With dead ends: 239 [2020-01-16 18:33:24,740 INFO L226 Difference]: Without dead ends: 226 [2020-01-16 18:33:24,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-01-16 18:33:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-01-16 18:33:24,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 138. [2020-01-16 18:33:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-01-16 18:33:24,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 375 transitions. [2020-01-16 18:33:24,744 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 375 transitions. Word has length 19 [2020-01-16 18:33:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:24,744 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 375 transitions. [2020-01-16 18:33:24,744 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 375 transitions. [2020-01-16 18:33:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:24,744 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:24,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-01-16 18:33:24,745 INFO L426 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-01-16 18:33:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:24,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1474331790, now seen corresponding path program 531 times [2020-01-16 18:33:24,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:24,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282126027] [2020-01-16 18:33:24,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:24,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282126027] [2020-01-16 18:33:24,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:24,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:24,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602120473] [2020-01-16 18:33:24,947 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:24,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:24,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:24,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:24,948 INFO L87 Difference]: Start difference. First operand 138 states and 375 transitions. Second operand 8 states. [2020-01-16 18:33:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:25,009 INFO L93 Difference]: Finished difference Result 249 states and 566 transitions. [2020-01-16 18:33:25,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:25,010 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:25,010 INFO L225 Difference]: With dead ends: 249 [2020-01-16 18:33:25,011 INFO L226 Difference]: Without dead ends: 233 [2020-01-16 18:33:25,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-01-16 18:33:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-01-16 18:33:25,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 143. [2020-01-16 18:33:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-01-16 18:33:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 384 transitions. [2020-01-16 18:33:25,014 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 384 transitions. Word has length 19 [2020-01-16 18:33:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:25,014 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 384 transitions. [2020-01-16 18:33:25,015 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 384 transitions. [2020-01-16 18:33:25,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:25,015 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:25,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-01-16 18:33:25,015 INFO L426 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-01-16 18:33:25,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:25,015 INFO L82 PathProgramCache]: Analyzing trace with hash 723269696, now seen corresponding path program 532 times [2020-01-16 18:33:25,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:25,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282966325] [2020-01-16 18:33:25,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:25,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282966325] [2020-01-16 18:33:25,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:25,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:25,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758863507] [2020-01-16 18:33:25,213 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:25,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:25,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:25,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:25,214 INFO L87 Difference]: Start difference. First operand 143 states and 384 transitions. Second operand 8 states. [2020-01-16 18:33:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:25,298 INFO L93 Difference]: Finished difference Result 245 states and 554 transitions. [2020-01-16 18:33:25,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:25,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:25,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:25,299 INFO L225 Difference]: With dead ends: 245 [2020-01-16 18:33:25,299 INFO L226 Difference]: Without dead ends: 228 [2020-01-16 18:33:25,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:25,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-01-16 18:33:25,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 138. [2020-01-16 18:33:25,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-01-16 18:33:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 372 transitions. [2020-01-16 18:33:25,303 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 372 transitions. Word has length 19 [2020-01-16 18:33:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:25,303 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 372 transitions. [2020-01-16 18:33:25,303 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:25,303 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 372 transitions. [2020-01-16 18:33:25,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:25,303 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:25,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-01-16 18:33:25,304 INFO L426 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-01-16 18:33:25,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:25,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1883916852, now seen corresponding path program 533 times [2020-01-16 18:33:25,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:25,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490020926] [2020-01-16 18:33:25,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:25,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490020926] [2020-01-16 18:33:25,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:25,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:25,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299182162] [2020-01-16 18:33:25,501 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:25,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:25,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:25,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:25,502 INFO L87 Difference]: Start difference. First operand 138 states and 372 transitions. Second operand 8 states. [2020-01-16 18:33:25,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:25,586 INFO L93 Difference]: Finished difference Result 234 states and 530 transitions. [2020-01-16 18:33:25,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:25,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:25,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:25,587 INFO L225 Difference]: With dead ends: 234 [2020-01-16 18:33:25,587 INFO L226 Difference]: Without dead ends: 224 [2020-01-16 18:33:25,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-01-16 18:33:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-01-16 18:33:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 140. [2020-01-16 18:33:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-01-16 18:33:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 375 transitions. [2020-01-16 18:33:25,590 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 375 transitions. Word has length 19 [2020-01-16 18:33:25,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:25,591 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 375 transitions. [2020-01-16 18:33:25,591 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 375 transitions. [2020-01-16 18:33:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:25,591 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:25,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-01-16 18:33:25,591 INFO L426 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-01-16 18:33:25,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:25,591 INFO L82 PathProgramCache]: Analyzing trace with hash -700437136, now seen corresponding path program 534 times [2020-01-16 18:33:25,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:25,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705859354] [2020-01-16 18:33:25,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:25,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705859354] [2020-01-16 18:33:25,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:25,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:25,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666683912] [2020-01-16 18:33:25,786 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:25,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:25,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:25,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:25,787 INFO L87 Difference]: Start difference. First operand 140 states and 375 transitions. Second operand 8 states. [2020-01-16 18:33:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:25,873 INFO L93 Difference]: Finished difference Result 236 states and 533 transitions. [2020-01-16 18:33:25,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:25,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:25,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:25,874 INFO L225 Difference]: With dead ends: 236 [2020-01-16 18:33:25,874 INFO L226 Difference]: Without dead ends: 219 [2020-01-16 18:33:25,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-01-16 18:33:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-01-16 18:33:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 135. [2020-01-16 18:33:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-01-16 18:33:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 365 transitions. [2020-01-16 18:33:25,877 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 365 transitions. Word has length 19 [2020-01-16 18:33:25,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:25,877 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 365 transitions. [2020-01-16 18:33:25,877 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 365 transitions. [2020-01-16 18:33:25,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:25,878 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:25,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-01-16 18:33:25,878 INFO L426 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-01-16 18:33:25,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:25,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1988693016, now seen corresponding path program 535 times [2020-01-16 18:33:25,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:25,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532902632] [2020-01-16 18:33:25,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:26,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532902632] [2020-01-16 18:33:26,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:26,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:26,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476283484] [2020-01-16 18:33:26,054 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:26,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:26,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:26,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:26,054 INFO L87 Difference]: Start difference. First operand 135 states and 365 transitions. Second operand 8 states. [2020-01-16 18:33:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:26,118 INFO L93 Difference]: Finished difference Result 241 states and 542 transitions. [2020-01-16 18:33:26,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:26,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:26,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:26,119 INFO L225 Difference]: With dead ends: 241 [2020-01-16 18:33:26,119 INFO L226 Difference]: Without dead ends: 225 [2020-01-16 18:33:26,119 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-01-16 18:33:26,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-01-16 18:33:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 135. [2020-01-16 18:33:26,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-01-16 18:33:26,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 362 transitions. [2020-01-16 18:33:26,122 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 362 transitions. Word has length 19 [2020-01-16 18:33:26,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:26,122 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 362 transitions. [2020-01-16 18:33:26,122 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:26,122 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 362 transitions. [2020-01-16 18:33:26,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:26,122 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:26,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-01-16 18:33:26,123 INFO L426 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-01-16 18:33:26,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:26,123 INFO L82 PathProgramCache]: Analyzing trace with hash 154547734, now seen corresponding path program 536 times [2020-01-16 18:33:26,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:26,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240372368] [2020-01-16 18:33:26,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:26,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240372368] [2020-01-16 18:33:26,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:26,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:26,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013696858] [2020-01-16 18:33:26,300 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:26,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:26,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:26,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:26,300 INFO L87 Difference]: Start difference. First operand 135 states and 362 transitions. Second operand 8 states. [2020-01-16 18:33:26,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:26,376 INFO L93 Difference]: Finished difference Result 235 states and 527 transitions. [2020-01-16 18:33:26,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:26,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:26,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:26,377 INFO L225 Difference]: With dead ends: 235 [2020-01-16 18:33:26,378 INFO L226 Difference]: Without dead ends: 222 [2020-01-16 18:33:26,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:26,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-01-16 18:33:26,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 132. [2020-01-16 18:33:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-01-16 18:33:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 355 transitions. [2020-01-16 18:33:26,381 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 355 transitions. Word has length 19 [2020-01-16 18:33:26,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:26,382 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 355 transitions. [2020-01-16 18:33:26,382 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 355 transitions. [2020-01-16 18:33:26,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:26,382 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:26,382 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:26,382 INFO L426 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-01-16 18:33:26,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:26,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1799928014, now seen corresponding path program 537 times [2020-01-16 18:33:26,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:26,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176245244] [2020-01-16 18:33:26,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:26,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176245244] [2020-01-16 18:33:26,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:26,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:26,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829025601] [2020-01-16 18:33:26,566 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:26,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:26,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:26,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:26,567 INFO L87 Difference]: Start difference. First operand 132 states and 355 transitions. Second operand 8 states. [2020-01-16 18:33:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:26,632 INFO L93 Difference]: Finished difference Result 239 states and 541 transitions. [2020-01-16 18:33:26,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:26,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:26,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:26,634 INFO L225 Difference]: With dead ends: 239 [2020-01-16 18:33:26,634 INFO L226 Difference]: Without dead ends: 223 [2020-01-16 18:33:26,634 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-01-16 18:33:26,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-01-16 18:33:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 138. [2020-01-16 18:33:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-01-16 18:33:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 366 transitions. [2020-01-16 18:33:26,637 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 366 transitions. Word has length 19 [2020-01-16 18:33:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:26,637 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 366 transitions. [2020-01-16 18:33:26,637 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 366 transitions. [2020-01-16 18:33:26,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:26,638 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:26,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-01-16 18:33:26,638 INFO L426 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-01-16 18:33:26,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash 823723264, now seen corresponding path program 538 times [2020-01-16 18:33:26,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:26,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051749437] [2020-01-16 18:33:26,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:26,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051749437] [2020-01-16 18:33:26,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:26,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:26,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226049309] [2020-01-16 18:33:26,815 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:26,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:26,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:26,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:26,816 INFO L87 Difference]: Start difference. First operand 138 states and 366 transitions. Second operand 8 states. [2020-01-16 18:33:26,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:26,899 INFO L93 Difference]: Finished difference Result 227 states and 521 transitions. [2020-01-16 18:33:26,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:26,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:26,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:26,900 INFO L225 Difference]: With dead ends: 227 [2020-01-16 18:33:26,900 INFO L226 Difference]: Without dead ends: 208 [2020-01-16 18:33:26,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-01-16 18:33:26,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-01-16 18:33:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 132. [2020-01-16 18:33:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-01-16 18:33:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 352 transitions. [2020-01-16 18:33:26,904 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 352 transitions. Word has length 19 [2020-01-16 18:33:26,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:26,904 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 352 transitions. [2020-01-16 18:33:26,904 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:26,904 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 352 transitions. [2020-01-16 18:33:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:26,904 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:26,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-01-16 18:33:26,904 INFO L426 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-01-16 18:33:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash 270189236, now seen corresponding path program 539 times [2020-01-16 18:33:26,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:26,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197488273] [2020-01-16 18:33:26,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:27,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197488273] [2020-01-16 18:33:27,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:27,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:27,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052092427] [2020-01-16 18:33:27,076 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:27,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:27,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:27,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:27,077 INFO L87 Difference]: Start difference. First operand 132 states and 352 transitions. Second operand 8 states. [2020-01-16 18:33:27,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:27,151 INFO L93 Difference]: Finished difference Result 229 states and 514 transitions. [2020-01-16 18:33:27,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:27,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:27,153 INFO L225 Difference]: With dead ends: 229 [2020-01-16 18:33:27,153 INFO L226 Difference]: Without dead ends: 219 [2020-01-16 18:33:27,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-01-16 18:33:27,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-01-16 18:33:27,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 134. [2020-01-16 18:33:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-01-16 18:33:27,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2020-01-16 18:33:27,156 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 19 [2020-01-16 18:33:27,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:27,156 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2020-01-16 18:33:27,156 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:27,156 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2020-01-16 18:33:27,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:27,156 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:27,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-01-16 18:33:27,157 INFO L426 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-01-16 18:33:27,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:27,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1458858098, now seen corresponding path program 540 times [2020-01-16 18:33:27,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:27,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939474217] [2020-01-16 18:33:27,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:27,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939474217] [2020-01-16 18:33:27,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:27,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:27,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59399077] [2020-01-16 18:33:27,334 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:27,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:27,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:27,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:27,334 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 8 states. [2020-01-16 18:33:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:27,418 INFO L93 Difference]: Finished difference Result 223 states and 510 transitions. [2020-01-16 18:33:27,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:27,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:27,419 INFO L225 Difference]: With dead ends: 223 [2020-01-16 18:33:27,419 INFO L226 Difference]: Without dead ends: 205 [2020-01-16 18:33:27,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-01-16 18:33:27,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-01-16 18:33:27,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 129. [2020-01-16 18:33:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-01-16 18:33:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 345 transitions. [2020-01-16 18:33:27,422 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 345 transitions. Word has length 19 [2020-01-16 18:33:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:27,422 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 345 transitions. [2020-01-16 18:33:27,422 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 345 transitions. [2020-01-16 18:33:27,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:27,423 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:27,423 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:27,423 INFO L426 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-01-16 18:33:27,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:27,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1337500568, now seen corresponding path program 541 times [2020-01-16 18:33:27,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:27,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992892026] [2020-01-16 18:33:27,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:27,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992892026] [2020-01-16 18:33:27,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:27,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:27,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400991230] [2020-01-16 18:33:27,621 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:27,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:27,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:27,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:27,621 INFO L87 Difference]: Start difference. First operand 129 states and 345 transitions. Second operand 8 states. [2020-01-16 18:33:27,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:27,684 INFO L93 Difference]: Finished difference Result 243 states and 557 transitions. [2020-01-16 18:33:27,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:27,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:27,685 INFO L225 Difference]: With dead ends: 243 [2020-01-16 18:33:27,685 INFO L226 Difference]: Without dead ends: 227 [2020-01-16 18:33:27,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-01-16 18:33:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-01-16 18:33:27,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 139. [2020-01-16 18:33:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-01-16 18:33:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 373 transitions. [2020-01-16 18:33:27,688 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 373 transitions. Word has length 19 [2020-01-16 18:33:27,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:27,688 INFO L478 AbstractCegarLoop]: Abstraction has 139 states and 373 transitions. [2020-01-16 18:33:27,688 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:27,688 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 373 transitions. [2020-01-16 18:33:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:27,688 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:27,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-01-16 18:33:27,689 INFO L426 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-01-16 18:33:27,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:27,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2088562662, now seen corresponding path program 542 times [2020-01-16 18:33:27,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:27,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473483048] [2020-01-16 18:33:27,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:27,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-01-16 18:33:27,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473483048] [2020-01-16 18:33:27,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:27,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:27,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002975814] [2020-01-16 18:33:27,888 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:27,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:27,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:27,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:27,889 INFO L87 Difference]: Start difference. First operand 139 states and 373 transitions. Second operand 8 states. [2020-01-16 18:33:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:27,972 INFO L93 Difference]: Finished difference Result 239 states and 545 transitions. [2020-01-16 18:33:27,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:27,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:27,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:27,974 INFO L225 Difference]: With dead ends: 239 [2020-01-16 18:33:27,974 INFO L226 Difference]: Without dead ends: 222 [2020-01-16 18:33:27,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-01-16 18:33:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-01-16 18:33:27,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 134. [2020-01-16 18:33:27,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-01-16 18:33:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 359 transitions. [2020-01-16 18:33:27,977 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 359 transitions. Word has length 19 [2020-01-16 18:33:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:27,977 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 359 transitions. [2020-01-16 18:33:27,977 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 359 transitions. [2020-01-16 18:33:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:27,978 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:27,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-01-16 18:33:27,978 INFO L426 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-01-16 18:33:27,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:27,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1357028874, now seen corresponding path program 543 times [2020-01-16 18:33:27,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:27,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183992954] [2020-01-16 18:33:27,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:28,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183992954] [2020-01-16 18:33:28,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:28,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:28,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920787673] [2020-01-16 18:33:28,177 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:28,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:28,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:28,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:28,177 INFO L87 Difference]: Start difference. First operand 134 states and 359 transitions. Second operand 8 states. [2020-01-16 18:33:28,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:28,242 INFO L93 Difference]: Finished difference Result 231 states and 525 transitions. [2020-01-16 18:33:28,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:28,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:28,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:28,243 INFO L225 Difference]: With dead ends: 231 [2020-01-16 18:33:28,243 INFO L226 Difference]: Without dead ends: 215 [2020-01-16 18:33:28,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:28,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-01-16 18:33:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 140. [2020-01-16 18:33:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-01-16 18:33:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 370 transitions. [2020-01-16 18:33:28,247 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 370 transitions. Word has length 19 [2020-01-16 18:33:28,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:28,247 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 370 transitions. [2020-01-16 18:33:28,247 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 370 transitions. [2020-01-16 18:33:28,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:28,247 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:28,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-01-16 18:33:28,248 INFO L426 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-01-16 18:33:28,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:28,248 INFO L82 PathProgramCache]: Analyzing trace with hash 380824124, now seen corresponding path program 544 times [2020-01-16 18:33:28,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:28,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376411638] [2020-01-16 18:33:28,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:28,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376411638] [2020-01-16 18:33:28,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:28,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:28,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767672853] [2020-01-16 18:33:28,439 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:28,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:28,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:28,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:28,439 INFO L87 Difference]: Start difference. First operand 140 states and 370 transitions. Second operand 8 states. [2020-01-16 18:33:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:28,523 INFO L93 Difference]: Finished difference Result 219 states and 505 transitions. [2020-01-16 18:33:28,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:28,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:28,524 INFO L225 Difference]: With dead ends: 219 [2020-01-16 18:33:28,525 INFO L226 Difference]: Without dead ends: 200 [2020-01-16 18:33:28,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-01-16 18:33:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-01-16 18:33:28,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 134. [2020-01-16 18:33:28,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-01-16 18:33:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 354 transitions. [2020-01-16 18:33:28,528 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 354 transitions. Word has length 19 [2020-01-16 18:33:28,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:28,528 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 354 transitions. [2020-01-16 18:33:28,529 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 354 transitions. [2020-01-16 18:33:28,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:28,529 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:28,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-01-16 18:33:28,529 INFO L426 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-01-16 18:33:28,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:28,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2008828456, now seen corresponding path program 545 times [2020-01-16 18:33:28,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:28,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773005878] [2020-01-16 18:33:28,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:28,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773005878] [2020-01-16 18:33:28,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:28,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:28,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630919644] [2020-01-16 18:33:28,722 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:28,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:28,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:28,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:28,722 INFO L87 Difference]: Start difference. First operand 134 states and 354 transitions. Second operand 8 states. [2020-01-16 18:33:28,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:28,806 INFO L93 Difference]: Finished difference Result 216 states and 499 transitions. [2020-01-16 18:33:28,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:28,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:28,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:28,807 INFO L225 Difference]: With dead ends: 216 [2020-01-16 18:33:28,807 INFO L226 Difference]: Without dead ends: 204 [2020-01-16 18:33:28,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-01-16 18:33:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-01-16 18:33:28,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 138. [2020-01-16 18:33:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-01-16 18:33:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 362 transitions. [2020-01-16 18:33:28,811 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 362 transitions. Word has length 19 [2020-01-16 18:33:28,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:28,811 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 362 transitions. [2020-01-16 18:33:28,811 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 362 transitions. [2020-01-16 18:33:28,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:28,811 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:28,812 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:28,812 INFO L426 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-01-16 18:33:28,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:28,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1427264310, now seen corresponding path program 546 times [2020-01-16 18:33:28,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:28,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995546498] [2020-01-16 18:33:28,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:29,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995546498] [2020-01-16 18:33:29,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:29,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:29,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542461300] [2020-01-16 18:33:29,007 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:29,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:29,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:29,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:29,007 INFO L87 Difference]: Start difference. First operand 138 states and 362 transitions. Second operand 8 states. [2020-01-16 18:33:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:29,089 INFO L93 Difference]: Finished difference Result 203 states and 478 transitions. [2020-01-16 18:33:29,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:29,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:29,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:29,090 INFO L225 Difference]: With dead ends: 203 [2020-01-16 18:33:29,090 INFO L226 Difference]: Without dead ends: 181 [2020-01-16 18:33:29,090 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:29,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-01-16 18:33:29,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 129. [2020-01-16 18:33:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-01-16 18:33:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 342 transitions. [2020-01-16 18:33:29,093 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 342 transitions. Word has length 19 [2020-01-16 18:33:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:29,093 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 342 transitions. [2020-01-16 18:33:29,093 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 342 transitions. [2020-01-16 18:33:29,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:29,093 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:29,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-01-16 18:33:29,093 INFO L426 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-01-16 18:33:29,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:29,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1173836118, now seen corresponding path program 547 times [2020-01-16 18:33:29,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:29,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084164075] [2020-01-16 18:33:29,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:29,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084164075] [2020-01-16 18:33:29,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:29,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:29,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347300769] [2020-01-16 18:33:29,283 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:29,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:29,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:29,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:29,283 INFO L87 Difference]: Start difference. First operand 129 states and 342 transitions. Second operand 8 states. [2020-01-16 18:33:29,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:29,367 INFO L93 Difference]: Finished difference Result 221 states and 497 transitions. [2020-01-16 18:33:29,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:29,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:29,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:29,368 INFO L225 Difference]: With dead ends: 221 [2020-01-16 18:33:29,368 INFO L226 Difference]: Without dead ends: 211 [2020-01-16 18:33:29,368 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-01-16 18:33:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 133. [2020-01-16 18:33:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-01-16 18:33:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 352 transitions. [2020-01-16 18:33:29,372 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 352 transitions. Word has length 19 [2020-01-16 18:33:29,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:29,372 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 352 transitions. [2020-01-16 18:33:29,372 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:29,373 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 352 transitions. [2020-01-16 18:33:29,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:29,373 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:29,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-01-16 18:33:29,373 INFO L426 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-01-16 18:33:29,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:29,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1410517870, now seen corresponding path program 548 times [2020-01-16 18:33:29,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:29,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607483793] [2020-01-16 18:33:29,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:29,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607483793] [2020-01-16 18:33:29,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:29,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:29,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418461619] [2020-01-16 18:33:29,569 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:29,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:29,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:29,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:29,570 INFO L87 Difference]: Start difference. First operand 133 states and 352 transitions. Second operand 8 states. [2020-01-16 18:33:29,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:29,657 INFO L93 Difference]: Finished difference Result 223 states and 500 transitions. [2020-01-16 18:33:29,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:29,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:29,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:29,658 INFO L225 Difference]: With dead ends: 223 [2020-01-16 18:33:29,658 INFO L226 Difference]: Without dead ends: 209 [2020-01-16 18:33:29,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-01-16 18:33:29,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 131. [2020-01-16 18:33:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-01-16 18:33:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 347 transitions. [2020-01-16 18:33:29,661 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 347 transitions. Word has length 19 [2020-01-16 18:33:29,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:29,662 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 347 transitions. [2020-01-16 18:33:29,662 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 347 transitions. [2020-01-16 18:33:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:29,662 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:29,662 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:29,662 INFO L426 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-01-16 18:33:29,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:29,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1918538616, now seen corresponding path program 549 times [2020-01-16 18:33:29,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:29,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714696515] [2020-01-16 18:33:29,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33: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-01-16 18:33:29,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714696515] [2020-01-16 18:33:29,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:29,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:29,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399184222] [2020-01-16 18:33:29,853 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:29,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:29,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:29,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:29,853 INFO L87 Difference]: Start difference. First operand 131 states and 347 transitions. Second operand 8 states. [2020-01-16 18:33:29,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:29,941 INFO L93 Difference]: Finished difference Result 218 states and 489 transitions. [2020-01-16 18:33:29,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:29,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:29,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:29,942 INFO L225 Difference]: With dead ends: 218 [2020-01-16 18:33:29,942 INFO L226 Difference]: Without dead ends: 208 [2020-01-16 18:33:29,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-01-16 18:33:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-01-16 18:33:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 133. [2020-01-16 18:33:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-01-16 18:33:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 350 transitions. [2020-01-16 18:33:29,946 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 350 transitions. Word has length 19 [2020-01-16 18:33:29,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:29,946 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 350 transitions. [2020-01-16 18:33:29,946 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:29,946 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 350 transitions. [2020-01-16 18:33:29,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:29,946 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:29,946 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:29,947 INFO L426 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-01-16 18:33:29,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:29,947 INFO L82 PathProgramCache]: Analyzing trace with hash 189491282, now seen corresponding path program 550 times [2020-01-16 18:33:29,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:29,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810202336] [2020-01-16 18:33:29,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:30,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810202336] [2020-01-16 18:33:30,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:30,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:30,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018724916] [2020-01-16 18:33:30,133 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:30,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:30,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:30,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:30,134 INFO L87 Difference]: Start difference. First operand 133 states and 350 transitions. Second operand 8 states. [2020-01-16 18:33:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:30,218 INFO L93 Difference]: Finished difference Result 212 states and 485 transitions. [2020-01-16 18:33:30,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:30,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:30,219 INFO L225 Difference]: With dead ends: 212 [2020-01-16 18:33:30,219 INFO L226 Difference]: Without dead ends: 197 [2020-01-16 18:33:30,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-01-16 18:33:30,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 131. [2020-01-16 18:33:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-01-16 18:33:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 345 transitions. [2020-01-16 18:33:30,223 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 345 transitions. Word has length 19 [2020-01-16 18:33:30,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:30,223 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 345 transitions. [2020-01-16 18:33:30,223 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 345 transitions. [2020-01-16 18:33:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:30,223 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:30,224 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:30,224 INFO L426 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-01-16 18:33:30,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:30,224 INFO L82 PathProgramCache]: Analyzing trace with hash 823589624, now seen corresponding path program 551 times [2020-01-16 18:33:30,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:30,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970539953] [2020-01-16 18:33:30,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:30,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970539953] [2020-01-16 18:33:30,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:30,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:30,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035917580] [2020-01-16 18:33:30,419 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:30,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:30,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:30,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:30,420 INFO L87 Difference]: Start difference. First operand 131 states and 345 transitions. Second operand 8 states. [2020-01-16 18:33:30,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:30,502 INFO L93 Difference]: Finished difference Result 213 states and 490 transitions. [2020-01-16 18:33:30,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:30,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:30,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:30,503 INFO L225 Difference]: With dead ends: 213 [2020-01-16 18:33:30,503 INFO L226 Difference]: Without dead ends: 201 [2020-01-16 18:33:30,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-01-16 18:33:30,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-01-16 18:33:30,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 135. [2020-01-16 18:33:30,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-01-16 18:33:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 353 transitions. [2020-01-16 18:33:30,506 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 353 transitions. Word has length 19 [2020-01-16 18:33:30,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:30,506 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 353 transitions. [2020-01-16 18:33:30,506 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 353 transitions. [2020-01-16 18:33:30,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:30,507 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:30,507 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:30,507 INFO L426 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-01-16 18:33:30,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:30,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1678896278, now seen corresponding path program 552 times [2020-01-16 18:33:30,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:30,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864714583] [2020-01-16 18:33:30,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:30,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-01-16 18:33:30,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864714583] [2020-01-16 18:33:30,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:30,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:30,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859197880] [2020-01-16 18:33:30,702 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:30,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:30,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:30,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:30,703 INFO L87 Difference]: Start difference. First operand 135 states and 353 transitions. Second operand 8 states. [2020-01-16 18:33:30,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:30,787 INFO L93 Difference]: Finished difference Result 200 states and 469 transitions. [2020-01-16 18:33:30,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:30,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:30,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:30,788 INFO L225 Difference]: With dead ends: 200 [2020-01-16 18:33:30,789 INFO L226 Difference]: Without dead ends: 178 [2020-01-16 18:33:30,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:30,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-01-16 18:33:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 126. [2020-01-16 18:33:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-01-16 18:33:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 336 transitions. [2020-01-16 18:33:30,792 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 336 transitions. Word has length 19 [2020-01-16 18:33:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:30,792 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 336 transitions. [2020-01-16 18:33:30,792 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 336 transitions. [2020-01-16 18:33:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:30,793 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:30,793 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:30,793 INFO L426 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-01-16 18:33:30,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:30,794 INFO L82 PathProgramCache]: Analyzing trace with hash 283350700, now seen corresponding path program 553 times [2020-01-16 18:33:30,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:30,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942176465] [2020-01-16 18:33:30,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:30,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942176465] [2020-01-16 18:33:30,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:30,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:30,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376596134] [2020-01-16 18:33:30,998 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:30,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:30,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:30,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:30,998 INFO L87 Difference]: Start difference. First operand 126 states and 336 transitions. Second operand 8 states. [2020-01-16 18:33:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:31,057 INFO L93 Difference]: Finished difference Result 220 states and 486 transitions. [2020-01-16 18:33:31,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:31,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:31,058 INFO L225 Difference]: With dead ends: 220 [2020-01-16 18:33:31,058 INFO L226 Difference]: Without dead ends: 204 [2020-01-16 18:33:31,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-01-16 18:33:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-01-16 18:33:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 129. [2020-01-16 18:33:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-01-16 18:33:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 340 transitions. [2020-01-16 18:33:31,061 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 340 transitions. Word has length 19 [2020-01-16 18:33:31,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:31,061 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 340 transitions. [2020-01-16 18:33:31,061 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:31,061 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 340 transitions. [2020-01-16 18:33:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:31,061 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:31,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-01-16 18:33:31,062 INFO L426 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-01-16 18:33:31,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:31,062 INFO L82 PathProgramCache]: Analyzing trace with hash 542408926, now seen corresponding path program 554 times [2020-01-16 18:33:31,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:31,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834381757] [2020-01-16 18:33:31,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:31,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834381757] [2020-01-16 18:33:31,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:31,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:31,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585945870] [2020-01-16 18:33:31,262 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:31,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:31,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:31,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:31,262 INFO L87 Difference]: Start difference. First operand 129 states and 340 transitions. Second operand 8 states. [2020-01-16 18:33:31,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:31,324 INFO L93 Difference]: Finished difference Result 214 states and 471 transitions. [2020-01-16 18:33:31,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:31,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:31,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:31,325 INFO L225 Difference]: With dead ends: 214 [2020-01-16 18:33:31,325 INFO L226 Difference]: Without dead ends: 201 [2020-01-16 18:33: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-01-16 18:33:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-01-16 18:33:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 126. [2020-01-16 18:33:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-01-16 18:33:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 333 transitions. [2020-01-16 18:33:31,329 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 333 transitions. Word has length 19 [2020-01-16 18:33:31,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:31,329 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 333 transitions. [2020-01-16 18:33:31,329 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:31,329 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 333 transitions. [2020-01-16 18:33:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:31,329 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33: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-01-16 18:33:31,330 INFO L426 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-01-16 18:33:31,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:31,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1317087154, now seen corresponding path program 555 times [2020-01-16 18:33:31,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:31,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383643279] [2020-01-16 18:33:31,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:31,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383643279] [2020-01-16 18:33:31,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:31,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:31,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576289078] [2020-01-16 18:33:31,531 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:31,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:31,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:31,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:31,531 INFO L87 Difference]: Start difference. First operand 126 states and 333 transitions. Second operand 8 states. [2020-01-16 18:33:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:31,593 INFO L93 Difference]: Finished difference Result 224 states and 495 transitions. [2020-01-16 18:33:31,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:31,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:31,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:31,594 INFO L225 Difference]: With dead ends: 224 [2020-01-16 18:33:31,594 INFO L226 Difference]: Without dead ends: 208 [2020-01-16 18:33:31,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-01-16 18:33:31,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-01-16 18:33:31,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 131. [2020-01-16 18:33:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-01-16 18:33:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 342 transitions. [2020-01-16 18:33:31,597 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 342 transitions. Word has length 19 [2020-01-16 18:33:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:31,597 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 342 transitions. [2020-01-16 18:33:31,597 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:31,597 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 342 transitions. [2020-01-16 18:33:31,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:31,597 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:31,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-01-16 18:33:31,598 INFO L426 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-01-16 18:33:31,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:31,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2068149248, now seen corresponding path program 556 times [2020-01-16 18:33:31,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:31,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784696880] [2020-01-16 18:33:31,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:31,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784696880] [2020-01-16 18:33:31,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:31,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:31,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985743619] [2020-01-16 18:33:31,799 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:31,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:31,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:31,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:31,799 INFO L87 Difference]: Start difference. First operand 131 states and 342 transitions. Second operand 8 states. [2020-01-16 18:33:31,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:31,878 INFO L93 Difference]: Finished difference Result 220 states and 483 transitions. [2020-01-16 18:33:31,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:31,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:31,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:31,879 INFO L225 Difference]: With dead ends: 220 [2020-01-16 18:33:31,879 INFO L226 Difference]: Without dead ends: 203 [2020-01-16 18:33:31,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-01-16 18:33:31,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2020-01-16 18:33:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-01-16 18:33:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 330 transitions. [2020-01-16 18:33:31,882 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 330 transitions. Word has length 19 [2020-01-16 18:33:31,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:31,882 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 330 transitions. [2020-01-16 18:33:31,882 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 330 transitions. [2020-01-16 18:33:31,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:31,882 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:31,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-01-16 18:33:31,883 INFO L426 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-01-16 18:33:31,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:31,883 INFO L82 PathProgramCache]: Analyzing trace with hash -916665526, now seen corresponding path program 557 times [2020-01-16 18:33:31,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:31,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982776271] [2020-01-16 18:33:31,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:32,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982776271] [2020-01-16 18:33:32,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:32,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:32,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272825117] [2020-01-16 18:33:32,084 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:32,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:32,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:32,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:32,084 INFO L87 Difference]: Start difference. First operand 126 states and 330 transitions. Second operand 8 states. [2020-01-16 18:33:32,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:32,147 INFO L93 Difference]: Finished difference Result 209 states and 459 transitions. [2020-01-16 18:33:32,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:32,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:32,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:32,148 INFO L225 Difference]: With dead ends: 209 [2020-01-16 18:33:32,148 INFO L226 Difference]: Without dead ends: 199 [2020-01-16 18:33:32,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:32,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-01-16 18:33:32,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 128. [2020-01-16 18:33:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-01-16 18:33:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 333 transitions. [2020-01-16 18:33:32,151 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 333 transitions. Word has length 19 [2020-01-16 18:33:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:32,151 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 333 transitions. [2020-01-16 18:33:32,151 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 333 transitions. [2020-01-16 18:33:32,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:32,152 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:32,152 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:32,152 INFO L426 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-01-16 18:33:32,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:32,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1771972180, now seen corresponding path program 558 times [2020-01-16 18:33:32,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:32,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129775869] [2020-01-16 18:33:32,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:32,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-01-16 18:33:32,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129775869] [2020-01-16 18:33:32,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:32,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:32,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573162741] [2020-01-16 18:33:32,349 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:32,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:32,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:32,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:32,349 INFO L87 Difference]: Start difference. First operand 128 states and 333 transitions. Second operand 8 states. [2020-01-16 18:33:32,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:32,434 INFO L93 Difference]: Finished difference Result 211 states and 462 transitions. [2020-01-16 18:33:32,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:32,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:32,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:32,435 INFO L225 Difference]: With dead ends: 211 [2020-01-16 18:33:32,435 INFO L226 Difference]: Without dead ends: 194 [2020-01-16 18:33:32,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-01-16 18:33:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-01-16 18:33:32,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 123. [2020-01-16 18:33:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-01-16 18:33:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 323 transitions. [2020-01-16 18:33:32,438 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 323 transitions. Word has length 19 [2020-01-16 18:33:32,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:32,439 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 323 transitions. [2020-01-16 18:33:32,439 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 323 transitions. [2020-01-16 18:33:32,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:32,439 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:32,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-01-16 18:33:32,439 INFO L426 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-01-16 18:33:32,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:32,439 INFO L82 PathProgramCache]: Analyzing trace with hash -2085582518, now seen corresponding path program 559 times [2020-01-16 18:33:32,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:32,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043763597] [2020-01-16 18:33:32,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:32,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-01-16 18:33:32,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043763597] [2020-01-16 18:33:32,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:32,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:32,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744247326] [2020-01-16 18:33:32,625 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:32,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:32,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:32,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:32,626 INFO L87 Difference]: Start difference. First operand 123 states and 323 transitions. Second operand 8 states. [2020-01-16 18:33:32,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:32,687 INFO L93 Difference]: Finished difference Result 215 states and 468 transitions. [2020-01-16 18:33:32,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:32,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:32,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:32,688 INFO L225 Difference]: With dead ends: 215 [2020-01-16 18:33:32,688 INFO L226 Difference]: Without dead ends: 199 [2020-01-16 18:33:32,688 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-01-16 18:33:32,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-01-16 18:33:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 123. [2020-01-16 18:33:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-01-16 18:33:32,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 320 transitions. [2020-01-16 18:33:32,691 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 320 transitions. Word has length 19 [2020-01-16 18:33:32,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:32,692 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 320 transitions. [2020-01-16 18:33:32,692 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 320 transitions. [2020-01-16 18:33:32,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:32,692 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:32,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-01-16 18:33:32,692 INFO L426 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-01-16 18:33:32,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:32,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1826524292, now seen corresponding path program 560 times [2020-01-16 18:33:32,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:32,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742014121] [2020-01-16 18:33:32,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:32,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:32,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742014121] [2020-01-16 18:33:32,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:32,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:32,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829382997] [2020-01-16 18:33:32,884 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:32,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:32,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:32,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:32,885 INFO L87 Difference]: Start difference. First operand 123 states and 320 transitions. Second operand 8 states. [2020-01-16 18:33:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:32,950 INFO L93 Difference]: Finished difference Result 209 states and 453 transitions. [2020-01-16 18:33:32,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:32,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:32,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:32,951 INFO L225 Difference]: With dead ends: 209 [2020-01-16 18:33:32,951 INFO L226 Difference]: Without dead ends: 196 [2020-01-16 18:33:32,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-01-16 18:33:32,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-01-16 18:33:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 120. [2020-01-16 18:33:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-01-16 18:33:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 313 transitions. [2020-01-16 18:33:32,954 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 313 transitions. Word has length 19 [2020-01-16 18:33:32,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:32,954 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 313 transitions. [2020-01-16 18:33:32,954 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:32,954 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 313 transitions. [2020-01-16 18:33:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:32,955 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:32,955 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:32,955 INFO L426 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-01-16 18:33:32,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:32,955 INFO L82 PathProgramCache]: Analyzing trace with hash -991490930, now seen corresponding path program 561 times [2020-01-16 18:33:32,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:32,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133834426] [2020-01-16 18:33:32,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:33,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133834426] [2020-01-16 18:33:33,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:33,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:33,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478731833] [2020-01-16 18:33:33,158 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:33,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:33,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:33,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:33,158 INFO L87 Difference]: Start difference. First operand 120 states and 313 transitions. Second operand 8 states. [2020-01-16 18:33:33,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:33,218 INFO L93 Difference]: Finished difference Result 213 states and 467 transitions. [2020-01-16 18:33:33,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:33,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:33,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:33,219 INFO L225 Difference]: With dead ends: 213 [2020-01-16 18:33:33,219 INFO L226 Difference]: Without dead ends: 197 [2020-01-16 18:33:33,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:33,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-01-16 18:33:33,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 126. [2020-01-16 18:33:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-01-16 18:33:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 324 transitions. [2020-01-16 18:33:33,223 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 324 transitions. Word has length 19 [2020-01-16 18:33:33,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:33,223 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 324 transitions. [2020-01-16 18:33:33,223 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 324 transitions. [2020-01-16 18:33:33,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:33,223 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:33,223 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:33,223 INFO L426 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-01-16 18:33:33,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:33,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1967695680, now seen corresponding path program 562 times [2020-01-16 18:33:33,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:33,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143527767] [2020-01-16 18:33:33,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:33,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:33,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143527767] [2020-01-16 18:33:33,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:33,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:33,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733495392] [2020-01-16 18:33:33,414 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:33,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:33,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:33,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:33,414 INFO L87 Difference]: Start difference. First operand 126 states and 324 transitions. Second operand 8 states. [2020-01-16 18:33:33,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:33,494 INFO L93 Difference]: Finished difference Result 201 states and 447 transitions. [2020-01-16 18:33:33,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:33,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:33,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:33,495 INFO L225 Difference]: With dead ends: 201 [2020-01-16 18:33:33,495 INFO L226 Difference]: Without dead ends: 182 [2020-01-16 18:33:33,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-01-16 18:33:33,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 120. [2020-01-16 18:33:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-01-16 18:33:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 310 transitions. [2020-01-16 18:33:33,499 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 310 transitions. Word has length 19 [2020-01-16 18:33:33,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:33,499 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 310 transitions. [2020-01-16 18:33:33,499 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:33,499 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 310 transitions. [2020-01-16 18:33:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:33,499 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:33,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-01-16 18:33:33,500 INFO L426 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-01-16 18:33:33,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:33,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1019871656, now seen corresponding path program 563 times [2020-01-16 18:33:33,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:33,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207941251] [2020-01-16 18:33:33,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:33,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207941251] [2020-01-16 18:33:33,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:33,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:33,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282161631] [2020-01-16 18:33:33,689 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:33,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:33,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:33,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:33,689 INFO L87 Difference]: Start difference. First operand 120 states and 310 transitions. Second operand 8 states. [2020-01-16 18:33:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:33,751 INFO L93 Difference]: Finished difference Result 203 states and 440 transitions. [2020-01-16 18:33:33,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:33,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:33,753 INFO L225 Difference]: With dead ends: 203 [2020-01-16 18:33:33,753 INFO L226 Difference]: Without dead ends: 193 [2020-01-16 18:33:33,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-01-16 18:33:33,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 122. [2020-01-16 18:33:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-01-16 18:33:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 313 transitions. [2020-01-16 18:33:33,756 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 313 transitions. Word has length 19 [2020-01-16 18:33:33,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:33,756 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 313 transitions. [2020-01-16 18:33:33,756 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:33,756 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 313 transitions. [2020-01-16 18:33:33,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:33,756 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:33,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-01-16 18:33:33,756 INFO L426 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-01-16 18:33:33,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:33,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1785690644, now seen corresponding path program 564 times [2020-01-16 18:33:33,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:33,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829817356] [2020-01-16 18:33:33,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:33,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:33,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829817356] [2020-01-16 18:33:33,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:33,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:33,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912708198] [2020-01-16 18:33:33,942 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:33,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:33,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:33,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:33,943 INFO L87 Difference]: Start difference. First operand 122 states and 313 transitions. Second operand 8 states. [2020-01-16 18:33:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:34,019 INFO L93 Difference]: Finished difference Result 197 states and 436 transitions. [2020-01-16 18:33:34,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:34,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:34,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:34,020 INFO L225 Difference]: With dead ends: 197 [2020-01-16 18:33:34,020 INFO L226 Difference]: Without dead ends: 179 [2020-01-16 18:33:34,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:34,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-01-16 18:33:34,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2020-01-16 18:33:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-01-16 18:33:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 303 transitions. [2020-01-16 18:33:34,024 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 303 transitions. Word has length 19 [2020-01-16 18:33:34,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:34,024 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 303 transitions. [2020-01-16 18:33:34,024 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:34,024 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 303 transitions. [2020-01-16 18:33:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:34,024 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:34,024 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:34,024 INFO L426 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-01-16 18:33:34,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:34,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1759986294, now seen corresponding path program 565 times [2020-01-16 18:33:34,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:34,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664078827] [2020-01-16 18:33:34,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:34,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664078827] [2020-01-16 18:33:34,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:34,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:34,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519051932] [2020-01-16 18:33:34,223 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:34,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:34,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:34,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:34,223 INFO L87 Difference]: Start difference. First operand 117 states and 303 transitions. Second operand 8 states. [2020-01-16 18:33:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:34,285 INFO L93 Difference]: Finished difference Result 207 states and 450 transitions. [2020-01-16 18:33:34,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:34,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:34,286 INFO L225 Difference]: With dead ends: 207 [2020-01-16 18:33:34,286 INFO L226 Difference]: Without dead ends: 191 [2020-01-16 18:33:34,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-01-16 18:33:34,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 117. [2020-01-16 18:33:34,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-01-16 18:33:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 298 transitions. [2020-01-16 18:33:34,289 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 298 transitions. Word has length 19 [2020-01-16 18:33:34,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:34,289 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 298 transitions. [2020-01-16 18:33:34,290 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 298 transitions. [2020-01-16 18:33:34,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:34,290 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:34,290 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:34,290 INFO L426 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-01-16 18:33:34,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:34,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1783918908, now seen corresponding path program 566 times [2020-01-16 18:33:34,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:34,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160235304] [2020-01-16 18:33:34,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:34,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:34,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160235304] [2020-01-16 18:33:34,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:34,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:34,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466883922] [2020-01-16 18:33:34,490 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:34,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:34,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:34,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:34,491 INFO L87 Difference]: Start difference. First operand 117 states and 298 transitions. Second operand 8 states. [2020-01-16 18:33:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:34,575 INFO L93 Difference]: Finished difference Result 203 states and 438 transitions. [2020-01-16 18:33:34,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:34,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:34,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:34,576 INFO L225 Difference]: With dead ends: 203 [2020-01-16 18:33:34,576 INFO L226 Difference]: Without dead ends: 186 [2020-01-16 18:33:34,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-01-16 18:33:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-01-16 18:33:34,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 112. [2020-01-16 18:33:34,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-01-16 18:33:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 284 transitions. [2020-01-16 18:33:34,579 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 284 transitions. Word has length 19 [2020-01-16 18:33:34,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:34,579 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 284 transitions. [2020-01-16 18:33:34,579 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 284 transitions. [2020-01-16 18:33:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:34,580 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:34,580 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:34,580 INFO L426 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-01-16 18:33:34,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:34,580 INFO L82 PathProgramCache]: Analyzing trace with hash 934543148, now seen corresponding path program 567 times [2020-01-16 18:33:34,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:34,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449073876] [2020-01-16 18:33:34,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:34,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449073876] [2020-01-16 18:33:34,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:34,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:34,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294564183] [2020-01-16 18:33:34,787 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:34,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:34,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:34,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:34,788 INFO L87 Difference]: Start difference. First operand 112 states and 284 transitions. Second operand 8 states. [2020-01-16 18:33:34,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:34,843 INFO L93 Difference]: Finished difference Result 195 states and 418 transitions. [2020-01-16 18:33:34,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:34,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:34,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:34,844 INFO L225 Difference]: With dead ends: 195 [2020-01-16 18:33:34,845 INFO L226 Difference]: Without dead ends: 179 [2020-01-16 18:33:34,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:34,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-01-16 18:33:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 104. [2020-01-16 18:33:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-01-16 18:33:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 263 transitions. [2020-01-16 18:33:34,848 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 263 transitions. Word has length 19 [2020-01-16 18:33:34,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:34,848 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 263 transitions. [2020-01-16 18:33:34,848 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 263 transitions. [2020-01-16 18:33:34,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:34,849 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:34,849 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:34,849 INFO L426 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-01-16 18:33:34,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:34,849 INFO L82 PathProgramCache]: Analyzing trace with hash -41661602, now seen corresponding path program 568 times [2020-01-16 18:33:34,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:34,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569341418] [2020-01-16 18:33:34,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:35,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569341418] [2020-01-16 18:33:35,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:35,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:35,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803222178] [2020-01-16 18:33:35,045 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:35,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:35,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:35,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:35,046 INFO L87 Difference]: Start difference. First operand 104 states and 263 transitions. Second operand 8 states. [2020-01-16 18:33:35,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:35,133 INFO L93 Difference]: Finished difference Result 183 states and 398 transitions. [2020-01-16 18:33:35,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:35,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:35,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:35,134 INFO L225 Difference]: With dead ends: 183 [2020-01-16 18:33:35,134 INFO L226 Difference]: Without dead ends: 164 [2020-01-16 18:33:35,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-01-16 18:33:35,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-01-16 18:33:35,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 98. [2020-01-16 18:33:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-01-16 18:33:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 247 transitions. [2020-01-16 18:33:35,137 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 247 transitions. Word has length 19 [2020-01-16 18:33:35,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:35,138 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 247 transitions. [2020-01-16 18:33:35,138 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 247 transitions. [2020-01-16 18:33:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:35,138 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:35,138 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:35,138 INFO L426 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-01-16 18:33:35,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:35,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1586342730, now seen corresponding path program 569 times [2020-01-16 18:33:35,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:35,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217886233] [2020-01-16 18:33:35,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:35,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217886233] [2020-01-16 18:33:35,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:35,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:35,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418932345] [2020-01-16 18:33:35,332 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:35,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:35,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:35,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:35,332 INFO L87 Difference]: Start difference. First operand 98 states and 247 transitions. Second operand 8 states. [2020-01-16 18:33:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:35,415 INFO L93 Difference]: Finished difference Result 180 states and 392 transitions. [2020-01-16 18:33:35,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:35,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:35,416 INFO L225 Difference]: With dead ends: 180 [2020-01-16 18:33:35,416 INFO L226 Difference]: Without dead ends: 168 [2020-01-16 18:33:35,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-01-16 18:33:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 102. [2020-01-16 18:33:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-01-16 18:33:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 255 transitions. [2020-01-16 18:33:35,419 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 255 transitions. Word has length 19 [2020-01-16 18:33:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:35,419 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 255 transitions. [2020-01-16 18:33:35,420 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 255 transitions. [2020-01-16 18:33:35,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:35,420 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:35,420 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:35,420 INFO L426 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-01-16 18:33:35,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:35,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1849750036, now seen corresponding path program 570 times [2020-01-16 18:33:35,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:35,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809646893] [2020-01-16 18:33:35,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:35,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-01-16 18:33:35,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809646893] [2020-01-16 18:33:35,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:35,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:35,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703609880] [2020-01-16 18:33:35,611 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:35,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:35,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:35,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:35,612 INFO L87 Difference]: Start difference. First operand 102 states and 255 transitions. Second operand 8 states. [2020-01-16 18:33:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:35,697 INFO L93 Difference]: Finished difference Result 167 states and 371 transitions. [2020-01-16 18:33:35,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:35,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:35,698 INFO L225 Difference]: With dead ends: 167 [2020-01-16 18:33:35,699 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 18:33:35,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-01-16 18:33:35,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 18:33:35,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2020-01-16 18:33:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 18:33:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 235 transitions. [2020-01-16 18:33:35,701 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 235 transitions. Word has length 19 [2020-01-16 18:33:35,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:35,701 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 235 transitions. [2020-01-16 18:33:35,701 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 235 transitions. [2020-01-16 18:33:35,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:35,702 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:35,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:35,702 INFO L426 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-01-16 18:33:35,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:35,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1422262942, now seen corresponding path program 571 times [2020-01-16 18:33:35,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:35,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51850666] [2020-01-16 18:33:35,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:35,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:35,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51850666] [2020-01-16 18:33:35,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:35,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:35,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141290600] [2020-01-16 18:33:35,909 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:35,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:35,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:35,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:35,910 INFO L87 Difference]: Start difference. First operand 93 states and 235 transitions. Second operand 8 states. [2020-01-16 18:33:35,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:35,980 INFO L93 Difference]: Finished difference Result 172 states and 373 transitions. [2020-01-16 18:33:35,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:35,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:35,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:35,981 INFO L225 Difference]: With dead ends: 172 [2020-01-16 18:33:35,981 INFO L226 Difference]: Without dead ends: 162 [2020-01-16 18:33:35,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:35,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-01-16 18:33:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 97. [2020-01-16 18:33:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-01-16 18:33:35,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 245 transitions. [2020-01-16 18:33:35,984 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 245 transitions. Word has length 19 [2020-01-16 18:33:35,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:35,984 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 245 transitions. [2020-01-16 18:33:35,984 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 245 transitions. [2020-01-16 18:33:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:35,985 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:35,985 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:35,985 INFO L426 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-01-16 18:33:35,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash 566956288, now seen corresponding path program 572 times [2020-01-16 18:33:35,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:35,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304323384] [2020-01-16 18:33:35,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:36,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304323384] [2020-01-16 18:33:36,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:36,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:36,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674453869] [2020-01-16 18:33:36,178 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:36,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:36,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:36,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:36,179 INFO L87 Difference]: Start difference. First operand 97 states and 245 transitions. Second operand 8 states. [2020-01-16 18:33:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:36,260 INFO L93 Difference]: Finished difference Result 174 states and 376 transitions. [2020-01-16 18:33:36,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:36,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:36,261 INFO L225 Difference]: With dead ends: 174 [2020-01-16 18:33:36,262 INFO L226 Difference]: Without dead ends: 160 [2020-01-16 18:33:36,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-01-16 18:33:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-01-16 18:33:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 95. [2020-01-16 18:33:36,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-01-16 18:33:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 240 transitions. [2020-01-16 18:33:36,264 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 240 transitions. Word has length 19 [2020-01-16 18:33:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:36,265 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 240 transitions. [2020-01-16 18:33:36,265 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 240 transitions. [2020-01-16 18:33:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:36,265 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:36,265 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:36,265 INFO L426 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-01-16 18:33:36,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:36,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1261763396, now seen corresponding path program 573 times [2020-01-16 18:33:36,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:36,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912935933] [2020-01-16 18:33:36,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:36,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912935933] [2020-01-16 18:33:36,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:36,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:36,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280369793] [2020-01-16 18:33:36,462 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:36,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:36,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:36,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:36,462 INFO L87 Difference]: Start difference. First operand 95 states and 240 transitions. Second operand 8 states. [2020-01-16 18:33:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:36,535 INFO L93 Difference]: Finished difference Result 168 states and 363 transitions. [2020-01-16 18:33:36,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:36,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:36,536 INFO L225 Difference]: With dead ends: 168 [2020-01-16 18:33:36,536 INFO L226 Difference]: Without dead ends: 158 [2020-01-16 18:33:36,536 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-01-16 18:33:36,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 97. [2020-01-16 18:33:36,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-01-16 18:33:36,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 243 transitions. [2020-01-16 18:33:36,539 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 243 transitions. Word has length 19 [2020-01-16 18:33:36,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:36,539 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 243 transitions. [2020-01-16 18:33:36,539 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 243 transitions. [2020-01-16 18:33:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:36,539 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:36,539 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:36,540 INFO L426 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-01-16 18:33:36,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:36,540 INFO L82 PathProgramCache]: Analyzing trace with hash 227641600, now seen corresponding path program 574 times [2020-01-16 18:33:36,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:36,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880694751] [2020-01-16 18:33:36,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:36,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880694751] [2020-01-16 18:33:36,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:36,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:36,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757087770] [2020-01-16 18:33:36,730 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:36,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:36,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:36,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:36,731 INFO L87 Difference]: Start difference. First operand 97 states and 243 transitions. Second operand 8 states. [2020-01-16 18:33:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:36,818 INFO L93 Difference]: Finished difference Result 162 states and 359 transitions. [2020-01-16 18:33:36,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:36,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:36,819 INFO L225 Difference]: With dead ends: 162 [2020-01-16 18:33:36,819 INFO L226 Difference]: Without dead ends: 147 [2020-01-16 18:33:36,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-01-16 18:33:36,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-01-16 18:33:36,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 95. [2020-01-16 18:33:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-01-16 18:33:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 238 transitions. [2020-01-16 18:33:36,822 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 238 transitions. Word has length 19 [2020-01-16 18:33:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:36,822 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 238 transitions. [2020-01-16 18:33:36,822 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 238 transitions. [2020-01-16 18:33:36,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:36,823 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:36,823 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:36,823 INFO L426 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-01-16 18:33:36,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:36,823 INFO L82 PathProgramCache]: Analyzing trace with hash -506129092, now seen corresponding path program 575 times [2020-01-16 18:33:36,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:36,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454999354] [2020-01-16 18:33:36,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:37,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:37,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454999354] [2020-01-16 18:33:37,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:37,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:37,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781076246] [2020-01-16 18:33:37,023 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:37,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:37,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:37,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:37,023 INFO L87 Difference]: Start difference. First operand 95 states and 238 transitions. Second operand 8 states. [2020-01-16 18:33:37,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:37,111 INFO L93 Difference]: Finished difference Result 155 states and 344 transitions. [2020-01-16 18:33:37,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:37,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:37,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:37,112 INFO L225 Difference]: With dead ends: 155 [2020-01-16 18:33:37,112 INFO L226 Difference]: Without dead ends: 143 [2020-01-16 18:33:37,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-01-16 18:33:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 99. [2020-01-16 18:33:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-01-16 18:33:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 246 transitions. [2020-01-16 18:33:37,115 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 246 transitions. Word has length 19 [2020-01-16 18:33:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:37,115 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 246 transitions. [2020-01-16 18:33:37,115 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 246 transitions. [2020-01-16 18:33:37,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:37,115 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:37,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-01-16 18:33:37,116 INFO L426 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-01-16 18:33:37,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:37,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1261763396, now seen corresponding path program 576 times [2020-01-16 18:33:37,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:37,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432565783] [2020-01-16 18:33:37,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:37,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:37,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432565783] [2020-01-16 18:33:37,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:37,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:37,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188654657] [2020-01-16 18:33:37,306 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:37,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:37,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:37,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:37,307 INFO L87 Difference]: Start difference. First operand 99 states and 246 transitions. Second operand 8 states. [2020-01-16 18:33:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:37,392 INFO L93 Difference]: Finished difference Result 142 states and 323 transitions. [2020-01-16 18:33:37,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:37,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:37,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:37,393 INFO L225 Difference]: With dead ends: 142 [2020-01-16 18:33:37,393 INFO L226 Difference]: Without dead ends: 120 [2020-01-16 18:33:37,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-01-16 18:33:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-01-16 18:33:37,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 90. [2020-01-16 18:33:37,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 18:33:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 229 transitions. [2020-01-16 18:33:37,396 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 229 transitions. Word has length 19 [2020-01-16 18:33:37,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:37,396 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 229 transitions. [2020-01-16 18:33:37,397 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:37,397 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 229 transitions. [2020-01-16 18:33:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:37,397 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:37,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-01-16 18:33:37,397 INFO L426 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-01-16 18:33:37,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:37,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1776969654, now seen corresponding path program 577 times [2020-01-16 18:33:37,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:37,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246005552] [2020-01-16 18:33:37,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:37,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246005552] [2020-01-16 18:33:37,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:37,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:37,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881651794] [2020-01-16 18:33:37,613 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:37,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:37,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:37,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:37,614 INFO L87 Difference]: Start difference. First operand 90 states and 229 transitions. Second operand 8 states. [2020-01-16 18:33:37,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:37,700 INFO L93 Difference]: Finished difference Result 165 states and 357 transitions. [2020-01-16 18:33:37,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:37,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:37,701 INFO L225 Difference]: With dead ends: 165 [2020-01-16 18:33:37,701 INFO L226 Difference]: Without dead ends: 155 [2020-01-16 18:33:37,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-01-16 18:33:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-01-16 18:33:37,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 93. [2020-01-16 18:33:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 18:33:37,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 237 transitions. [2020-01-16 18:33:37,704 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 237 transitions. Word has length 19 [2020-01-16 18:33:37,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:37,704 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 237 transitions. [2020-01-16 18:33:37,704 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:37,704 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 237 transitions. [2020-01-16 18:33:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:37,705 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:37,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-01-16 18:33:37,705 INFO L426 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-01-16 18:33:37,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:37,705 INFO L82 PathProgramCache]: Analyzing trace with hash -2016611992, now seen corresponding path program 578 times [2020-01-16 18:33:37,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:37,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686263307] [2020-01-16 18:33:37,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:37,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686263307] [2020-01-16 18:33:37,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:37,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:37,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031484716] [2020-01-16 18:33:37,925 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:37,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:37,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:37,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:37,926 INFO L87 Difference]: Start difference. First operand 93 states and 237 transitions. Second operand 8 states. [2020-01-16 18:33:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:37,997 INFO L93 Difference]: Finished difference Result 165 states and 356 transitions. [2020-01-16 18:33:37,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:37,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:37,998 INFO L225 Difference]: With dead ends: 165 [2020-01-16 18:33:37,998 INFO L226 Difference]: Without dead ends: 154 [2020-01-16 18:33:37,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-01-16 18:33:37,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-01-16 18:33:38,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 92. [2020-01-16 18:33:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-01-16 18:33:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 235 transitions. [2020-01-16 18:33:38,001 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 235 transitions. Word has length 19 [2020-01-16 18:33:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:38,001 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 235 transitions. [2020-01-16 18:33:38,001 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 235 transitions. [2020-01-16 18:33:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:38,002 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:38,002 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:38,002 INFO L426 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-01-16 18:33:38,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:38,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1773295144, now seen corresponding path program 579 times [2020-01-16 18:33:38,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:38,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436684451] [2020-01-16 18:33:38,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:38,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436684451] [2020-01-16 18:33:38,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:38,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:38,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144454138] [2020-01-16 18:33:38,217 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:38,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:38,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:38,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:38,218 INFO L87 Difference]: Start difference. First operand 92 states and 235 transitions. Second operand 8 states. [2020-01-16 18:33:38,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:38,304 INFO L93 Difference]: Finished difference Result 168 states and 364 transitions. [2020-01-16 18:33:38,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:38,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:38,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:38,305 INFO L225 Difference]: With dead ends: 168 [2020-01-16 18:33:38,305 INFO L226 Difference]: Without dead ends: 158 [2020-01-16 18:33:38,306 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:38,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-01-16 18:33:38,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 94. [2020-01-16 18:33:38,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-01-16 18:33:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 238 transitions. [2020-01-16 18:33:38,308 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 238 transitions. Word has length 19 [2020-01-16 18:33:38,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:38,308 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 238 transitions. [2020-01-16 18:33:38,308 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:38,308 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 238 transitions. [2020-01-16 18:33:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:38,309 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:38,309 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:38,309 INFO L426 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-01-16 18:33:38,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:38,309 INFO L82 PathProgramCache]: Analyzing trace with hash -811058844, now seen corresponding path program 580 times [2020-01-16 18:33:38,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:38,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320218273] [2020-01-16 18:33:38,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:38,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320218273] [2020-01-16 18:33:38,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:38,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:38,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208455474] [2020-01-16 18:33:38,517 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:38,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:38,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:38,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:38,518 INFO L87 Difference]: Start difference. First operand 94 states and 238 transitions. Second operand 8 states. [2020-01-16 18:33:38,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:38,610 INFO L93 Difference]: Finished difference Result 170 states and 367 transitions. [2020-01-16 18:33:38,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:38,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:38,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:38,611 INFO L225 Difference]: With dead ends: 170 [2020-01-16 18:33:38,611 INFO L226 Difference]: Without dead ends: 156 [2020-01-16 18:33:38,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-01-16 18:33:38,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-01-16 18:33:38,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 92. [2020-01-16 18:33:38,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-01-16 18:33:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 234 transitions. [2020-01-16 18:33:38,613 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 234 transitions. Word has length 19 [2020-01-16 18:33:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:38,613 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 234 transitions. [2020-01-16 18:33:38,613 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:38,613 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 234 transitions. [2020-01-16 18:33:38,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:38,614 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:38,614 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:38,614 INFO L426 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-01-16 18:33:38,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:38,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1205269924, now seen corresponding path program 581 times [2020-01-16 18:33:38,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:38,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500436293] [2020-01-16 18:33:38,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:38,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500436293] [2020-01-16 18:33:38,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:38,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:38,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005102575] [2020-01-16 18:33:38,826 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:38,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:38,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:38,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:38,826 INFO L87 Difference]: Start difference. First operand 92 states and 234 transitions. Second operand 8 states. [2020-01-16 18:33:38,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:38,896 INFO L93 Difference]: Finished difference Result 168 states and 363 transitions. [2020-01-16 18:33:38,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:38,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:38,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:38,897 INFO L225 Difference]: With dead ends: 168 [2020-01-16 18:33:38,897 INFO L226 Difference]: Without dead ends: 158 [2020-01-16 18:33:38,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:38,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-01-16 18:33:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 94. [2020-01-16 18:33:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-01-16 18:33:38,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 237 transitions. [2020-01-16 18:33:38,899 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 237 transitions. Word has length 19 [2020-01-16 18:33:38,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:38,900 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 237 transitions. [2020-01-16 18:33:38,900 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 237 transitions. [2020-01-16 18:33:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:38,900 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:38,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-01-16 18:33:38,900 INFO L426 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-01-16 18:33:38,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:38,900 INFO L82 PathProgramCache]: Analyzing trace with hash 349963270, now seen corresponding path program 582 times [2020-01-16 18:33:38,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:38,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379815560] [2020-01-16 18:33:38,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:39,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379815560] [2020-01-16 18:33:39,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:39,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:39,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918620858] [2020-01-16 18:33:39,105 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:39,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:39,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:39,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:39,106 INFO L87 Difference]: Start difference. First operand 94 states and 237 transitions. Second operand 8 states. [2020-01-16 18:33:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:39,188 INFO L93 Difference]: Finished difference Result 170 states and 366 transitions. [2020-01-16 18:33:39,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:39,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:39,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:39,189 INFO L225 Difference]: With dead ends: 170 [2020-01-16 18:33:39,189 INFO L226 Difference]: Without dead ends: 155 [2020-01-16 18:33:39,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-01-16 18:33:39,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-01-16 18:33:39,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 91. [2020-01-16 18:33:39,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-01-16 18:33:39,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 232 transitions. [2020-01-16 18:33:39,192 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 232 transitions. Word has length 19 [2020-01-16 18:33:39,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:39,193 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 232 transitions. [2020-01-16 18:33:39,193 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 232 transitions. [2020-01-16 18:33:39,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:39,193 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:39,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-01-16 18:33:39,193 INFO L426 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-01-16 18:33:39,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:39,194 INFO L82 PathProgramCache]: Analyzing trace with hash 917559788, now seen corresponding path program 583 times [2020-01-16 18:33:39,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:39,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901166281] [2020-01-16 18:33:39,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:39,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:39,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901166281] [2020-01-16 18:33:39,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:39,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:39,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230765644] [2020-01-16 18:33:39,400 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:39,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:39,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:39,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:39,401 INFO L87 Difference]: Start difference. First operand 91 states and 232 transitions. Second operand 8 states. [2020-01-16 18:33:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:39,490 INFO L93 Difference]: Finished difference Result 163 states and 351 transitions. [2020-01-16 18:33:39,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:39,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:39,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:39,491 INFO L225 Difference]: With dead ends: 163 [2020-01-16 18:33:39,491 INFO L226 Difference]: Without dead ends: 153 [2020-01-16 18:33:39,491 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:39,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-01-16 18:33:39,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 93. [2020-01-16 18:33:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 18:33:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 236 transitions. [2020-01-16 18:33:39,494 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 236 transitions. Word has length 19 [2020-01-16 18:33:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:39,494 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 236 transitions. [2020-01-16 18:33:39,494 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:39,494 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 236 transitions. [2020-01-16 18:33:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:39,495 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:39,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-01-16 18:33:39,495 INFO L426 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-01-16 18:33:39,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:39,495 INFO L82 PathProgramCache]: Analyzing trace with hash 677917450, now seen corresponding path program 584 times [2020-01-16 18:33:39,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:39,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862775425] [2020-01-16 18:33:39,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:39,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862775425] [2020-01-16 18:33:39,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:39,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:39,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201467849] [2020-01-16 18:33:39,714 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:39,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:39,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:39,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:39,715 INFO L87 Difference]: Start difference. First operand 93 states and 236 transitions. Second operand 8 states. [2020-01-16 18:33:39,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:39,785 INFO L93 Difference]: Finished difference Result 163 states and 350 transitions. [2020-01-16 18:33:39,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:39,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:39,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:39,786 INFO L225 Difference]: With dead ends: 163 [2020-01-16 18:33:39,786 INFO L226 Difference]: Without dead ends: 152 [2020-01-16 18:33:39,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-01-16 18:33:39,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-01-16 18:33:39,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 92. [2020-01-16 18:33:39,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-01-16 18:33:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 234 transitions. [2020-01-16 18:33:39,789 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 234 transitions. Word has length 19 [2020-01-16 18:33:39,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:39,789 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 234 transitions. [2020-01-16 18:33:39,789 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 234 transitions. [2020-01-16 18:33:39,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:39,789 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:39,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-01-16 18:33:39,790 INFO L426 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-01-16 18:33:39,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash -155525592, now seen corresponding path program 585 times [2020-01-16 18:33:39,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:39,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384749892] [2020-01-16 18:33:39,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:39,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384749892] [2020-01-16 18:33:39,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:39,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:39,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083052306] [2020-01-16 18:33:39,984 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:39,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:39,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:39,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:39,985 INFO L87 Difference]: Start difference. First operand 92 states and 234 transitions. Second operand 8 states. [2020-01-16 18:33:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:40,074 INFO L93 Difference]: Finished difference Result 165 states and 357 transitions. [2020-01-16 18:33:40,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:40,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:40,075 INFO L225 Difference]: With dead ends: 165 [2020-01-16 18:33:40,075 INFO L226 Difference]: Without dead ends: 155 [2020-01-16 18:33:40,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-01-16 18:33:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 94. [2020-01-16 18:33:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-01-16 18:33:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 237 transitions. [2020-01-16 18:33:40,078 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 237 transitions. Word has length 19 [2020-01-16 18:33:40,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:40,078 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 237 transitions. [2020-01-16 18:33:40,078 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:40,078 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 237 transitions. [2020-01-16 18:33:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:40,079 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:40,079 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:40,079 INFO L426 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-01-16 18:33:40,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:40,079 INFO L82 PathProgramCache]: Analyzing trace with hash 799453412, now seen corresponding path program 586 times [2020-01-16 18:33:40,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:40,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837712219] [2020-01-16 18:33:40,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:40,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:40,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837712219] [2020-01-16 18:33:40,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:40,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:40,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479149828] [2020-01-16 18:33:40,280 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:40,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:40,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:40,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:40,281 INFO L87 Difference]: Start difference. First operand 94 states and 237 transitions. Second operand 8 states. [2020-01-16 18:33:40,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:40,372 INFO L93 Difference]: Finished difference Result 159 states and 353 transitions. [2020-01-16 18:33:40,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:40,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:40,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:40,373 INFO L225 Difference]: With dead ends: 159 [2020-01-16 18:33:40,373 INFO L226 Difference]: Without dead ends: 144 [2020-01-16 18:33:40,373 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:40,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-01-16 18:33:40,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 92. [2020-01-16 18:33:40,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-01-16 18:33:40,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 233 transitions. [2020-01-16 18:33:40,375 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 233 transitions. Word has length 19 [2020-01-16 18:33:40,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:40,376 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 233 transitions. [2020-01-16 18:33:40,376 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:40,376 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 233 transitions. [2020-01-16 18:33:40,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:40,376 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:40,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-01-16 18:33:40,376 INFO L426 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-01-16 18:33:40,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:40,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1215773028, now seen corresponding path program 587 times [2020-01-16 18:33:40,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:40,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470665790] [2020-01-16 18:33:40,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:40,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470665790] [2020-01-16 18:33:40,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:40,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:40,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570911959] [2020-01-16 18:33:40,584 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:40,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:40,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:40,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:40,584 INFO L87 Difference]: Start difference. First operand 92 states and 233 transitions. Second operand 8 states. [2020-01-16 18:33:40,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:40,651 INFO L93 Difference]: Finished difference Result 165 states and 356 transitions. [2020-01-16 18:33:40,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:40,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:40,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:40,651 INFO L225 Difference]: With dead ends: 165 [2020-01-16 18:33:40,651 INFO L226 Difference]: Without dead ends: 155 [2020-01-16 18:33:40,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-01-16 18:33:40,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-01-16 18:33:40,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 94. [2020-01-16 18:33:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-01-16 18:33:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 236 transitions. [2020-01-16 18:33:40,654 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 236 transitions. Word has length 19 [2020-01-16 18:33:40,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:40,654 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 236 transitions. [2020-01-16 18:33:40,654 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 236 transitions. [2020-01-16 18:33:40,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:40,655 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:40,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:40,655 INFO L426 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-01-16 18:33:40,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:40,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1589789272, now seen corresponding path program 588 times [2020-01-16 18:33:40,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:40,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955770065] [2020-01-16 18:33:40,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:40,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-01-16 18:33:40,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955770065] [2020-01-16 18:33:40,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:40,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:40,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404720312] [2020-01-16 18:33:40,856 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:40,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:40,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:40,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:40,857 INFO L87 Difference]: Start difference. First operand 94 states and 236 transitions. Second operand 8 states. [2020-01-16 18:33:40,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:40,935 INFO L93 Difference]: Finished difference Result 159 states and 352 transitions. [2020-01-16 18:33:40,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:40,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:40,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:40,936 INFO L225 Difference]: With dead ends: 159 [2020-01-16 18:33:40,936 INFO L226 Difference]: Without dead ends: 143 [2020-01-16 18:33:40,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-01-16 18:33:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-01-16 18:33:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 91. [2020-01-16 18:33:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-01-16 18:33:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 231 transitions. [2020-01-16 18:33:40,939 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 231 transitions. Word has length 19 [2020-01-16 18:33:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:40,939 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 231 transitions. [2020-01-16 18:33:40,940 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 231 transitions. [2020-01-16 18:33:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:40,940 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:40,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-01-16 18:33:40,940 INFO L426 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-01-16 18:33:40,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:40,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1427580564, now seen corresponding path program 589 times [2020-01-16 18:33:40,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:40,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853406834] [2020-01-16 18:33:40,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:41,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853406834] [2020-01-16 18:33:41,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:41,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:41,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239353762] [2020-01-16 18:33:41,141 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:41,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:41,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:41,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:41,142 INFO L87 Difference]: Start difference. First operand 91 states and 231 transitions. Second operand 8 states. [2020-01-16 18:33:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:41,231 INFO L93 Difference]: Finished difference Result 161 states and 347 transitions. [2020-01-16 18:33:41,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:41,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:41,232 INFO L225 Difference]: With dead ends: 161 [2020-01-16 18:33:41,232 INFO L226 Difference]: Without dead ends: 151 [2020-01-16 18:33:41,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-01-16 18:33:41,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-01-16 18:33:41,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 95. [2020-01-16 18:33:41,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-01-16 18:33:41,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 241 transitions. [2020-01-16 18:33:41,235 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 241 transitions. Word has length 19 [2020-01-16 18:33:41,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:41,235 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 241 transitions. [2020-01-16 18:33:41,235 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:41,235 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 241 transitions. [2020-01-16 18:33:41,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:41,235 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:41,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-01-16 18:33:41,235 INFO L426 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-01-16 18:33:41,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:41,235 INFO L82 PathProgramCache]: Analyzing trace with hash 283032744, now seen corresponding path program 590 times [2020-01-16 18:33:41,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:41,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892655353] [2020-01-16 18:33:41,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:41,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892655353] [2020-01-16 18:33:41,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:41,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:41,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411367202] [2020-01-16 18:33:41,439 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:41,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:41,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:41,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:41,439 INFO L87 Difference]: Start difference. First operand 95 states and 241 transitions. Second operand 8 states. [2020-01-16 18:33:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:41,530 INFO L93 Difference]: Finished difference Result 163 states and 350 transitions. [2020-01-16 18:33:41,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:41,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:41,531 INFO L225 Difference]: With dead ends: 163 [2020-01-16 18:33:41,531 INFO L226 Difference]: Without dead ends: 149 [2020-01-16 18:33:41,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-01-16 18:33:41,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-01-16 18:33:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 93. [2020-01-16 18:33:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 18:33:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 236 transitions. [2020-01-16 18:33:41,534 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 236 transitions. Word has length 19 [2020-01-16 18:33:41,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:41,535 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 236 transitions. [2020-01-16 18:33:41,535 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 236 transitions. [2020-01-16 18:33:41,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:41,535 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:41,535 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:41,535 INFO L426 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-01-16 18:33:41,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:41,536 INFO L82 PathProgramCache]: Analyzing trace with hash 917559788, now seen corresponding path program 591 times [2020-01-16 18:33:41,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:41,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384904877] [2020-01-16 18:33:41,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:41,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384904877] [2020-01-16 18:33:41,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:41,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:41,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686883360] [2020-01-16 18:33:41,739 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:41,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:41,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:41,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:41,739 INFO L87 Difference]: Start difference. First operand 93 states and 236 transitions. Second operand 8 states. [2020-01-16 18:33:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:41,830 INFO L93 Difference]: Finished difference Result 158 states and 339 transitions. [2020-01-16 18:33:41,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:41,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:41,831 INFO L225 Difference]: With dead ends: 158 [2020-01-16 18:33:41,831 INFO L226 Difference]: Without dead ends: 148 [2020-01-16 18:33:41,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-01-16 18:33:41,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-01-16 18:33:41,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 95. [2020-01-16 18:33:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-01-16 18:33:41,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 239 transitions. [2020-01-16 18:33:41,834 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 239 transitions. Word has length 19 [2020-01-16 18:33:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:41,834 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 239 transitions. [2020-01-16 18:33:41,834 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 239 transitions. [2020-01-16 18:33:41,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:41,834 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:41,835 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:41,835 INFO L426 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-01-16 18:33:41,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:41,835 INFO L82 PathProgramCache]: Analyzing trace with hash -811487546, now seen corresponding path program 592 times [2020-01-16 18:33:41,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:41,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245969964] [2020-01-16 18:33:41,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:42,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245969964] [2020-01-16 18:33:42,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:42,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:42,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487476924] [2020-01-16 18:33:42,033 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:42,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:42,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:42,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:42,033 INFO L87 Difference]: Start difference. First operand 95 states and 239 transitions. Second operand 8 states. [2020-01-16 18:33:42,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:42,138 INFO L93 Difference]: Finished difference Result 152 states and 335 transitions. [2020-01-16 18:33:42,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:42,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:42,139 INFO L225 Difference]: With dead ends: 152 [2020-01-16 18:33:42,139 INFO L226 Difference]: Without dead ends: 137 [2020-01-16 18:33:42,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-01-16 18:33:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 93. [2020-01-16 18:33:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 18:33:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 234 transitions. [2020-01-16 18:33:42,142 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 234 transitions. Word has length 19 [2020-01-16 18:33:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:42,142 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 234 transitions. [2020-01-16 18:33:42,142 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 234 transitions. [2020-01-16 18:33:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:42,143 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:42,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-01-16 18:33:42,143 INFO L426 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-01-16 18:33:42,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:42,143 INFO L82 PathProgramCache]: Analyzing trace with hash -177389204, now seen corresponding path program 593 times [2020-01-16 18:33:42,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:42,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994744194] [2020-01-16 18:33:42,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:42,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994744194] [2020-01-16 18:33:42,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:42,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:42,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432379972] [2020-01-16 18:33:42,344 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:42,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:42,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:42,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:42,345 INFO L87 Difference]: Start difference. First operand 93 states and 234 transitions. Second operand 8 states. [2020-01-16 18:33:42,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:42,424 INFO L93 Difference]: Finished difference Result 153 states and 340 transitions. [2020-01-16 18:33:42,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:42,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:42,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:42,425 INFO L225 Difference]: With dead ends: 153 [2020-01-16 18:33:42,425 INFO L226 Difference]: Without dead ends: 141 [2020-01-16 18:33:42,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:42,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-01-16 18:33:42,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 97. [2020-01-16 18:33:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-01-16 18:33:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 242 transitions. [2020-01-16 18:33:42,428 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 242 transitions. Word has length 19 [2020-01-16 18:33:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:42,428 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 242 transitions. [2020-01-16 18:33:42,428 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 242 transitions. [2020-01-16 18:33:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:42,429 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:42,429 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:42,429 INFO L426 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-01-16 18:33:42,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:42,429 INFO L82 PathProgramCache]: Analyzing trace with hash 677917450, now seen corresponding path program 594 times [2020-01-16 18:33:42,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:42,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127261943] [2020-01-16 18:33:42,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:42,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-01-16 18:33:42,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127261943] [2020-01-16 18:33:42,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:42,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:42,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074239870] [2020-01-16 18:33:42,680 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:42,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:42,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:42,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:42,680 INFO L87 Difference]: Start difference. First operand 97 states and 242 transitions. Second operand 8 states. [2020-01-16 18:33:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:42,764 INFO L93 Difference]: Finished difference Result 140 states and 319 transitions. [2020-01-16 18:33:42,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:42,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:42,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:42,765 INFO L225 Difference]: With dead ends: 140 [2020-01-16 18:33:42,765 INFO L226 Difference]: Without dead ends: 121 [2020-01-16 18:33:42,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:42,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-01-16 18:33:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 91. [2020-01-16 18:33:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-01-16 18:33:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 230 transitions. [2020-01-16 18:33:42,768 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 230 transitions. Word has length 19 [2020-01-16 18:33:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:42,768 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 230 transitions. [2020-01-16 18:33:42,768 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 230 transitions. [2020-01-16 18:33:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:42,769 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:42,769 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:42,769 INFO L426 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-01-16 18:33:42,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:42,769 INFO L82 PathProgramCache]: Analyzing trace with hash 698923658, now seen corresponding path program 595 times [2020-01-16 18:33:42,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:42,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017639084] [2020-01-16 18:33:42,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:42,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017639084] [2020-01-16 18:33:42,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:42,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:42,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607235183] [2020-01-16 18:33:42,983 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:42,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:42,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:42,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:42,983 INFO L87 Difference]: Start difference. First operand 91 states and 230 transitions. Second operand 8 states. [2020-01-16 18:33:43,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:43,039 INFO L93 Difference]: Finished difference Result 140 states and 309 transitions. [2020-01-16 18:33:43,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:43,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:43,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:43,039 INFO L225 Difference]: With dead ends: 140 [2020-01-16 18:33:43,040 INFO L226 Difference]: Without dead ends: 130 [2020-01-16 18:33:43,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:43,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-01-16 18:33:43,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 95. [2020-01-16 18:33:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-01-16 18:33:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 240 transitions. [2020-01-16 18:33:43,043 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 240 transitions. Word has length 19 [2020-01-16 18:33:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:43,043 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 240 transitions. [2020-01-16 18:33:43,043 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 240 transitions. [2020-01-16 18:33:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:43,044 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:43,044 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:43,044 INFO L426 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-01-16 18:33:43,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:43,044 INFO L82 PathProgramCache]: Analyzing trace with hash -156382996, now seen corresponding path program 596 times [2020-01-16 18:33:43,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:43,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257034182] [2020-01-16 18:33:43,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:43,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:43,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257034182] [2020-01-16 18:33:43,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:43,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:43,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112845985] [2020-01-16 18:33:43,257 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:43,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:43,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:43,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:43,258 INFO L87 Difference]: Start difference. First operand 95 states and 240 transitions. Second operand 8 states. [2020-01-16 18:33:43,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:43,347 INFO L93 Difference]: Finished difference Result 142 states and 312 transitions. [2020-01-16 18:33:43,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:43,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:43,348 INFO L225 Difference]: With dead ends: 142 [2020-01-16 18:33:43,348 INFO L226 Difference]: Without dead ends: 128 [2020-01-16 18:33:43,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:43,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-01-16 18:33:43,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2020-01-16 18:33:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 18:33:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 235 transitions. [2020-01-16 18:33:43,350 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 235 transitions. Word has length 19 [2020-01-16 18:33:43,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:43,351 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 235 transitions. [2020-01-16 18:33:43,351 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:43,351 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 235 transitions. [2020-01-16 18:33:43,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:43,351 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:43,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-01-16 18:33:43,351 INFO L426 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-01-16 18:33:43,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:43,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1985102680, now seen corresponding path program 597 times [2020-01-16 18:33:43,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:43,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887104900] [2020-01-16 18:33:43,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33: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-01-16 18:33:43,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887104900] [2020-01-16 18:33:43,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:43,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:43,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675677525] [2020-01-16 18:33:43,557 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:43,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:43,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:43,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:43,557 INFO L87 Difference]: Start difference. First operand 93 states and 235 transitions. Second operand 8 states. [2020-01-16 18:33:43,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:43,627 INFO L93 Difference]: Finished difference Result 136 states and 299 transitions. [2020-01-16 18:33:43,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:43,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:43,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:43,627 INFO L225 Difference]: With dead ends: 136 [2020-01-16 18:33:43,627 INFO L226 Difference]: Without dead ends: 126 [2020-01-16 18:33:43,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-01-16 18:33:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 95. [2020-01-16 18:33:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-01-16 18:33:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 238 transitions. [2020-01-16 18:33:43,629 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 238 transitions. Word has length 19 [2020-01-16 18:33:43,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:43,629 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 238 transitions. [2020-01-16 18:33:43,629 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:43,629 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 238 transitions. [2020-01-16 18:33:43,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:43,630 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:43,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-01-16 18:33:43,630 INFO L426 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-01-16 18:33:43,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:43,630 INFO L82 PathProgramCache]: Analyzing trace with hash -495697684, now seen corresponding path program 598 times [2020-01-16 18:33:43,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:43,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708530889] [2020-01-16 18:33:43,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:43,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-01-16 18:33:43,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708530889] [2020-01-16 18:33:43,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:43,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:43,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735722987] [2020-01-16 18:33:43,844 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:43,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:43,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:43,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:43,844 INFO L87 Difference]: Start difference. First operand 95 states and 238 transitions. Second operand 8 states. [2020-01-16 18:33:43,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:43,929 INFO L93 Difference]: Finished difference Result 130 states and 295 transitions. [2020-01-16 18:33:43,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:43,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:43,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:43,930 INFO L225 Difference]: With dead ends: 130 [2020-01-16 18:33:43,930 INFO L226 Difference]: Without dead ends: 115 [2020-01-16 18:33:43,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-01-16 18:33:43,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-01-16 18:33:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 93. [2020-01-16 18:33:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 18:33:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 233 transitions. [2020-01-16 18:33:43,932 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 233 transitions. Word has length 19 [2020-01-16 18:33:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:43,933 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 233 transitions. [2020-01-16 18:33:43,933 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 233 transitions. [2020-01-16 18:33:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:43,933 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:43,933 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:43,933 INFO L426 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-01-16 18:33:43,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:43,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1229468376, now seen corresponding path program 599 times [2020-01-16 18:33:43,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:43,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28619332] [2020-01-16 18:33:43,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:44,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28619332] [2020-01-16 18:33:44,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:44,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:44,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023573872] [2020-01-16 18:33:44,137 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:44,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:44,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:44,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:44,137 INFO L87 Difference]: Start difference. First operand 93 states and 233 transitions. Second operand 8 states. [2020-01-16 18:33:44,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:44,219 INFO L93 Difference]: Finished difference Result 123 states and 280 transitions. [2020-01-16 18:33:44,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:44,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:44,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:44,220 INFO L225 Difference]: With dead ends: 123 [2020-01-16 18:33:44,220 INFO L226 Difference]: Without dead ends: 111 [2020-01-16 18:33:44,220 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-01-16 18:33:44,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2020-01-16 18:33:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-01-16 18:33:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 241 transitions. [2020-01-16 18:33:44,223 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 241 transitions. Word has length 19 [2020-01-16 18:33:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:44,223 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 241 transitions. [2020-01-16 18:33:44,226 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 241 transitions. [2020-01-16 18:33:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:44,226 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:44,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-01-16 18:33:44,226 INFO L426 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-01-16 18:33:44,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:44,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1985102680, now seen corresponding path program 600 times [2020-01-16 18:33:44,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:44,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720804267] [2020-01-16 18:33:44,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:44,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:44,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720804267] [2020-01-16 18:33:44,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:44,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:44,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311326369] [2020-01-16 18:33:44,429 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:44,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:44,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:44,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:44,430 INFO L87 Difference]: Start difference. First operand 97 states and 241 transitions. Second operand 8 states. [2020-01-16 18:33:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:44,507 INFO L93 Difference]: Finished difference Result 110 states and 259 transitions. [2020-01-16 18:33:44,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:44,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:44,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:44,508 INFO L225 Difference]: With dead ends: 110 [2020-01-16 18:33:44,508 INFO L226 Difference]: Without dead ends: 88 [2020-01-16 18:33:44,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-01-16 18:33:44,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-01-16 18:33:44,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-01-16 18:33:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 18:33:44,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 225 transitions. [2020-01-16 18:33:44,511 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 225 transitions. Word has length 19 [2020-01-16 18:33:44,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:44,511 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 225 transitions. [2020-01-16 18:33:44,511 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:44,511 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 225 transitions. [2020-01-16 18:33:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:44,511 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:44,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-01-16 18:33:44,512 INFO L426 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-01-16 18:33:44,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:44,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1155542588, now seen corresponding path program 601 times [2020-01-16 18:33:44,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:44,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453108278] [2020-01-16 18:33:44,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:44,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453108278] [2020-01-16 18:33:44,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:44,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:44,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115506386] [2020-01-16 18:33:44,695 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:44,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:44,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:44,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:44,696 INFO L87 Difference]: Start difference. First operand 88 states and 225 transitions. Second operand 8 states. [2020-01-16 18:33:44,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:44,774 INFO L93 Difference]: Finished difference Result 155 states and 325 transitions. [2020-01-16 18:33:44,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:44,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:44,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:44,775 INFO L225 Difference]: With dead ends: 155 [2020-01-16 18:33:44,775 INFO L226 Difference]: Without dead ends: 141 [2020-01-16 18:33:44,775 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-01-16 18:33:44,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 91. [2020-01-16 18:33:44,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-01-16 18:33:44,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 231 transitions. [2020-01-16 18:33:44,778 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 231 transitions. Word has length 19 [2020-01-16 18:33:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:44,778 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 231 transitions. [2020-01-16 18:33:44,778 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 231 transitions. [2020-01-16 18:33:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:44,778 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:44,778 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:44,778 INFO L426 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-01-16 18:33:44,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:44,779 INFO L82 PathProgramCache]: Analyzing trace with hash 281207262, now seen corresponding path program 602 times [2020-01-16 18:33:44,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:44,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678243051] [2020-01-16 18:33:44,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:44,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678243051] [2020-01-16 18:33:44,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:44,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:44,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248445506] [2020-01-16 18:33:44,975 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:44,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:44,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:44,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:44,976 INFO L87 Difference]: Start difference. First operand 91 states and 231 transitions. Second operand 8 states. [2020-01-16 18:33:45,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:45,057 INFO L93 Difference]: Finished difference Result 151 states and 314 transitions. [2020-01-16 18:33:45,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:45,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:45,058 INFO L225 Difference]: With dead ends: 151 [2020-01-16 18:33:45,058 INFO L226 Difference]: Without dead ends: 139 [2020-01-16 18:33:45,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-01-16 18:33:45,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-01-16 18:33:45,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-01-16 18:33:45,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 18:33:45,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 227 transitions. [2020-01-16 18:33:45,061 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 227 transitions. Word has length 19 [2020-01-16 18:33:45,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:45,061 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 227 transitions. [2020-01-16 18:33:45,061 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:45,061 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 227 transitions. [2020-01-16 18:33:45,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:45,062 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:45,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-01-16 18:33:45,062 INFO L426 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-01-16 18:33:45,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:45,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1978402594, now seen corresponding path program 603 times [2020-01-16 18:33:45,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:45,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041244438] [2020-01-16 18:33:45,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:45,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041244438] [2020-01-16 18:33:45,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:45,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:45,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529308486] [2020-01-16 18:33:45,253 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:45,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:45,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:45,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:45,253 INFO L87 Difference]: Start difference. First operand 89 states and 227 transitions. Second operand 8 states. [2020-01-16 18:33:45,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:45,334 INFO L93 Difference]: Finished difference Result 155 states and 324 transitions. [2020-01-16 18:33:45,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:45,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:45,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:45,335 INFO L225 Difference]: With dead ends: 155 [2020-01-16 18:33:45,335 INFO L226 Difference]: Without dead ends: 141 [2020-01-16 18:33:45,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-01-16 18:33:45,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-01-16 18:33:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 91. [2020-01-16 18:33:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-01-16 18:33:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 230 transitions. [2020-01-16 18:33:45,338 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 230 transitions. Word has length 19 [2020-01-16 18:33:45,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:45,338 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 230 transitions. [2020-01-16 18:33:45,338 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:45,338 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 230 transitions. [2020-01-16 18:33:45,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:45,339 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:45,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:45,339 INFO L426 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-01-16 18:33:45,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:45,339 INFO L82 PathProgramCache]: Analyzing trace with hash -858272764, now seen corresponding path program 604 times [2020-01-16 18:33:45,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:45,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014452562] [2020-01-16 18:33:45,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:45,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:45,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014452562] [2020-01-16 18:33:45,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:45,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:45,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981077081] [2020-01-16 18:33:45,541 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:45,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:45,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:45,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:45,542 INFO L87 Difference]: Start difference. First operand 91 states and 230 transitions. Second operand 8 states. [2020-01-16 18:33:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:45,604 INFO L93 Difference]: Finished difference Result 151 states and 313 transitions. [2020-01-16 18:33:45,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:45,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:45,604 INFO L225 Difference]: With dead ends: 151 [2020-01-16 18:33:45,605 INFO L226 Difference]: Without dead ends: 139 [2020-01-16 18:33:45,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-01-16 18:33:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-01-16 18:33:45,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-01-16 18:33:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 18:33:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 226 transitions. [2020-01-16 18:33:45,607 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 226 transitions. Word has length 19 [2020-01-16 18:33:45,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:45,607 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 226 transitions. [2020-01-16 18:33:45,607 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:45,607 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 226 transitions. [2020-01-16 18:33:45,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:45,608 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:45,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-01-16 18:33:45,608 INFO L426 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-01-16 18:33:45,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:45,608 INFO L82 PathProgramCache]: Analyzing trace with hash -80774848, now seen corresponding path program 605 times [2020-01-16 18:33:45,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:45,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383304515] [2020-01-16 18:33:45,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:45,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383304515] [2020-01-16 18:33:45,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:45,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:45,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299606561] [2020-01-16 18:33:45,810 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:45,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:45,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:45,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:45,810 INFO L87 Difference]: Start difference. First operand 89 states and 226 transitions. Second operand 8 states. [2020-01-16 18:33:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:45,888 INFO L93 Difference]: Finished difference Result 146 states and 302 transitions. [2020-01-16 18:33:45,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:45,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:45,889 INFO L225 Difference]: With dead ends: 146 [2020-01-16 18:33:45,889 INFO L226 Difference]: Without dead ends: 136 [2020-01-16 18:33:45,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-01-16 18:33:45,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-01-16 18:33:45,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 90. [2020-01-16 18:33:45,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 18:33:45,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 227 transitions. [2020-01-16 18:33:45,892 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 227 transitions. Word has length 19 [2020-01-16 18:33:45,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:45,892 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 227 transitions. [2020-01-16 18:33:45,892 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 227 transitions. [2020-01-16 18:33:45,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:45,892 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:45,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-01-16 18:33:45,892 INFO L426 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-01-16 18:33:45,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:45,893 INFO L82 PathProgramCache]: Analyzing trace with hash -320417186, now seen corresponding path program 606 times [2020-01-16 18:33:45,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:45,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525892873] [2020-01-16 18:33:45,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:46,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525892873] [2020-01-16 18:33:46,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:46,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:46,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100385178] [2020-01-16 18:33:46,096 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:46,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:46,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:46,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:46,097 INFO L87 Difference]: Start difference. First operand 90 states and 227 transitions. Second operand 8 states. [2020-01-16 18:33:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:46,158 INFO L93 Difference]: Finished difference Result 146 states and 301 transitions. [2020-01-16 18:33:46,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:46,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:46,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:46,159 INFO L225 Difference]: With dead ends: 146 [2020-01-16 18:33:46,159 INFO L226 Difference]: Without dead ends: 134 [2020-01-16 18:33:46,159 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:46,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-01-16 18:33:46,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 88. [2020-01-16 18:33:46,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 18:33:46,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 224 transitions. [2020-01-16 18:33:46,162 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 224 transitions. Word has length 19 [2020-01-16 18:33:46,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:46,162 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 224 transitions. [2020-01-16 18:33:46,162 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:46,162 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 224 transitions. [2020-01-16 18:33:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:46,163 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:46,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-01-16 18:33:46,163 INFO L426 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-01-16 18:33:46,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:46,163 INFO L82 PathProgramCache]: Analyzing trace with hash -455398370, now seen corresponding path program 607 times [2020-01-16 18:33:46,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:46,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781012959] [2020-01-16 18:33:46,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:46,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781012959] [2020-01-16 18:33:46,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:46,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:46,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87064582] [2020-01-16 18:33:46,338 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:46,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:46,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:46,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:46,339 INFO L87 Difference]: Start difference. First operand 88 states and 224 transitions. Second operand 8 states. [2020-01-16 18:33:46,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:46,415 INFO L93 Difference]: Finished difference Result 161 states and 343 transitions. [2020-01-16 18:33:46,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:46,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:46,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:46,416 INFO L225 Difference]: With dead ends: 161 [2020-01-16 18:33:46,416 INFO L226 Difference]: Without dead ends: 147 [2020-01-16 18:33:46,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:46,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-01-16 18:33:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 92. [2020-01-16 18:33:46,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-01-16 18:33:46,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 234 transitions. [2020-01-16 18:33:46,419 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 234 transitions. Word has length 19 [2020-01-16 18:33:46,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:46,419 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 234 transitions. [2020-01-16 18:33:46,419 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 234 transitions. [2020-01-16 18:33:46,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:46,420 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:46,420 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:46,420 INFO L426 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-01-16 18:33:46,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:46,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1329733696, now seen corresponding path program 608 times [2020-01-16 18:33:46,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:46,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344747887] [2020-01-16 18:33:46,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:46,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-01-16 18:33:46,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344747887] [2020-01-16 18:33:46,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:46,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:46,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158552813] [2020-01-16 18:33:46,600 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:46,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:46,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:46,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:46,600 INFO L87 Difference]: Start difference. First operand 92 states and 234 transitions. Second operand 8 states. [2020-01-16 18:33:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:46,680 INFO L93 Difference]: Finished difference Result 157 states and 332 transitions. [2020-01-16 18:33:46,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:46,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:46,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:46,680 INFO L225 Difference]: With dead ends: 157 [2020-01-16 18:33:46,681 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 18:33:46,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:46,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 18:33:46,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-01-16 18:33:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 18:33:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 229 transitions. [2020-01-16 18:33:46,683 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 229 transitions. Word has length 19 [2020-01-16 18:33:46,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:46,683 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 229 transitions. [2020-01-16 18:33:46,683 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 229 transitions. [2020-01-16 18:33:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:46,684 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:46,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-01-16 18:33:46,684 INFO L426 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-01-16 18:33:46,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:46,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1034006626, now seen corresponding path program 609 times [2020-01-16 18:33:46,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:46,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149423943] [2020-01-16 18:33:46,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:46,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149423943] [2020-01-16 18:33:46,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:46,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:46,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269750231] [2020-01-16 18:33:46,859 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:46,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:46,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:46,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:46,860 INFO L87 Difference]: Start difference. First operand 90 states and 229 transitions. Second operand 8 states. [2020-01-16 18:33:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:46,938 INFO L93 Difference]: Finished difference Result 165 states and 353 transitions. [2020-01-16 18:33:46,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:46,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:46,939 INFO L225 Difference]: With dead ends: 165 [2020-01-16 18:33:46,939 INFO L226 Difference]: Without dead ends: 151 [2020-01-16 18:33:46,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-01-16 18:33:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-01-16 18:33:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 94. [2020-01-16 18:33:46,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-01-16 18:33:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 237 transitions. [2020-01-16 18:33:46,942 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 237 transitions. Word has length 19 [2020-01-16 18:33:46,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:46,942 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 237 transitions. [2020-01-16 18:33:46,942 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 237 transitions. [2020-01-16 18:33:46,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:46,946 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:46,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-01-16 18:33:46,946 INFO L426 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-01-16 18:33:46,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:46,946 INFO L82 PathProgramCache]: Analyzing trace with hash 288709482, now seen corresponding path program 610 times [2020-01-16 18:33:46,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:46,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108579054] [2020-01-16 18:33:46,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:47,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-01-16 18:33:47,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108579054] [2020-01-16 18:33:47,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:47,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:47,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797045557] [2020-01-16 18:33:47,117 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:47,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:47,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:47,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:47,117 INFO L87 Difference]: Start difference. First operand 94 states and 237 transitions. Second operand 8 states. [2020-01-16 18:33:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:47,200 INFO L93 Difference]: Finished difference Result 163 states and 345 transitions. [2020-01-16 18:33:47,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:47,200 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:47,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:47,201 INFO L225 Difference]: With dead ends: 163 [2020-01-16 18:33:47,201 INFO L226 Difference]: Without dead ends: 147 [2020-01-16 18:33:47,201 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:47,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-01-16 18:33:47,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 90. [2020-01-16 18:33:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 18:33:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 227 transitions. [2020-01-16 18:33:47,204 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 227 transitions. Word has length 19 [2020-01-16 18:33:47,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:47,204 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 227 transitions. [2020-01-16 18:33:47,204 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:47,204 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 227 transitions. [2020-01-16 18:33:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:47,205 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:47,205 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:47,205 INFO L426 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-01-16 18:33:47,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:47,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1901188502, now seen corresponding path program 611 times [2020-01-16 18:33:47,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:47,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959100384] [2020-01-16 18:33:47,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:47,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959100384] [2020-01-16 18:33:47,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:47,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:47,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391298447] [2020-01-16 18:33:47,381 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:47,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:47,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:47,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:47,381 INFO L87 Difference]: Start difference. First operand 90 states and 227 transitions. Second operand 8 states. [2020-01-16 18:33:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:47,461 INFO L93 Difference]: Finished difference Result 155 states and 326 transitions. [2020-01-16 18:33:47,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:47,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:47,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:47,462 INFO L225 Difference]: With dead ends: 155 [2020-01-16 18:33:47,462 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 18:33:47,462 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:47,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 18:33:47,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 92. [2020-01-16 18:33:47,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-01-16 18:33:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 230 transitions. [2020-01-16 18:33:47,464 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 230 transitions. Word has length 19 [2020-01-16 18:33:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:47,465 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 230 transitions. [2020-01-16 18:33:47,465 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 230 transitions. [2020-01-16 18:33:47,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:47,465 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:47,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-01-16 18:33:47,465 INFO L426 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-01-16 18:33:47,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:47,465 INFO L82 PathProgramCache]: Analyzing trace with hash -190575194, now seen corresponding path program 612 times [2020-01-16 18:33:47,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:47,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925769135] [2020-01-16 18:33:47,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:47,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925769135] [2020-01-16 18:33:47,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:47,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:47,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608724291] [2020-01-16 18:33:47,647 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:47,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:47,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:47,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:47,648 INFO L87 Difference]: Start difference. First operand 92 states and 230 transitions. Second operand 8 states. [2020-01-16 18:33:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:47,732 INFO L93 Difference]: Finished difference Result 157 states and 329 transitions. [2020-01-16 18:33:47,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:47,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:47,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:47,733 INFO L225 Difference]: With dead ends: 157 [2020-01-16 18:33:47,733 INFO L226 Difference]: Without dead ends: 141 [2020-01-16 18:33:47,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:47,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-01-16 18:33:47,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 88. [2020-01-16 18:33:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 18:33:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 223 transitions. [2020-01-16 18:33:47,736 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 223 transitions. Word has length 19 [2020-01-16 18:33:47,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:47,737 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 223 transitions. [2020-01-16 18:33:47,737 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 223 transitions. [2020-01-16 18:33:47,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:47,737 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:47,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:47,737 INFO L426 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-01-16 18:33:47,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:47,738 INFO L82 PathProgramCache]: Analyzing trace with hash -884311006, now seen corresponding path program 613 times [2020-01-16 18:33:47,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:47,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219743802] [2020-01-16 18:33:47,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:47,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219743802] [2020-01-16 18:33:47,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:47,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:47,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103356738] [2020-01-16 18:33:47,913 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:47,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:47,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:47,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:47,913 INFO L87 Difference]: Start difference. First operand 88 states and 223 transitions. Second operand 8 states. [2020-01-16 18:33:47,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:47,989 INFO L93 Difference]: Finished difference Result 161 states and 342 transitions. [2020-01-16 18:33:47,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:47,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:47,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:47,990 INFO L225 Difference]: With dead ends: 161 [2020-01-16 18:33:47,990 INFO L226 Difference]: Without dead ends: 147 [2020-01-16 18:33:47,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-01-16 18:33:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-01-16 18:33:47,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 92. [2020-01-16 18:33:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-01-16 18:33:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 233 transitions. [2020-01-16 18:33:47,993 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 233 transitions. Word has length 19 [2020-01-16 18:33:47,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:47,994 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 233 transitions. [2020-01-16 18:33:47,994 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:47,994 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 233 transitions. [2020-01-16 18:33:47,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:47,994 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:47,994 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:47,994 INFO L426 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-01-16 18:33:47,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:47,994 INFO L82 PathProgramCache]: Analyzing trace with hash 235818824, now seen corresponding path program 614 times [2020-01-16 18:33:47,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:47,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649403314] [2020-01-16 18:33:47,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:48,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:48,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649403314] [2020-01-16 18:33:48,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:48,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:48,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655263044] [2020-01-16 18:33:48,178 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:48,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:48,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:48,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:48,178 INFO L87 Difference]: Start difference. First operand 92 states and 233 transitions. Second operand 8 states. [2020-01-16 18:33:48,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:48,243 INFO L93 Difference]: Finished difference Result 157 states and 331 transitions. [2020-01-16 18:33:48,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:48,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:48,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:48,244 INFO L225 Difference]: With dead ends: 157 [2020-01-16 18:33:48,245 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 18:33:48,245 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-01-16 18:33:48,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 18:33:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-01-16 18:33:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 18:33:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 228 transitions. [2020-01-16 18:33:48,247 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 228 transitions. Word has length 19 [2020-01-16 18:33:48,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:48,248 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 228 transitions. [2020-01-16 18:33:48,248 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:48,248 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 228 transitions. [2020-01-16 18:33:48,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:48,248 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:48,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-01-16 18:33:48,248 INFO L426 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-01-16 18:33:48,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:48,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1629013504, now seen corresponding path program 615 times [2020-01-16 18:33:48,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:48,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100285055] [2020-01-16 18:33:48,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:48,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:48,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100285055] [2020-01-16 18:33:48,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:48,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:48,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706341863] [2020-01-16 18:33:48,427 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:48,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:48,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:48,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:48,428 INFO L87 Difference]: Start difference. First operand 90 states and 228 transitions. Second operand 8 states. [2020-01-16 18:33:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:48,497 INFO L93 Difference]: Finished difference Result 165 states and 352 transitions. [2020-01-16 18:33:48,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:48,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:48,498 INFO L225 Difference]: With dead ends: 165 [2020-01-16 18:33:48,498 INFO L226 Difference]: Without dead ends: 151 [2020-01-16 18:33:48,498 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:48,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-01-16 18:33:48,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 94. [2020-01-16 18:33:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-01-16 18:33:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 236 transitions. [2020-01-16 18:33:48,504 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 236 transitions. Word has length 19 [2020-01-16 18:33:48,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:48,504 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 236 transitions. [2020-01-16 18:33:48,504 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 236 transitions. [2020-01-16 18:33:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:48,504 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:48,505 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:48,505 INFO L426 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-01-16 18:33:48,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1920656648, now seen corresponding path program 616 times [2020-01-16 18:33:48,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:48,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036832277] [2020-01-16 18:33:48,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:48,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:48,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036832277] [2020-01-16 18:33:48,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:48,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:48,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679702202] [2020-01-16 18:33:48,682 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:48,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:48,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:48,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:48,682 INFO L87 Difference]: Start difference. First operand 94 states and 236 transitions. Second operand 8 states. [2020-01-16 18:33:48,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:48,762 INFO L93 Difference]: Finished difference Result 163 states and 344 transitions. [2020-01-16 18:33:48,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:48,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:48,763 INFO L225 Difference]: With dead ends: 163 [2020-01-16 18:33:48,763 INFO L226 Difference]: Without dead ends: 147 [2020-01-16 18:33:48,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:48,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-01-16 18:33:48,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 90. [2020-01-16 18:33:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 18:33:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 226 transitions. [2020-01-16 18:33:48,766 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 226 transitions. Word has length 19 [2020-01-16 18:33:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:48,766 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 226 transitions. [2020-01-16 18:33:48,766 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 226 transitions. [2020-01-16 18:33:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:48,767 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:48,767 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:48,767 INFO L426 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-01-16 18:33:48,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:48,767 INFO L82 PathProgramCache]: Analyzing trace with hash -299410978, now seen corresponding path program 617 times [2020-01-16 18:33:48,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:48,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681615263] [2020-01-16 18:33:48,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:48,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681615263] [2020-01-16 18:33:48,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:48,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:48,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024651210] [2020-01-16 18:33:48,954 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:48,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:48,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:48,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:48,955 INFO L87 Difference]: Start difference. First operand 90 states and 226 transitions. Second operand 8 states. [2020-01-16 18:33:49,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:49,015 INFO L93 Difference]: Finished difference Result 155 states and 325 transitions. [2020-01-16 18:33:49,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:49,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:49,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:49,016 INFO L225 Difference]: With dead ends: 155 [2020-01-16 18:33:49,016 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 18:33:49,016 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-01-16 18:33:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 18:33:49,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 92. [2020-01-16 18:33:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-01-16 18:33:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 229 transitions. [2020-01-16 18:33:49,019 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 229 transitions. Word has length 19 [2020-01-16 18:33:49,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:49,019 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 229 transitions. [2020-01-16 18:33:49,019 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 229 transitions. [2020-01-16 18:33:49,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:49,020 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:49,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-01-16 18:33:49,020 INFO L426 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-01-16 18:33:49,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:49,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1154717632, now seen corresponding path program 618 times [2020-01-16 18:33:49,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:49,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687233514] [2020-01-16 18:33:49,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:49,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687233514] [2020-01-16 18:33:49,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:49,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:49,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512671947] [2020-01-16 18:33:49,199 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:49,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:49,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:49,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:49,199 INFO L87 Difference]: Start difference. First operand 92 states and 229 transitions. Second operand 8 states. [2020-01-16 18:33:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:49,281 INFO L93 Difference]: Finished difference Result 157 states and 328 transitions. [2020-01-16 18:33:49,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:49,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:49,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:49,282 INFO L225 Difference]: With dead ends: 157 [2020-01-16 18:33:49,282 INFO L226 Difference]: Without dead ends: 141 [2020-01-16 18:33:49,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-01-16 18:33:49,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-01-16 18:33:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 88. [2020-01-16 18:33:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 18:33:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 222 transitions. [2020-01-16 18:33:49,285 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 222 transitions. Word has length 19 [2020-01-16 18:33:49,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:49,285 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 222 transitions. [2020-01-16 18:33:49,285 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:49,286 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 222 transitions. [2020-01-16 18:33:49,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:49,286 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:49,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:49,286 INFO L426 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-01-16 18:33:49,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:49,286 INFO L82 PathProgramCache]: Analyzing trace with hash 506970474, now seen corresponding path program 619 times [2020-01-16 18:33:49,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:49,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072427070] [2020-01-16 18:33:49,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:49,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072427070] [2020-01-16 18:33:49,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:49,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:49,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266728717] [2020-01-16 18:33:49,490 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:49,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:49,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:49,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:49,491 INFO L87 Difference]: Start difference. First operand 88 states and 222 transitions. Second operand 8 states. [2020-01-16 18:33:49,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:49,560 INFO L93 Difference]: Finished difference Result 144 states and 297 transitions. [2020-01-16 18:33:49,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:49,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:49,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:49,561 INFO L225 Difference]: With dead ends: 144 [2020-01-16 18:33:49,561 INFO L226 Difference]: Without dead ends: 134 [2020-01-16 18:33:49,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:49,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-01-16 18:33:49,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 90. [2020-01-16 18:33:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 18:33:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 226 transitions. [2020-01-16 18:33:49,563 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 226 transitions. Word has length 19 [2020-01-16 18:33:49,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:49,563 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 226 transitions. [2020-01-16 18:33:49,564 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 226 transitions. [2020-01-16 18:33:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:49,564 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:49,564 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:49,564 INFO L426 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-01-16 18:33:49,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:49,564 INFO L82 PathProgramCache]: Analyzing trace with hash 267328136, now seen corresponding path program 620 times [2020-01-16 18:33:49,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:49,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570217910] [2020-01-16 18:33:49,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:49,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570217910] [2020-01-16 18:33:49,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:49,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:49,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60631069] [2020-01-16 18:33:49,777 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:49,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:49,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:49,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:49,778 INFO L87 Difference]: Start difference. First operand 90 states and 226 transitions. Second operand 8 states. [2020-01-16 18:33:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:49,835 INFO L93 Difference]: Finished difference Result 144 states and 296 transitions. [2020-01-16 18:33:49,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:49,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:49,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:49,836 INFO L225 Difference]: With dead ends: 144 [2020-01-16 18:33:49,836 INFO L226 Difference]: Without dead ends: 133 [2020-01-16 18:33:49,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-01-16 18:33:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 89. [2020-01-16 18:33:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 18:33:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 224 transitions. [2020-01-16 18:33:49,838 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 224 transitions. Word has length 19 [2020-01-16 18:33:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:49,838 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 224 transitions. [2020-01-16 18:33:49,838 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 224 transitions. [2020-01-16 18:33:49,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:49,839 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:49,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-01-16 18:33:49,839 INFO L426 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-01-16 18:33:49,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:49,839 INFO L82 PathProgramCache]: Analyzing trace with hash -237732024, now seen corresponding path program 621 times [2020-01-16 18:33:49,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:49,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137013984] [2020-01-16 18:33:49,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:50,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137013984] [2020-01-16 18:33:50,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:50,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:50,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60854581] [2020-01-16 18:33:50,036 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:50,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:50,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:50,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:50,037 INFO L87 Difference]: Start difference. First operand 89 states and 224 transitions. Second operand 8 states. [2020-01-16 18:33:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:50,111 INFO L93 Difference]: Finished difference Result 147 states and 304 transitions. [2020-01-16 18:33:50,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:50,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:50,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:50,112 INFO L225 Difference]: With dead ends: 147 [2020-01-16 18:33:50,112 INFO L226 Difference]: Without dead ends: 137 [2020-01-16 18:33:50,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:50,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-01-16 18:33:50,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 91. [2020-01-16 18:33:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-01-16 18:33:50,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 227 transitions. [2020-01-16 18:33:50,115 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 227 transitions. Word has length 19 [2020-01-16 18:33:50,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:50,115 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 227 transitions. [2020-01-16 18:33:50,115 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:50,115 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 227 transitions. [2020-01-16 18:33:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:50,115 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:50,116 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:50,116 INFO L426 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-01-16 18:33:50,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:50,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1472881284, now seen corresponding path program 622 times [2020-01-16 18:33:50,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:50,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876779359] [2020-01-16 18:33:50,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:50,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:50,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876779359] [2020-01-16 18:33:50,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:50,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:50,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190790927] [2020-01-16 18:33:50,314 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:50,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:50,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:50,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:50,314 INFO L87 Difference]: Start difference. First operand 91 states and 227 transitions. Second operand 8 states. [2020-01-16 18:33:50,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:50,392 INFO L93 Difference]: Finished difference Result 149 states and 307 transitions. [2020-01-16 18:33:50,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:50,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:50,393 INFO L225 Difference]: With dead ends: 149 [2020-01-16 18:33:50,393 INFO L226 Difference]: Without dead ends: 135 [2020-01-16 18:33:50,393 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:50,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-01-16 18:33:50,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 89. [2020-01-16 18:33:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 18:33:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 223 transitions. [2020-01-16 18:33:50,396 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 223 transitions. Word has length 19 [2020-01-16 18:33:50,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:50,396 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 223 transitions. [2020-01-16 18:33:50,396 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:50,396 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 223 transitions. [2020-01-16 18:33:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:50,397 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:50,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-01-16 18:33:50,397 INFO L426 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-01-16 18:33:50,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:50,397 INFO L82 PathProgramCache]: Analyzing trace with hash -805757244, now seen corresponding path program 623 times [2020-01-16 18:33:50,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:50,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252924111] [2020-01-16 18:33:50,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:50,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-01-16 18:33:50,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252924111] [2020-01-16 18:33:50,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:50,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:50,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015735782] [2020-01-16 18:33:50,597 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:50,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:50,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:50,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:50,597 INFO L87 Difference]: Start difference. First operand 89 states and 223 transitions. Second operand 8 states. [2020-01-16 18:33:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:50,654 INFO L93 Difference]: Finished difference Result 147 states and 303 transitions. [2020-01-16 18:33:50,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:50,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:50,655 INFO L225 Difference]: With dead ends: 147 [2020-01-16 18:33:50,655 INFO L226 Difference]: Without dead ends: 137 [2020-01-16 18:33:50,655 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:50,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-01-16 18:33:50,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 91. [2020-01-16 18:33:50,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-01-16 18:33:50,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 226 transitions. [2020-01-16 18:33:50,658 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 226 transitions. Word has length 19 [2020-01-16 18:33:50,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:50,658 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 226 transitions. [2020-01-16 18:33:50,658 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 226 transitions. [2020-01-16 18:33:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:50,658 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:50,658 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:50,659 INFO L426 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-01-16 18:33:50,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:50,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1661063898, now seen corresponding path program 624 times [2020-01-16 18:33:50,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:50,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227228833] [2020-01-16 18:33:50,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:50,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227228833] [2020-01-16 18:33:50,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:50,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:50,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357758104] [2020-01-16 18:33:50,857 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:50,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:50,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:50,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:50,857 INFO L87 Difference]: Start difference. First operand 91 states and 226 transitions. Second operand 8 states. [2020-01-16 18:33:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:50,932 INFO L93 Difference]: Finished difference Result 149 states and 306 transitions. [2020-01-16 18:33:50,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:50,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:50,933 INFO L225 Difference]: With dead ends: 149 [2020-01-16 18:33:50,933 INFO L226 Difference]: Without dead ends: 133 [2020-01-16 18:33:50,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-01-16 18:33:50,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-01-16 18:33:50,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 87. [2020-01-16 18:33:50,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 18:33:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 220 transitions. [2020-01-16 18:33:50,936 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 220 transitions. Word has length 19 [2020-01-16 18:33:50,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:50,936 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 220 transitions. [2020-01-16 18:33:50,936 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:50,936 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 220 transitions. [2020-01-16 18:33:50,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:50,936 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:50,937 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:50,937 INFO L426 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-01-16 18:33:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:50,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1213390630, now seen corresponding path program 625 times [2020-01-16 18:33:50,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:50,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695249237] [2020-01-16 18:33:50,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:51,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695249237] [2020-01-16 18:33:51,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:51,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:51,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920014556] [2020-01-16 18:33:51,118 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:51,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:51,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:51,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:51,119 INFO L87 Difference]: Start difference. First operand 87 states and 220 transitions. Second operand 8 states. [2020-01-16 18:33:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:51,196 INFO L93 Difference]: Finished difference Result 153 states and 317 transitions. [2020-01-16 18:33:51,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:51,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:51,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:51,197 INFO L225 Difference]: With dead ends: 153 [2020-01-16 18:33:51,197 INFO L226 Difference]: Without dead ends: 139 [2020-01-16 18:33:51,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-01-16 18:33:51,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-01-16 18:33:51,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-01-16 18:33:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 18:33:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 223 transitions. [2020-01-16 18:33:51,200 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 223 transitions. Word has length 19 [2020-01-16 18:33:51,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:51,200 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 223 transitions. [2020-01-16 18:33:51,200 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 223 transitions. [2020-01-16 18:33:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:51,201 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:51,201 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:51,201 INFO L426 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-01-16 18:33:51,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:51,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2087725956, now seen corresponding path program 626 times [2020-01-16 18:33:51,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:51,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045446187] [2020-01-16 18:33:51,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:51,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045446187] [2020-01-16 18:33:51,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:51,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:51,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836855745] [2020-01-16 18:33:51,380 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:51,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:51,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:51,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:51,380 INFO L87 Difference]: Start difference. First operand 89 states and 223 transitions. Second operand 8 states. [2020-01-16 18:33:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:51,459 INFO L93 Difference]: Finished difference Result 149 states and 306 transitions. [2020-01-16 18:33:51,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:51,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:51,460 INFO L225 Difference]: With dead ends: 149 [2020-01-16 18:33:51,460 INFO L226 Difference]: Without dead ends: 137 [2020-01-16 18:33:51,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-01-16 18:33:51,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-01-16 18:33:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 87. [2020-01-16 18:33:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 18:33:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 219 transitions. [2020-01-16 18:33:51,463 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 219 transitions. Word has length 19 [2020-01-16 18:33:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:51,463 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 219 transitions. [2020-01-16 18:33:51,463 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 219 transitions. [2020-01-16 18:33:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:51,464 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:51,464 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:51,464 INFO L426 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-01-16 18:33:51,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:51,465 INFO L82 PathProgramCache]: Analyzing trace with hash -52368516, now seen corresponding path program 627 times [2020-01-16 18:33:51,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:51,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416012351] [2020-01-16 18:33:51,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:51,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416012351] [2020-01-16 18:33:51,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:51,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:51,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815115713] [2020-01-16 18:33:51,654 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:51,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:51,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:51,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:51,655 INFO L87 Difference]: Start difference. First operand 87 states and 219 transitions. Second operand 8 states. [2020-01-16 18:33:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:51,727 INFO L93 Difference]: Finished difference Result 153 states and 316 transitions. [2020-01-16 18:33:51,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:51,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:51,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:51,728 INFO L225 Difference]: With dead ends: 153 [2020-01-16 18:33:51,728 INFO L226 Difference]: Without dead ends: 139 [2020-01-16 18:33:51,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-01-16 18:33:51,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-01-16 18:33:51,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 18:33:51,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 222 transitions. [2020-01-16 18:33:51,731 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 222 transitions. Word has length 19 [2020-01-16 18:33:51,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:51,731 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 222 transitions. [2020-01-16 18:33:51,731 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 222 transitions. [2020-01-16 18:33:51,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:51,732 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:51,732 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:51,732 INFO L426 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-01-16 18:33:51,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:51,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1067761314, now seen corresponding path program 628 times [2020-01-16 18:33:51,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:51,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116614972] [2020-01-16 18:33:51,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:51,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116614972] [2020-01-16 18:33:51,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:51,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:51,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884403276] [2020-01-16 18:33:51,918 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:51,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:51,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:51,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:51,918 INFO L87 Difference]: Start difference. First operand 89 states and 222 transitions. Second operand 8 states. [2020-01-16 18:33:51,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:51,979 INFO L93 Difference]: Finished difference Result 149 states and 305 transitions. [2020-01-16 18:33:51,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:51,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:51,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:51,980 INFO L225 Difference]: With dead ends: 149 [2020-01-16 18:33:51,980 INFO L226 Difference]: Without dead ends: 137 [2020-01-16 18:33:51,980 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-01-16 18:33:51,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-01-16 18:33:51,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 87. [2020-01-16 18:33:51,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 18:33:51,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 218 transitions. [2020-01-16 18:33:51,983 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 218 transitions. Word has length 19 [2020-01-16 18:33:51,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:51,983 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 218 transitions. [2020-01-16 18:33:51,983 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 218 transitions. [2020-01-16 18:33:51,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:51,984 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:51,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-01-16 18:33:51,984 INFO L426 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-01-16 18:33:51,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:51,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1845259230, now seen corresponding path program 629 times [2020-01-16 18:33:51,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:51,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644187184] [2020-01-16 18:33:51,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:52,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644187184] [2020-01-16 18:33:52,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:52,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:52,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821153896] [2020-01-16 18:33:52,183 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:52,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:52,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:52,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:52,183 INFO L87 Difference]: Start difference. First operand 87 states and 218 transitions. Second operand 8 states. [2020-01-16 18:33:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:52,260 INFO L93 Difference]: Finished difference Result 144 states and 294 transitions. [2020-01-16 18:33:52,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:52,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:52,261 INFO L225 Difference]: With dead ends: 144 [2020-01-16 18:33:52,261 INFO L226 Difference]: Without dead ends: 134 [2020-01-16 18:33:52,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-01-16 18:33:52,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-01-16 18:33:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 88. [2020-01-16 18:33:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 18:33:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 219 transitions. [2020-01-16 18:33:52,264 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 219 transitions. Word has length 19 [2020-01-16 18:33:52,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:52,264 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 219 transitions. [2020-01-16 18:33:52,265 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 219 transitions. [2020-01-16 18:33:52,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:52,265 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:52,265 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:52,265 INFO L426 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-01-16 18:33:52,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:52,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1605616892, now seen corresponding path program 630 times [2020-01-16 18:33:52,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:52,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416319838] [2020-01-16 18:33:52,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:52,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:52,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416319838] [2020-01-16 18:33:52,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:52,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:52,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695126041] [2020-01-16 18:33:52,468 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:52,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:52,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:52,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:52,468 INFO L87 Difference]: Start difference. First operand 88 states and 219 transitions. Second operand 8 states. [2020-01-16 18:33:52,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:52,528 INFO L93 Difference]: Finished difference Result 144 states and 293 transitions. [2020-01-16 18:33:52,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:52,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:52,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:52,529 INFO L225 Difference]: With dead ends: 144 [2020-01-16 18:33:52,529 INFO L226 Difference]: Without dead ends: 132 [2020-01-16 18:33:52,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:52,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-01-16 18:33:52,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 86. [2020-01-16 18:33:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-01-16 18:33:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 216 transitions. [2020-01-16 18:33:52,532 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 216 transitions. Word has length 19 [2020-01-16 18:33:52,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:52,532 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 216 transitions. [2020-01-16 18:33:52,532 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:52,532 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 216 transitions. [2020-01-16 18:33:52,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:52,532 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:52,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-01-16 18:33:52,533 INFO L426 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-01-16 18:33:52,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:52,533 INFO L82 PathProgramCache]: Analyzing trace with hash -119299042, now seen corresponding path program 631 times [2020-01-16 18:33:52,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:52,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786031887] [2020-01-16 18:33:52,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:52,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786031887] [2020-01-16 18:33:52,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:52,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:52,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657538352] [2020-01-16 18:33:52,705 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:52,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:52,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:52,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:52,706 INFO L87 Difference]: Start difference. First operand 86 states and 216 transitions. Second operand 8 states. [2020-01-16 18:33:52,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:52,785 INFO L93 Difference]: Finished difference Result 159 states and 335 transitions. [2020-01-16 18:33:52,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:52,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:52,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:52,786 INFO L225 Difference]: With dead ends: 159 [2020-01-16 18:33:52,786 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 18:33:52,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-01-16 18:33:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 18:33:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-01-16 18:33:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 18:33:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 226 transitions. [2020-01-16 18:33:52,789 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 226 transitions. Word has length 19 [2020-01-16 18:33:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:52,789 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 226 transitions. [2020-01-16 18:33:52,789 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 226 transitions. [2020-01-16 18:33:52,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:52,789 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:52,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-01-16 18:33:52,790 INFO L426 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-01-16 18:33:52,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:52,790 INFO L82 PathProgramCache]: Analyzing trace with hash -993634368, now seen corresponding path program 632 times [2020-01-16 18:33:52,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:52,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814419608] [2020-01-16 18:33:52,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:52,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814419608] [2020-01-16 18:33:52,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:52,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:52,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046272324] [2020-01-16 18:33:52,961 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:52,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:52,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:52,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:52,962 INFO L87 Difference]: Start difference. First operand 90 states and 226 transitions. Second operand 8 states. [2020-01-16 18:33:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:53,036 INFO L93 Difference]: Finished difference Result 155 states and 324 transitions. [2020-01-16 18:33:53,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:53,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:53,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:53,037 INFO L225 Difference]: With dead ends: 155 [2020-01-16 18:33:53,037 INFO L226 Difference]: Without dead ends: 143 [2020-01-16 18:33:53,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-01-16 18:33:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 88. [2020-01-16 18:33:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 18:33:53,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 221 transitions. [2020-01-16 18:33:53,040 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 221 transitions. Word has length 19 [2020-01-16 18:33:53,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:53,040 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 221 transitions. [2020-01-16 18:33:53,040 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:53,040 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 221 transitions. [2020-01-16 18:33:53,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:53,040 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:53,040 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:53,040 INFO L426 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-01-16 18:33:53,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:53,041 INFO L82 PathProgramCache]: Analyzing trace with hash -579720990, now seen corresponding path program 633 times [2020-01-16 18:33:53,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:53,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557503715] [2020-01-16 18:33:53,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:53,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557503715] [2020-01-16 18:33:53,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:53,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:53,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596632210] [2020-01-16 18:33:53,219 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:53,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:53,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:53,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:53,219 INFO L87 Difference]: Start difference. First operand 88 states and 221 transitions. Second operand 8 states. [2020-01-16 18:33:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:53,301 INFO L93 Difference]: Finished difference Result 159 states and 338 transitions. [2020-01-16 18:33:53,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:53,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:53,302 INFO L225 Difference]: With dead ends: 159 [2020-01-16 18:33:53,302 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 18:33:53,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-01-16 18:33:53,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 18:33:53,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2020-01-16 18:33:53,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 18:33:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 231 transitions. [2020-01-16 18:33:53,305 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 231 transitions. Word has length 19 [2020-01-16 18:33:53,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:53,305 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 231 transitions. [2020-01-16 18:33:53,305 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 231 transitions. [2020-01-16 18:33:53,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:53,305 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:53,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-01-16 18:33:53,306 INFO L426 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-01-16 18:33:53,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:53,306 INFO L82 PathProgramCache]: Analyzing trace with hash 389163050, now seen corresponding path program 634 times [2020-01-16 18:33:53,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:53,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169044362] [2020-01-16 18:33:53,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:53,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169044362] [2020-01-16 18:33:53,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:53,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:53,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960810628] [2020-01-16 18:33:53,488 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:53,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:53,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:53,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:53,488 INFO L87 Difference]: Start difference. First operand 93 states and 231 transitions. Second operand 8 states. [2020-01-16 18:33:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:53,573 INFO L93 Difference]: Finished difference Result 149 states and 322 transitions. [2020-01-16 18:33:53,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:53,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:53,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:53,574 INFO L225 Difference]: With dead ends: 149 [2020-01-16 18:33:53,575 INFO L226 Difference]: Without dead ends: 131 [2020-01-16 18:33:53,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-01-16 18:33:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-01-16 18:33:53,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2020-01-16 18:33:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 18:33:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 219 transitions. [2020-01-16 18:33:53,577 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 219 transitions. Word has length 19 [2020-01-16 18:33:53,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:53,577 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 219 transitions. [2020-01-16 18:33:53,577 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:53,577 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 219 transitions. [2020-01-16 18:33:53,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:53,578 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:53,578 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:53,578 INFO L426 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-01-16 18:33:53,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:53,578 INFO L82 PathProgramCache]: Analyzing trace with hash 780051178, now seen corresponding path program 635 times [2020-01-16 18:33:53,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:53,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930991553] [2020-01-16 18:33:53,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:53,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930991553] [2020-01-16 18:33:53,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:53,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:53,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726117138] [2020-01-16 18:33:53,766 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:53,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:53,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:53,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:53,767 INFO L87 Difference]: Start difference. First operand 88 states and 219 transitions. Second operand 8 states. [2020-01-16 18:33:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:53,849 INFO L93 Difference]: Finished difference Result 152 states and 317 transitions. [2020-01-16 18:33:53,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:53,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:53,850 INFO L225 Difference]: With dead ends: 152 [2020-01-16 18:33:53,850 INFO L226 Difference]: Without dead ends: 142 [2020-01-16 18:33:53,850 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:53,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-01-16 18:33:53,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 90. [2020-01-16 18:33:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 18:33:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 222 transitions. [2020-01-16 18:33:53,853 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 222 transitions. Word has length 19 [2020-01-16 18:33:53,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:53,853 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 222 transitions. [2020-01-16 18:33:53,854 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 222 transitions. [2020-01-16 18:33:53,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:53,854 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:53,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-01-16 18:33:53,854 INFO L426 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-01-16 18:33:53,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:53,855 INFO L82 PathProgramCache]: Analyzing trace with hash -948996156, now seen corresponding path program 636 times [2020-01-16 18:33:53,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:53,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702317838] [2020-01-16 18:33:53,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:54,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:54,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702317838] [2020-01-16 18:33:54,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:54,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:54,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405943748] [2020-01-16 18:33:54,035 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:54,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:54,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:54,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:54,035 INFO L87 Difference]: Start difference. First operand 90 states and 222 transitions. Second operand 8 states. [2020-01-16 18:33:54,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:54,121 INFO L93 Difference]: Finished difference Result 146 states and 313 transitions. [2020-01-16 18:33:54,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:54,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:54,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:54,122 INFO L225 Difference]: With dead ends: 146 [2020-01-16 18:33:54,122 INFO L226 Difference]: Without dead ends: 129 [2020-01-16 18:33:54,122 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-01-16 18:33:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 86. [2020-01-16 18:33:54,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-01-16 18:33:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 215 transitions. [2020-01-16 18:33:54,125 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 215 transitions. Word has length 19 [2020-01-16 18:33:54,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:54,125 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 215 transitions. [2020-01-16 18:33:54,125 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:54,125 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 215 transitions. [2020-01-16 18:33:54,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:54,126 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:54,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:54,126 INFO L426 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-01-16 18:33:54,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:54,126 INFO L82 PathProgramCache]: Analyzing trace with hash -558714782, now seen corresponding path program 637 times [2020-01-16 18:33:54,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:54,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841813370] [2020-01-16 18:33:54,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:54,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-01-16 18:33:54,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841813370] [2020-01-16 18:33:54,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:54,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:54,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039431245] [2020-01-16 18:33:54,311 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:54,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:54,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:54,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:54,312 INFO L87 Difference]: Start difference. First operand 86 states and 215 transitions. Second operand 8 states. [2020-01-16 18:33:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:54,388 INFO L93 Difference]: Finished difference Result 159 states and 334 transitions. [2020-01-16 18:33:54,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:54,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:54,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:54,389 INFO L225 Difference]: With dead ends: 159 [2020-01-16 18:33:54,389 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 18:33: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-01-16 18:33:54,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 18:33:54,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-01-16 18:33:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 18:33:54,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 225 transitions. [2020-01-16 18:33:54,392 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 225 transitions. Word has length 19 [2020-01-16 18:33:54,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:54,392 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 225 transitions. [2020-01-16 18:33:54,392 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:54,393 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 225 transitions. [2020-01-16 18:33:54,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:54,393 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:54,393 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:54,393 INFO L426 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-01-16 18:33:54,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:54,394 INFO L82 PathProgramCache]: Analyzing trace with hash 561415048, now seen corresponding path program 638 times [2020-01-16 18:33:54,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:54,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291856731] [2020-01-16 18:33:54,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:54,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-01-16 18:33:54,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291856731] [2020-01-16 18:33:54,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:54,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:54,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193012126] [2020-01-16 18:33:54,585 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:54,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:54,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:54,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:54,586 INFO L87 Difference]: Start difference. First operand 90 states and 225 transitions. Second operand 8 states. [2020-01-16 18:33:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:54,639 INFO L93 Difference]: Finished difference Result 155 states and 323 transitions. [2020-01-16 18:33:54,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:54,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:54,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:54,640 INFO L225 Difference]: With dead ends: 155 [2020-01-16 18:33:54,640 INFO L226 Difference]: Without dead ends: 143 [2020-01-16 18:33:54,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-01-16 18:33:54,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 88. [2020-01-16 18:33:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 18:33:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 220 transitions. [2020-01-16 18:33:54,643 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 220 transitions. Word has length 19 [2020-01-16 18:33:54,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:54,643 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 220 transitions. [2020-01-16 18:33:54,643 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:54,644 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 220 transitions. [2020-01-16 18:33:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:54,644 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:54,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-01-16 18:33:54,644 INFO L426 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-01-16 18:33:54,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:54,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1631800162, now seen corresponding path program 639 times [2020-01-16 18:33:54,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:54,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651288501] [2020-01-16 18:33:54,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:54,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-01-16 18:33:54,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651288501] [2020-01-16 18:33:54,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:54,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:54,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408578861] [2020-01-16 18:33:54,830 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:54,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:54,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:54,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:54,830 INFO L87 Difference]: Start difference. First operand 88 states and 220 transitions. Second operand 8 states. [2020-01-16 18:33:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:54,908 INFO L93 Difference]: Finished difference Result 159 states and 337 transitions. [2020-01-16 18:33:54,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:54,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:54,909 INFO L225 Difference]: With dead ends: 159 [2020-01-16 18:33:54,909 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 18:33:54,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-01-16 18:33:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 18:33:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2020-01-16 18:33:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 18:33:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 230 transitions. [2020-01-16 18:33:54,912 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 230 transitions. Word has length 19 [2020-01-16 18:33:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:54,912 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 230 transitions. [2020-01-16 18:33:54,912 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 230 transitions. [2020-01-16 18:33:54,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:54,913 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:54,913 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:54,913 INFO L426 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-01-16 18:33:54,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:54,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2021110216, now seen corresponding path program 640 times [2020-01-16 18:33:54,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:54,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424864894] [2020-01-16 18:33:54,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:55,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424864894] [2020-01-16 18:33:55,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:55,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:55,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260901878] [2020-01-16 18:33:55,107 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:55,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:55,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:55,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:55,108 INFO L87 Difference]: Start difference. First operand 93 states and 230 transitions. Second operand 8 states. [2020-01-16 18:33:55,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:55,186 INFO L93 Difference]: Finished difference Result 149 states and 321 transitions. [2020-01-16 18:33:55,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:55,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:55,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:55,187 INFO L225 Difference]: With dead ends: 149 [2020-01-16 18:33:55,187 INFO L226 Difference]: Without dead ends: 131 [2020-01-16 18:33:55,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-01-16 18:33:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-01-16 18:33:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2020-01-16 18:33:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 18:33:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 218 transitions. [2020-01-16 18:33:55,190 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 218 transitions. Word has length 19 [2020-01-16 18:33:55,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:55,190 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 218 transitions. [2020-01-16 18:33:55,191 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 218 transitions. [2020-01-16 18:33:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:55,191 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:55,191 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:55,191 INFO L426 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-01-16 18:33:55,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:55,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1637126204, now seen corresponding path program 641 times [2020-01-16 18:33:55,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:55,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542777426] [2020-01-16 18:33:55,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:55,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542777426] [2020-01-16 18:33:55,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:55,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:55,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635860018] [2020-01-16 18:33:55,378 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:55,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:55,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:55,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:55,378 INFO L87 Difference]: Start difference. First operand 88 states and 218 transitions. Second operand 8 states. [2020-01-16 18:33:55,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:55,440 INFO L93 Difference]: Finished difference Result 152 states and 316 transitions. [2020-01-16 18:33:55,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:55,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:55,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:55,441 INFO L225 Difference]: With dead ends: 152 [2020-01-16 18:33:55,441 INFO L226 Difference]: Without dead ends: 142 [2020-01-16 18:33:55,441 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-01-16 18:33:55,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-01-16 18:33:55,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 90. [2020-01-16 18:33:55,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 18:33:55,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 221 transitions. [2020-01-16 18:33:55,444 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 221 transitions. Word has length 19 [2020-01-16 18:33:55,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:55,444 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 221 transitions. [2020-01-16 18:33:55,444 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:55,445 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 221 transitions. [2020-01-16 18:33:55,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:55,445 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:55,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-01-16 18:33:55,445 INFO L426 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-01-16 18:33:55,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:55,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1168436096, now seen corresponding path program 642 times [2020-01-16 18:33:55,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:55,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237802268] [2020-01-16 18:33:55,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:55,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237802268] [2020-01-16 18:33:55,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:55,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:55,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349361978] [2020-01-16 18:33:55,629 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:55,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:55,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:55,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:55,630 INFO L87 Difference]: Start difference. First operand 90 states and 221 transitions. Second operand 8 states. [2020-01-16 18:33:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:55,717 INFO L93 Difference]: Finished difference Result 146 states and 312 transitions. [2020-01-16 18:33:55,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:55,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:55,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:55,718 INFO L225 Difference]: With dead ends: 146 [2020-01-16 18:33:55,719 INFO L226 Difference]: Without dead ends: 129 [2020-01-16 18:33:55,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-01-16 18:33:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-01-16 18:33:55,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 86. [2020-01-16 18:33:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-01-16 18:33:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 214 transitions. [2020-01-16 18:33:55,721 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 214 transitions. Word has length 19 [2020-01-16 18:33:55,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:55,722 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 214 transitions. [2020-01-16 18:33:55,722 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 214 transitions. [2020-01-16 18:33:55,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:55,722 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:55,722 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:55,722 INFO L426 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-01-16 18:33:55,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:55,722 INFO L82 PathProgramCache]: Analyzing trace with hash 832566698, now seen corresponding path program 643 times [2020-01-16 18:33:55,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:55,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827213567] [2020-01-16 18:33:55,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:55,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-01-16 18:33:55,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827213567] [2020-01-16 18:33:55,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:55,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:55,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51408675] [2020-01-16 18:33:55,920 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:55,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:55,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:55,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:55,920 INFO L87 Difference]: Start difference. First operand 86 states and 214 transitions. Second operand 8 states. [2020-01-16 18:33:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:55,999 INFO L93 Difference]: Finished difference Result 142 states and 289 transitions. [2020-01-16 18:33:55,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:55,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:55,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:56,000 INFO L225 Difference]: With dead ends: 142 [2020-01-16 18:33:56,000 INFO L226 Difference]: Without dead ends: 132 [2020-01-16 18:33:56,000 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:56,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-01-16 18:33:56,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 88. [2020-01-16 18:33:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 18:33:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 218 transitions. [2020-01-16 18:33:56,002 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 218 transitions. Word has length 19 [2020-01-16 18:33:56,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:56,003 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 218 transitions. [2020-01-16 18:33:56,003 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:56,003 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 218 transitions. [2020-01-16 18:33:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:56,003 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:56,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-01-16 18:33:56,004 INFO L426 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-01-16 18:33:56,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:56,004 INFO L82 PathProgramCache]: Analyzing trace with hash 592924360, now seen corresponding path program 644 times [2020-01-16 18:33:56,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:56,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206270390] [2020-01-16 18:33:56,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:56,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206270390] [2020-01-16 18:33:56,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:56,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:56,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176290701] [2020-01-16 18:33:56,203 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:56,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:56,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:56,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:56,203 INFO L87 Difference]: Start difference. First operand 88 states and 218 transitions. Second operand 8 states. [2020-01-16 18:33:56,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:56,250 INFO L93 Difference]: Finished difference Result 142 states and 288 transitions. [2020-01-16 18:33:56,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:56,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:56,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:56,251 INFO L225 Difference]: With dead ends: 142 [2020-01-16 18:33:56,251 INFO L226 Difference]: Without dead ends: 131 [2020-01-16 18:33:56,251 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:56,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-01-16 18:33:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 87. [2020-01-16 18:33:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 18:33:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 216 transitions. [2020-01-16 18:33:56,254 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 216 transitions. Word has length 19 [2020-01-16 18:33:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:56,254 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 216 transitions. [2020-01-16 18:33:56,254 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 216 transitions. [2020-01-16 18:33:56,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:56,255 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:56,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-01-16 18:33:56,255 INFO L426 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-01-16 18:33:56,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:56,255 INFO L82 PathProgramCache]: Analyzing trace with hash -240518682, now seen corresponding path program 645 times [2020-01-16 18:33:56,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:56,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945482230] [2020-01-16 18:33:56,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:56,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945482230] [2020-01-16 18:33:56,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:56,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:56,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432446378] [2020-01-16 18:33:56,441 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:56,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:56,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:56,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:56,445 INFO L87 Difference]: Start difference. First operand 87 states and 216 transitions. Second operand 8 states. [2020-01-16 18:33:56,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:56,511 INFO L93 Difference]: Finished difference Result 144 states and 295 transitions. [2020-01-16 18:33:56,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:56,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:56,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:56,512 INFO L225 Difference]: With dead ends: 144 [2020-01-16 18:33:56,512 INFO L226 Difference]: Without dead ends: 134 [2020-01-16 18:33:56,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-01-16 18:33:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-01-16 18:33:56,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 89. [2020-01-16 18:33:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 18:33:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 219 transitions. [2020-01-16 18:33:56,514 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 219 transitions. Word has length 19 [2020-01-16 18:33:56,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:56,515 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 219 transitions. [2020-01-16 18:33:56,515 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 219 transitions. [2020-01-16 18:33:56,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:56,515 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:56,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-01-16 18:33:56,515 INFO L426 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-01-16 18:33:56,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:56,515 INFO L82 PathProgramCache]: Analyzing trace with hash 714460322, now seen corresponding path program 646 times [2020-01-16 18:33:56,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:56,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899465222] [2020-01-16 18:33:56,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:56,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:56,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899465222] [2020-01-16 18:33:56,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:56,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:56,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638101507] [2020-01-16 18:33:56,700 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:56,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:56,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:56,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:56,701 INFO L87 Difference]: Start difference. First operand 89 states and 219 transitions. Second operand 8 states. [2020-01-16 18:33:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:56,771 INFO L93 Difference]: Finished difference Result 138 states and 291 transitions. [2020-01-16 18:33:56,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:56,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:56,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:56,772 INFO L225 Difference]: With dead ends: 138 [2020-01-16 18:33:56,772 INFO L226 Difference]: Without dead ends: 123 [2020-01-16 18:33:56,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-01-16 18:33:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-01-16 18:33:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 87. [2020-01-16 18:33:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 18:33:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 215 transitions. [2020-01-16 18:33:56,775 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 215 transitions. Word has length 19 [2020-01-16 18:33:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:56,775 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 215 transitions. [2020-01-16 18:33:56,775 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 215 transitions. [2020-01-16 18:33:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:56,775 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:56,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-01-16 18:33:56,775 INFO L426 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-01-16 18:33:56,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:56,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1130779938, now seen corresponding path program 647 times [2020-01-16 18:33:56,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:56,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115647836] [2020-01-16 18:33:56,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:56,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115647836] [2020-01-16 18:33:56,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:56,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:56,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235057293] [2020-01-16 18:33:56,970 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:56,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:56,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:56,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:56,970 INFO L87 Difference]: Start difference. First operand 87 states and 215 transitions. Second operand 8 states. [2020-01-16 18:33:57,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:57,018 INFO L93 Difference]: Finished difference Result 144 states and 294 transitions. [2020-01-16 18:33:57,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:57,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:57,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:57,019 INFO L225 Difference]: With dead ends: 144 [2020-01-16 18:33:57,019 INFO L226 Difference]: Without dead ends: 134 [2020-01-16 18:33:57,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-01-16 18:33:57,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-01-16 18:33:57,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 89. [2020-01-16 18:33:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 18:33:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 218 transitions. [2020-01-16 18:33:57,021 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 218 transitions. Word has length 19 [2020-01-16 18:33:57,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:57,022 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 218 transitions. [2020-01-16 18:33:57,022 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 218 transitions. [2020-01-16 18:33:57,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:57,022 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:57,022 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:57,022 INFO L426 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-01-16 18:33:57,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:57,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1674782362, now seen corresponding path program 648 times [2020-01-16 18:33:57,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:57,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716677455] [2020-01-16 18:33:57,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:57,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716677455] [2020-01-16 18:33:57,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:57,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:57,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119376140] [2020-01-16 18:33:57,207 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:57,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:57,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:57,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:57,208 INFO L87 Difference]: Start difference. First operand 89 states and 218 transitions. Second operand 8 states. [2020-01-16 18:33:57,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:57,275 INFO L93 Difference]: Finished difference Result 138 states and 290 transitions. [2020-01-16 18:33:57,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:57,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:57,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:57,276 INFO L225 Difference]: With dead ends: 138 [2020-01-16 18:33:57,276 INFO L226 Difference]: Without dead ends: 121 [2020-01-16 18:33:57,277 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:57,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-01-16 18:33:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 85. [2020-01-16 18:33:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-01-16 18:33:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 212 transitions. [2020-01-16 18:33:57,279 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 212 transitions. Word has length 19 [2020-01-16 18:33:57,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:57,279 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 212 transitions. [2020-01-16 18:33:57,279 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 212 transitions. [2020-01-16 18:33:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:57,279 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:57,279 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:33:57,279 INFO L426 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-01-16 18:33:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash -898297510, now seen corresponding path program 649 times [2020-01-16 18:33:57,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:57,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652758626] [2020-01-16 18:33:57,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:57,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652758626] [2020-01-16 18:33:57,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:57,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:57,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000618226] [2020-01-16 18:33:57,452 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:57,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:57,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:57,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:57,453 INFO L87 Difference]: Start difference. First operand 85 states and 212 transitions. Second operand 8 states. [2020-01-16 18:33:57,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:57,519 INFO L93 Difference]: Finished difference Result 154 states and 319 transitions. [2020-01-16 18:33:57,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:57,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:57,520 INFO L225 Difference]: With dead ends: 154 [2020-01-16 18:33:57,520 INFO L226 Difference]: Without dead ends: 140 [2020-01-16 18:33:57,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-01-16 18:33:57,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-01-16 18:33:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 87. [2020-01-16 18:33:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 18:33:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 215 transitions. [2020-01-16 18:33:57,523 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 215 transitions. Word has length 19 [2020-01-16 18:33:57,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:57,523 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 215 transitions. [2020-01-16 18:33:57,523 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:57,523 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 215 transitions. [2020-01-16 18:33:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:57,524 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:57,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-01-16 18:33:57,524 INFO L426 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-01-16 18:33:57,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:57,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1772632836, now seen corresponding path program 650 times [2020-01-16 18:33:57,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:57,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712959249] [2020-01-16 18:33:57,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:57,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-01-16 18:33:57,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712959249] [2020-01-16 18:33:57,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:57,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:57,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166399603] [2020-01-16 18:33:57,702 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:57,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:57,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:57,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:57,702 INFO L87 Difference]: Start difference. First operand 87 states and 215 transitions. Second operand 8 states. [2020-01-16 18:33:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:57,768 INFO L93 Difference]: Finished difference Result 150 states and 308 transitions. [2020-01-16 18:33:57,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:57,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:57,769 INFO L225 Difference]: With dead ends: 150 [2020-01-16 18:33:57,769 INFO L226 Difference]: Without dead ends: 138 [2020-01-16 18:33:57,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:33:57,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-01-16 18:33:57,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 85. [2020-01-16 18:33:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-01-16 18:33:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 210 transitions. [2020-01-16 18:33:57,772 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 210 transitions. Word has length 19 [2020-01-16 18:33:57,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:57,772 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 210 transitions. [2020-01-16 18:33:57,772 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:57,773 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 210 transitions. [2020-01-16 18:33:57,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:57,773 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:57,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-01-16 18:33:57,773 INFO L426 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-01-16 18:33:57,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:57,773 INFO L82 PathProgramCache]: Analyzing trace with hash 591107486, now seen corresponding path program 651 times [2020-01-16 18:33:57,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:57,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866943304] [2020-01-16 18:33:57,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:57,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866943304] [2020-01-16 18:33:57,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:57,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:57,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942283005] [2020-01-16 18:33:57,948 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:57,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:57,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:57,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:57,949 INFO L87 Difference]: Start difference. First operand 85 states and 210 transitions. Second operand 8 states. [2020-01-16 18:33:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:58,014 INFO L93 Difference]: Finished difference Result 158 states and 329 transitions. [2020-01-16 18:33:58,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:58,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:58,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:58,015 INFO L225 Difference]: With dead ends: 158 [2020-01-16 18:33:58,015 INFO L226 Difference]: Without dead ends: 144 [2020-01-16 18:33:58,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-01-16 18:33:58,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-01-16 18:33:58,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 89. [2020-01-16 18:33:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 18:33:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 218 transitions. [2020-01-16 18:33:58,017 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 218 transitions. Word has length 19 [2020-01-16 18:33:58,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:58,018 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 218 transitions. [2020-01-16 18:33:58,018 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 218 transitions. [2020-01-16 18:33:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:58,018 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:58,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-01-16 18:33:58,018 INFO L426 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-01-16 18:33:58,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:58,018 INFO L82 PathProgramCache]: Analyzing trace with hash -154189658, now seen corresponding path program 652 times [2020-01-16 18:33:58,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:58,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979203118] [2020-01-16 18:33:58,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:58,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:58,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979203118] [2020-01-16 18:33:58,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:58,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:58,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108056442] [2020-01-16 18:33:58,197 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:58,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:58,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:58,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:58,197 INFO L87 Difference]: Start difference. First operand 89 states and 218 transitions. Second operand 8 states. [2020-01-16 18:33:58,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:58,264 INFO L93 Difference]: Finished difference Result 156 states and 321 transitions. [2020-01-16 18:33:58,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:58,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:58,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:58,265 INFO L225 Difference]: With dead ends: 156 [2020-01-16 18:33:58,265 INFO L226 Difference]: Without dead ends: 140 [2020-01-16 18:33:58,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-01-16 18:33:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-01-16 18:33:58,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 85. [2020-01-16 18:33:58,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-01-16 18:33:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 208 transitions. [2020-01-16 18:33:58,268 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 208 transitions. Word has length 19 [2020-01-16 18:33:58,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:58,269 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 208 transitions. [2020-01-16 18:33:58,269 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 208 transitions. [2020-01-16 18:33:58,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:58,269 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:58,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-01-16 18:33:58,269 INFO L426 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-01-16 18:33:58,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:58,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1950879654, now seen corresponding path program 653 times [2020-01-16 18:33:58,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:58,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412852126] [2020-01-16 18:33:58,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:58,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412852126] [2020-01-16 18:33:58,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:58,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:58,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938978244] [2020-01-16 18:33:58,450 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:58,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:58,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:58,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:58,451 INFO L87 Difference]: Start difference. First operand 85 states and 208 transitions. Second operand 8 states. [2020-01-16 18:33:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:58,515 INFO L93 Difference]: Finished difference Result 148 states and 302 transitions. [2020-01-16 18:33:58,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:58,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:58,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:58,515 INFO L225 Difference]: With dead ends: 148 [2020-01-16 18:33:58,516 INFO L226 Difference]: Without dead ends: 138 [2020-01-16 18:33:58,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-01-16 18:33:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-01-16 18:33:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 87. [2020-01-16 18:33:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 18:33:58,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 211 transitions. [2020-01-16 18:33:58,518 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 211 transitions. Word has length 19 [2020-01-16 18:33:58,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:58,519 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 211 transitions. [2020-01-16 18:33:58,519 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:58,519 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 211 transitions. [2020-01-16 18:33:58,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:58,519 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:58,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-01-16 18:33:58,519 INFO L426 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-01-16 18:33:58,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:58,519 INFO L82 PathProgramCache]: Analyzing trace with hash -633474334, now seen corresponding path program 654 times [2020-01-16 18:33:58,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:58,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790531156] [2020-01-16 18:33:58,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:58,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-01-16 18:33:58,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790531156] [2020-01-16 18:33:58,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:58,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:58,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504662275] [2020-01-16 18:33:58,698 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:58,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:58,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:58,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:58,698 INFO L87 Difference]: Start difference. First operand 87 states and 211 transitions. Second operand 8 states. [2020-01-16 18:33:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:58,765 INFO L93 Difference]: Finished difference Result 150 states and 305 transitions. [2020-01-16 18:33:58,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:58,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:58,766 INFO L225 Difference]: With dead ends: 150 [2020-01-16 18:33:58,766 INFO L226 Difference]: Without dead ends: 134 [2020-01-16 18:33:58,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-01-16 18:33:58,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-01-16 18:33:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 83. [2020-01-16 18:33:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-01-16 18:33:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 203 transitions. [2020-01-16 18:33:58,769 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 203 transitions. Word has length 19 [2020-01-16 18:33:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:58,769 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 203 transitions. [2020-01-16 18:33:58,769 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 203 transitions. [2020-01-16 18:33:58,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:58,769 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:58,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-01-16 18:33:58,770 INFO L426 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-01-16 18:33:58,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:58,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1213390630, now seen corresponding path program 655 times [2020-01-16 18:33:58,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:58,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255238119] [2020-01-16 18:33:58,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:58,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255238119] [2020-01-16 18:33:58,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:58,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:58,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167469608] [2020-01-16 18:33:58,943 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:58,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:58,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:58,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:58,943 INFO L87 Difference]: Start difference. First operand 83 states and 203 transitions. Second operand 8 states. [2020-01-16 18:33:59,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:59,010 INFO L93 Difference]: Finished difference Result 152 states and 310 transitions. [2020-01-16 18:33:59,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:59,010 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:59,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:59,011 INFO L225 Difference]: With dead ends: 152 [2020-01-16 18:33:59,011 INFO L226 Difference]: Without dead ends: 138 [2020-01-16 18:33:59,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-01-16 18:33:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-01-16 18:33:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2020-01-16 18:33:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-01-16 18:33:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 201 transitions. [2020-01-16 18:33:59,014 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 201 transitions. Word has length 19 [2020-01-16 18:33:59,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:59,014 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 201 transitions. [2020-01-16 18:33:59,014 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:59,014 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 201 transitions. [2020-01-16 18:33:59,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:59,014 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:59,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-01-16 18:33:59,015 INFO L426 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-01-16 18:33:59,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:59,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2087725956, now seen corresponding path program 656 times [2020-01-16 18:33:59,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:59,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799818410] [2020-01-16 18:33:59,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:59,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:59,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799818410] [2020-01-16 18:33:59,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:59,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:59,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415073080] [2020-01-16 18:33:59,187 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:59,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:59,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:59,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:59,188 INFO L87 Difference]: Start difference. First operand 83 states and 201 transitions. Second operand 8 states. [2020-01-16 18:33:59,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:59,257 INFO L93 Difference]: Finished difference Result 148 states and 299 transitions. [2020-01-16 18:33:59,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:59,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:59,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:59,258 INFO L225 Difference]: With dead ends: 148 [2020-01-16 18:33:59,258 INFO L226 Difference]: Without dead ends: 136 [2020-01-16 18:33:59,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-01-16 18:33:59,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-01-16 18:33:59,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 81. [2020-01-16 18:33:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-01-16 18:33:59,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 196 transitions. [2020-01-16 18:33:59,260 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 196 transitions. Word has length 19 [2020-01-16 18:33:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:59,260 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 196 transitions. [2020-01-16 18:33:59,260 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 196 transitions. [2020-01-16 18:33:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:59,261 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:59,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-01-16 18:33:59,261 INFO L426 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-01-16 18:33:59,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:59,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1020716864, now seen corresponding path program 657 times [2020-01-16 18:33:59,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:59,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106999199] [2020-01-16 18:33:59,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:59,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-01-16 18:33:59,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106999199] [2020-01-16 18:33:59,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:59,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:59,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348102572] [2020-01-16 18:33:59,440 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:59,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:59,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:59,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:59,440 INFO L87 Difference]: Start difference. First operand 81 states and 196 transitions. Second operand 8 states. [2020-01-16 18:33:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:59,506 INFO L93 Difference]: Finished difference Result 152 states and 313 transitions. [2020-01-16 18:33:59,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:59,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:59,506 INFO L225 Difference]: With dead ends: 152 [2020-01-16 18:33:59,507 INFO L226 Difference]: Without dead ends: 138 [2020-01-16 18:33:59,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-01-16 18:33:59,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-01-16 18:33:59,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 86. [2020-01-16 18:33:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-01-16 18:33:59,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 206 transitions. [2020-01-16 18:33:59,509 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 206 transitions. Word has length 19 [2020-01-16 18:33:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:59,509 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 206 transitions. [2020-01-16 18:33:59,510 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 206 transitions. [2020-01-16 18:33:59,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:59,510 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:59,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-01-16 18:33:59,510 INFO L426 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-01-16 18:33:59,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:59,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1989600904, now seen corresponding path program 658 times [2020-01-16 18:33:59,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:59,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114086763] [2020-01-16 18:33:59,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:59,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114086763] [2020-01-16 18:33:59,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:59,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:59,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043652616] [2020-01-16 18:33:59,691 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:59,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:59,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:59,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:59,691 INFO L87 Difference]: Start difference. First operand 86 states and 206 transitions. Second operand 8 states. [2020-01-16 18:33:59,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:33:59,759 INFO L93 Difference]: Finished difference Result 142 states and 297 transitions. [2020-01-16 18:33:59,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:33:59,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:33:59,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:33:59,760 INFO L225 Difference]: With dead ends: 142 [2020-01-16 18:33:59,760 INFO L226 Difference]: Without dead ends: 124 [2020-01-16 18:33:59,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-01-16 18:33:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-01-16 18:33:59,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 81. [2020-01-16 18:33:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-01-16 18:33:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 194 transitions. [2020-01-16 18:33:59,762 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 194 transitions. Word has length 19 [2020-01-16 18:33:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:33:59,763 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 194 transitions. [2020-01-16 18:33:59,763 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:33:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 194 transitions. [2020-01-16 18:33:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:33:59,763 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:33:59,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-01-16 18:33:59,763 INFO L426 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-01-16 18:33:59,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:33:59,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1914478264, now seen corresponding path program 659 times [2020-01-16 18:33:59,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:33:59,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051244367] [2020-01-16 18:33:59,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:33:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:33:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:33:59,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051244367] [2020-01-16 18:33:59,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:33:59,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:33:59,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384183309] [2020-01-16 18:33:59,941 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:33:59,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:33:59,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:33:59,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:33:59,941 INFO L87 Difference]: Start difference. First operand 81 states and 194 transitions. Second operand 8 states. [2020-01-16 18:34:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:00,008 INFO L93 Difference]: Finished difference Result 145 states and 292 transitions. [2020-01-16 18:34:00,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:00,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:00,009 INFO L225 Difference]: With dead ends: 145 [2020-01-16 18:34:00,009 INFO L226 Difference]: Without dead ends: 135 [2020-01-16 18:34:00,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-01-16 18:34:00,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-01-16 18:34:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 83. [2020-01-16 18:34:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-01-16 18:34:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 197 transitions. [2020-01-16 18:34:00,011 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 197 transitions. Word has length 19 [2020-01-16 18:34:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:00,012 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 197 transitions. [2020-01-16 18:34:00,012 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 197 transitions. [2020-01-16 18:34:00,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:00,012 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:00,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-01-16 18:34:00,012 INFO L426 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-01-16 18:34:00,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:00,012 INFO L82 PathProgramCache]: Analyzing trace with hash 651441698, now seen corresponding path program 660 times [2020-01-16 18:34:00,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:00,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769038574] [2020-01-16 18:34:00,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:00,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769038574] [2020-01-16 18:34:00,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:00,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:00,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608856239] [2020-01-16 18:34:00,187 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:00,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:00,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:00,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:00,188 INFO L87 Difference]: Start difference. First operand 83 states and 197 transitions. Second operand 8 states. [2020-01-16 18:34:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:00,255 INFO L93 Difference]: Finished difference Result 139 states and 288 transitions. [2020-01-16 18:34:00,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:00,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:00,256 INFO L225 Difference]: With dead ends: 139 [2020-01-16 18:34:00,256 INFO L226 Difference]: Without dead ends: 122 [2020-01-16 18:34:00,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-01-16 18:34:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-01-16 18:34:00,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 79. [2020-01-16 18:34:00,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-01-16 18:34:00,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 189 transitions. [2020-01-16 18:34:00,258 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 189 transitions. Word has length 19 [2020-01-16 18:34:00,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:00,258 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 189 transitions. [2020-01-16 18:34:00,259 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:00,259 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 189 transitions. [2020-01-16 18:34:00,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:00,259 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34: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-01-16 18:34:00,259 INFO L426 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-01-16 18:34:00,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:00,260 INFO L82 PathProgramCache]: Analyzing trace with hash -797071014, now seen corresponding path program 661 times [2020-01-16 18:34:00,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:00,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128760422] [2020-01-16 18:34:00,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:00,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128760422] [2020-01-16 18:34:00,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:00,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:00,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57405524] [2020-01-16 18:34:00,448 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:00,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:00,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:00,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:00,448 INFO L87 Difference]: Start difference. First operand 79 states and 189 transitions. Second operand 8 states. [2020-01-16 18:34:00,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:00,519 INFO L93 Difference]: Finished difference Result 156 states and 329 transitions. [2020-01-16 18:34:00,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:00,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:00,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:00,520 INFO L225 Difference]: With dead ends: 156 [2020-01-16 18:34:00,520 INFO L226 Difference]: Without dead ends: 142 [2020-01-16 18:34:00,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-01-16 18:34:00,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-01-16 18:34:00,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 87. [2020-01-16 18:34:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 18:34:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 213 transitions. [2020-01-16 18:34:00,522 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 213 transitions. Word has length 19 [2020-01-16 18:34:00,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:00,523 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 213 transitions. [2020-01-16 18:34:00,523 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 213 transitions. [2020-01-16 18:34:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:00,523 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:00,523 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:00,523 INFO L426 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-01-16 18:34:00,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:00,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1542368158, now seen corresponding path program 662 times [2020-01-16 18:34:00,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:00,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242822996] [2020-01-16 18:34:00,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:00,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:00,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242822996] [2020-01-16 18:34:00,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:00,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:00,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076717290] [2020-01-16 18:34:00,708 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:00,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:00,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:00,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:00,709 INFO L87 Difference]: Start difference. First operand 87 states and 213 transitions. Second operand 8 states. [2020-01-16 18:34:00,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:00,777 INFO L93 Difference]: Finished difference Result 154 states and 321 transitions. [2020-01-16 18:34:00,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:00,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:00,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:00,777 INFO L225 Difference]: With dead ends: 154 [2020-01-16 18:34:00,778 INFO L226 Difference]: Without dead ends: 138 [2020-01-16 18:34:00,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-01-16 18:34:00,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-01-16 18:34:00,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2020-01-16 18:34:00,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-01-16 18:34:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 201 transitions. [2020-01-16 18:34:00,780 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 201 transitions. Word has length 19 [2020-01-16 18:34:00,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:00,781 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 201 transitions. [2020-01-16 18:34:00,781 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 201 transitions. [2020-01-16 18:34:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:00,781 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:00,781 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:00,782 INFO L426 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-01-16 18:34:00,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:00,782 INFO L82 PathProgramCache]: Analyzing trace with hash -52368516, now seen corresponding path program 663 times [2020-01-16 18:34:00,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:00,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121497707] [2020-01-16 18:34:00,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:00,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:00,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121497707] [2020-01-16 18:34:00,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:00,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:00,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056264924] [2020-01-16 18:34:00,976 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:00,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:00,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:00,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:00,977 INFO L87 Difference]: Start difference. First operand 83 states and 201 transitions. Second operand 8 states. [2020-01-16 18:34:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:01,044 INFO L93 Difference]: Finished difference Result 147 states and 303 transitions. [2020-01-16 18:34:01,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:01,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:01,045 INFO L225 Difference]: With dead ends: 147 [2020-01-16 18:34:01,045 INFO L226 Difference]: Without dead ends: 133 [2020-01-16 18:34:01,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-01-16 18:34:01,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-01-16 18:34:01,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 88. [2020-01-16 18:34:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 18:34:01,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 211 transitions. [2020-01-16 18:34:01,047 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 211 transitions. Word has length 19 [2020-01-16 18:34:01,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:01,048 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 211 transitions. [2020-01-16 18:34:01,048 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 211 transitions. [2020-01-16 18:34:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:01,048 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:01,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-01-16 18:34:01,048 INFO L426 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-01-16 18:34:01,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash 916515524, now seen corresponding path program 664 times [2020-01-16 18:34:01,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:01,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322981514] [2020-01-16 18:34:01,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:01,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322981514] [2020-01-16 18:34:01,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:01,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:01,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607976917] [2020-01-16 18:34:01,240 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:01,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:01,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:01,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:01,240 INFO L87 Difference]: Start difference. First operand 88 states and 211 transitions. Second operand 8 states. [2020-01-16 18:34:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:01,307 INFO L93 Difference]: Finished difference Result 137 states and 287 transitions. [2020-01-16 18:34:01,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:01,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:01,307 INFO L225 Difference]: With dead ends: 137 [2020-01-16 18:34:01,308 INFO L226 Difference]: Without dead ends: 119 [2020-01-16 18:34:01,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-01-16 18:34:01,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 83. [2020-01-16 18:34:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-01-16 18:34:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 197 transitions. [2020-01-16 18:34:01,310 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 197 transitions. Word has length 19 [2020-01-16 18:34:01,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:01,310 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 197 transitions. [2020-01-16 18:34:01,310 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:01,311 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 197 transitions. [2020-01-16 18:34:01,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:01,311 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:01,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-01-16 18:34:01,311 INFO L426 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-01-16 18:34:01,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:01,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1571733990, now seen corresponding path program 665 times [2020-01-16 18:34:01,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:01,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245236708] [2020-01-16 18:34:01,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:01,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245236708] [2020-01-16 18:34:01,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:01,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:01,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408046786] [2020-01-16 18:34:01,511 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:01,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:01,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:01,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:01,511 INFO L87 Difference]: Start difference. First operand 83 states and 197 transitions. Second operand 8 states. [2020-01-16 18:34:01,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:01,580 INFO L93 Difference]: Finished difference Result 135 states and 283 transitions. [2020-01-16 18:34:01,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:01,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:01,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:01,581 INFO L225 Difference]: With dead ends: 135 [2020-01-16 18:34:01,581 INFO L226 Difference]: Without dead ends: 123 [2020-01-16 18:34:01,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:01,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-01-16 18:34:01,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 87. [2020-01-16 18:34:01,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 18:34:01,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 205 transitions. [2020-01-16 18:34:01,584 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 205 transitions. Word has length 19 [2020-01-16 18:34:01,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:01,584 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 205 transitions. [2020-01-16 18:34:01,584 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:01,585 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 205 transitions. [2020-01-16 18:34:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:01,585 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:01,585 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:01,585 INFO L426 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-01-16 18:34:01,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:01,585 INFO L82 PathProgramCache]: Analyzing trace with hash -712859460, now seen corresponding path program 666 times [2020-01-16 18:34:01,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:01,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632156011] [2020-01-16 18:34:01,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:01,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632156011] [2020-01-16 18:34:01,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:01,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:01,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522988618] [2020-01-16 18:34:01,780 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:01,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:01,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:01,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:01,780 INFO L87 Difference]: Start difference. First operand 87 states and 205 transitions. Second operand 8 states. [2020-01-16 18:34:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:01,844 INFO L93 Difference]: Finished difference Result 122 states and 262 transitions. [2020-01-16 18:34:01,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:01,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:01,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:01,845 INFO L225 Difference]: With dead ends: 122 [2020-01-16 18:34:01,845 INFO L226 Difference]: Without dead ends: 101 [2020-01-16 18:34:01,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-01-16 18:34:01,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 79. [2020-01-16 18:34:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-01-16 18:34:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 187 transitions. [2020-01-16 18:34:01,848 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 187 transitions. Word has length 19 [2020-01-16 18:34:01,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:01,848 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 187 transitions. [2020-01-16 18:34:01,848 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 187 transitions. [2020-01-16 18:34:01,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:01,848 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:01,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-01-16 18:34:01,848 INFO L426 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-01-16 18:34:01,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:01,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1100556732, now seen corresponding path program 667 times [2020-01-16 18:34:01,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:01,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464926528] [2020-01-16 18:34:01,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:02,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464926528] [2020-01-16 18:34:02,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:02,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:02,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899262977] [2020-01-16 18:34:02,042 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:02,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:02,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:02,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:02,043 INFO L87 Difference]: Start difference. First operand 79 states and 187 transitions. Second operand 8 states. [2020-01-16 18:34:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:02,110 INFO L93 Difference]: Finished difference Result 141 states and 283 transitions. [2020-01-16 18:34:02,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:02,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:02,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:02,111 INFO L225 Difference]: With dead ends: 141 [2020-01-16 18:34:02,111 INFO L226 Difference]: Without dead ends: 131 [2020-01-16 18:34:02,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-01-16 18:34:02,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-01-16 18:34:02,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 83. [2020-01-16 18:34:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-01-16 18:34:02,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 197 transitions. [2020-01-16 18:34:02,114 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 197 transitions. Word has length 19 [2020-01-16 18:34:02,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:02,114 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 197 transitions. [2020-01-16 18:34:02,114 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:02,114 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 197 transitions. [2020-01-16 18:34:02,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:02,114 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:02,114 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:02,115 INFO L426 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-01-16 18:34:02,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:02,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1483797256, now seen corresponding path program 668 times [2020-01-16 18:34:02,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:02,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935497523] [2020-01-16 18:34:02,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:02,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935497523] [2020-01-16 18:34:02,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:02,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:02,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793279101] [2020-01-16 18:34:02,309 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:02,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:02,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:02,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:02,309 INFO L87 Difference]: Start difference. First operand 83 states and 197 transitions. Second operand 8 states. [2020-01-16 18:34:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:02,375 INFO L93 Difference]: Finished difference Result 143 states and 286 transitions. [2020-01-16 18:34:02,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:02,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:02,376 INFO L225 Difference]: With dead ends: 143 [2020-01-16 18:34:02,376 INFO L226 Difference]: Without dead ends: 129 [2020-01-16 18:34:02,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-01-16 18:34:02,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-01-16 18:34:02,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 81. [2020-01-16 18:34:02,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-01-16 18:34:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 192 transitions. [2020-01-16 18:34:02,378 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 192 transitions. Word has length 19 [2020-01-16 18:34:02,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:02,379 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 192 transitions. [2020-01-16 18:34:02,379 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 192 transitions. [2020-01-16 18:34:02,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:02,379 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:02,380 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:02,380 INFO L426 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-01-16 18:34:02,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:02,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1845259230, now seen corresponding path program 669 times [2020-01-16 18:34:02,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:02,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680638191] [2020-01-16 18:34:02,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:02,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680638191] [2020-01-16 18:34:02,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:02,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:02,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567768830] [2020-01-16 18:34:02,567 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:02,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:02,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:02,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:02,567 INFO L87 Difference]: Start difference. First operand 81 states and 192 transitions. Second operand 8 states. [2020-01-16 18:34:02,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:02,632 INFO L93 Difference]: Finished difference Result 138 states and 275 transitions. [2020-01-16 18:34:02,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:02,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:02,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:02,633 INFO L225 Difference]: With dead ends: 138 [2020-01-16 18:34:02,633 INFO L226 Difference]: Without dead ends: 128 [2020-01-16 18:34:02,633 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:02,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-01-16 18:34:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 83. [2020-01-16 18:34:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-01-16 18:34:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 195 transitions. [2020-01-16 18:34:02,636 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 195 transitions. Word has length 19 [2020-01-16 18:34:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:02,636 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 195 transitions. [2020-01-16 18:34:02,636 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 195 transitions. [2020-01-16 18:34:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:02,636 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:02,637 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:02,637 INFO L426 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-01-16 18:34:02,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:02,637 INFO L82 PathProgramCache]: Analyzing trace with hash 116211896, now seen corresponding path program 670 times [2020-01-16 18:34:02,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:02,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173800726] [2020-01-16 18:34:02,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:02,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173800726] [2020-01-16 18:34:02,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:02,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:02,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200601525] [2020-01-16 18:34:02,827 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:02,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:02,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:02,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:02,828 INFO L87 Difference]: Start difference. First operand 83 states and 195 transitions. Second operand 8 states. [2020-01-16 18:34:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:02,901 INFO L93 Difference]: Finished difference Result 132 states and 271 transitions. [2020-01-16 18:34:02,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:02,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:02,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:02,902 INFO L225 Difference]: With dead ends: 132 [2020-01-16 18:34:02,902 INFO L226 Difference]: Without dead ends: 117 [2020-01-16 18:34:02,903 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-01-16 18:34:02,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 81. [2020-01-16 18:34:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-01-16 18:34:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 190 transitions. [2020-01-16 18:34:02,905 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 190 transitions. Word has length 19 [2020-01-16 18:34:02,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:02,905 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 190 transitions. [2020-01-16 18:34:02,905 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 190 transitions. [2020-01-16 18:34:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:02,906 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:02,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-01-16 18:34:02,906 INFO L426 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-01-16 18:34:02,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:02,906 INFO L82 PathProgramCache]: Analyzing trace with hash 750310238, now seen corresponding path program 671 times [2020-01-16 18:34:02,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:02,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094019890] [2020-01-16 18:34:02,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:03,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-01-16 18:34:03,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094019890] [2020-01-16 18:34:03,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:03,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:03,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426989186] [2020-01-16 18:34:03,098 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:03,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:03,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:03,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:03,098 INFO L87 Difference]: Start difference. First operand 81 states and 190 transitions. Second operand 8 states. [2020-01-16 18:34:03,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:03,170 INFO L93 Difference]: Finished difference Result 133 states and 276 transitions. [2020-01-16 18:34:03,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:03,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:03,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:03,171 INFO L225 Difference]: With dead ends: 133 [2020-01-16 18:34:03,171 INFO L226 Difference]: Without dead ends: 121 [2020-01-16 18:34:03,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-01-16 18:34:03,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-01-16 18:34:03,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 85. [2020-01-16 18:34:03,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-01-16 18:34:03,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 198 transitions. [2020-01-16 18:34:03,173 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 198 transitions. Word has length 19 [2020-01-16 18:34:03,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:03,174 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 198 transitions. [2020-01-16 18:34:03,174 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:03,174 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 198 transitions. [2020-01-16 18:34:03,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:03,174 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:03,174 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:03,174 INFO L426 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-01-16 18:34:03,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:03,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1605616892, now seen corresponding path program 672 times [2020-01-16 18:34:03,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:03,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450471239] [2020-01-16 18:34:03,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:03,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450471239] [2020-01-16 18:34:03,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:03,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:03,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314539315] [2020-01-16 18:34:03,378 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:03,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:03,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:03,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:03,378 INFO L87 Difference]: Start difference. First operand 85 states and 198 transitions. Second operand 8 states. [2020-01-16 18:34:03,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:03,443 INFO L93 Difference]: Finished difference Result 120 states and 255 transitions. [2020-01-16 18:34:03,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:03,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:03,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:03,443 INFO L225 Difference]: With dead ends: 120 [2020-01-16 18:34:03,444 INFO L226 Difference]: Without dead ends: 99 [2020-01-16 18:34:03,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-01-16 18:34:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-01-16 18:34:03,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2020-01-16 18:34:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-01-16 18:34:03,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 183 transitions. [2020-01-16 18:34:03,446 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 183 transitions. Word has length 19 [2020-01-16 18:34:03,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:03,446 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 183 transitions. [2020-01-16 18:34:03,446 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 183 transitions. [2020-01-16 18:34:03,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:03,447 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:03,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-01-16 18:34:03,447 INFO L426 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-01-16 18:34:03,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:03,447 INFO L82 PathProgramCache]: Analyzing trace with hash 598823932, now seen corresponding path program 673 times [2020-01-16 18:34:03,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:03,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792600969] [2020-01-16 18:34:03,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:03,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792600969] [2020-01-16 18:34:03,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:03,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:03,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057851383] [2020-01-16 18:34:03,622 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:03,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:03,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:03,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:03,623 INFO L87 Difference]: Start difference. First operand 77 states and 183 transitions. Second operand 8 states. [2020-01-16 18:34:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:03,687 INFO L93 Difference]: Finished difference Result 136 states and 266 transitions. [2020-01-16 18:34:03,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:03,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:03,688 INFO L225 Difference]: With dead ends: 136 [2020-01-16 18:34:03,688 INFO L226 Difference]: Without dead ends: 122 [2020-01-16 18:34:03,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-01-16 18:34:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-01-16 18:34:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 79. [2020-01-16 18:34:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-01-16 18:34:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 186 transitions. [2020-01-16 18:34:03,690 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 186 transitions. Word has length 19 [2020-01-16 18:34:03,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:03,691 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 186 transitions. [2020-01-16 18:34:03,691 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:03,691 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 186 transitions. [2020-01-16 18:34:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:03,692 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:03,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-01-16 18:34:03,692 INFO L426 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-01-16 18:34:03,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:03,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1718953762, now seen corresponding path program 674 times [2020-01-16 18:34:03,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:03,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116326302] [2020-01-16 18:34:03,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:03,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116326302] [2020-01-16 18:34:03,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:03,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:03,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257492994] [2020-01-16 18:34:03,866 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:03,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:03,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:03,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:03,866 INFO L87 Difference]: Start difference. First operand 79 states and 186 transitions. Second operand 8 states. [2020-01-16 18:34:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:03,916 INFO L93 Difference]: Finished difference Result 132 states and 255 transitions. [2020-01-16 18:34:03,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:03,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:03,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:03,917 INFO L225 Difference]: With dead ends: 132 [2020-01-16 18:34:03,917 INFO L226 Difference]: Without dead ends: 120 [2020-01-16 18:34:03,917 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-01-16 18:34:03,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-01-16 18:34:03,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 77. [2020-01-16 18:34:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-01-16 18:34:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 181 transitions. [2020-01-16 18:34:03,919 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 181 transitions. Word has length 19 [2020-01-16 18:34:03,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:03,919 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 181 transitions. [2020-01-16 18:34:03,919 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 181 transitions. [2020-01-16 18:34:03,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:03,920 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:03,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:03,920 INFO L426 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-01-16 18:34:03,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:03,920 INFO L82 PathProgramCache]: Analyzing trace with hash -145878566, now seen corresponding path program 675 times [2020-01-16 18:34:03,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:03,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297158046] [2020-01-16 18:34:03,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:04,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297158046] [2020-01-16 18:34:04,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:04,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:04,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786997751] [2020-01-16 18:34:04,093 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:04,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:04,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:04,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:04,094 INFO L87 Difference]: Start difference. First operand 77 states and 181 transitions. Second operand 8 states. [2020-01-16 18:34:04,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:04,155 INFO L93 Difference]: Finished difference Result 140 states and 276 transitions. [2020-01-16 18:34:04,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:04,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:04,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:04,156 INFO L225 Difference]: With dead ends: 140 [2020-01-16 18:34:04,156 INFO L226 Difference]: Without dead ends: 126 [2020-01-16 18:34:04,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:04,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-01-16 18:34:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 81. [2020-01-16 18:34:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-01-16 18:34:04,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 189 transitions. [2020-01-16 18:34:04,158 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 189 transitions. Word has length 19 [2020-01-16 18:34:04,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:04,158 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 189 transitions. [2020-01-16 18:34:04,158 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 189 transitions. [2020-01-16 18:34:04,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:04,158 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:04,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-01-16 18:34:04,159 INFO L426 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-01-16 18:34:04,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:04,159 INFO L82 PathProgramCache]: Analyzing trace with hash -891175710, now seen corresponding path program 676 times [2020-01-16 18:34:04,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:04,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981668989] [2020-01-16 18:34:04,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:04,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981668989] [2020-01-16 18:34:04,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:04,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:04,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023750125] [2020-01-16 18:34:04,341 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:04,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:04,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:04,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:04,341 INFO L87 Difference]: Start difference. First operand 81 states and 189 transitions. Second operand 8 states. [2020-01-16 18:34:04,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:04,408 INFO L93 Difference]: Finished difference Result 138 states and 268 transitions. [2020-01-16 18:34:04,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:04,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:04,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:04,409 INFO L225 Difference]: With dead ends: 138 [2020-01-16 18:34:04,409 INFO L226 Difference]: Without dead ends: 122 [2020-01-16 18:34:04,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-01-16 18:34:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-01-16 18:34:04,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2020-01-16 18:34:04,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-01-16 18:34:04,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 179 transitions. [2020-01-16 18:34:04,411 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 179 transitions. Word has length 19 [2020-01-16 18:34:04,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:04,412 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 179 transitions. [2020-01-16 18:34:04,412 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:04,412 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 179 transitions. [2020-01-16 18:34:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:04,412 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:04,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-01-16 18:34:04,413 INFO L426 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-01-16 18:34:04,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:04,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1183723960, now seen corresponding path program 677 times [2020-01-16 18:34:04,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:04,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402562947] [2020-01-16 18:34:04,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:04,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402562947] [2020-01-16 18:34:04,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:04,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:04,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784990597] [2020-01-16 18:34:04,598 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:04,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:04,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:04,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:04,598 INFO L87 Difference]: Start difference. First operand 77 states and 179 transitions. Second operand 8 states. [2020-01-16 18:34:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:04,643 INFO L93 Difference]: Finished difference Result 130 states and 249 transitions. [2020-01-16 18:34:04,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:04,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:04,644 INFO L225 Difference]: With dead ends: 130 [2020-01-16 18:34:04,644 INFO L226 Difference]: Without dead ends: 120 [2020-01-16 18:34:04,644 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-01-16 18:34:04,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-01-16 18:34:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 79. [2020-01-16 18:34:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-01-16 18:34:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 182 transitions. [2020-01-16 18:34:04,646 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 182 transitions. Word has length 19 [2020-01-16 18:34:04,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:04,646 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 182 transitions. [2020-01-16 18:34:04,646 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:04,647 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 182 transitions. [2020-01-16 18:34:04,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:04,647 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:04,647 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:04,647 INFO L426 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-01-16 18:34:04,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:04,647 INFO L82 PathProgramCache]: Analyzing trace with hash 328417306, now seen corresponding path program 678 times [2020-01-16 18:34:04,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:04,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269227265] [2020-01-16 18:34:04,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:04,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269227265] [2020-01-16 18:34:04,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:04,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:04,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189092730] [2020-01-16 18:34:04,823 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:04,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:04,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:04,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:04,823 INFO L87 Difference]: Start difference. First operand 79 states and 182 transitions. Second operand 8 states. [2020-01-16 18:34:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:04,887 INFO L93 Difference]: Finished difference Result 132 states and 252 transitions. [2020-01-16 18:34:04,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:04,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:04,888 INFO L225 Difference]: With dead ends: 132 [2020-01-16 18:34:04,888 INFO L226 Difference]: Without dead ends: 116 [2020-01-16 18:34:04,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-01-16 18:34:04,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-01-16 18:34:04,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2020-01-16 18:34:04,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-01-16 18:34:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 174 transitions. [2020-01-16 18:34:04,891 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 174 transitions. Word has length 19 [2020-01-16 18:34:04,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:04,891 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 174 transitions. [2020-01-16 18:34:04,891 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 174 transitions. [2020-01-16 18:34:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:04,891 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:04,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-01-16 18:34:04,892 INFO L426 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-01-16 18:34:04,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:04,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1001613922, now seen corresponding path program 679 times [2020-01-16 18:34:04,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:04,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61890161] [2020-01-16 18:34:04,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:05,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61890161] [2020-01-16 18:34:05,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:05,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:05,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788130351] [2020-01-16 18:34:05,087 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:05,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:05,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:05,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:05,088 INFO L87 Difference]: Start difference. First operand 75 states and 174 transitions. Second operand 8 states. [2020-01-16 18:34:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:05,156 INFO L93 Difference]: Finished difference Result 133 states and 254 transitions. [2020-01-16 18:34:05,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:05,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:05,157 INFO L225 Difference]: With dead ends: 133 [2020-01-16 18:34:05,157 INFO L226 Difference]: Without dead ends: 119 [2020-01-16 18:34:05,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-01-16 18:34:05,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-01-16 18:34:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 75. [2020-01-16 18:34:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-01-16 18:34:05,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 172 transitions. [2020-01-16 18:34:05,159 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 172 transitions. Word has length 19 [2020-01-16 18:34:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:05,159 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 172 transitions. [2020-01-16 18:34:05,159 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 172 transitions. [2020-01-16 18:34:05,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:05,160 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:05,160 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:05,160 INFO L426 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-01-16 18:34:05,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:05,160 INFO L82 PathProgramCache]: Analyzing trace with hash 118515908, now seen corresponding path program 680 times [2020-01-16 18:34:05,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:05,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342390425] [2020-01-16 18:34:05,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:05,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-01-16 18:34:05,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342390425] [2020-01-16 18:34:05,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:05,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:05,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985408942] [2020-01-16 18:34:05,349 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:05,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:05,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:05,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:05,350 INFO L87 Difference]: Start difference. First operand 75 states and 172 transitions. Second operand 8 states. [2020-01-16 18:34:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:05,399 INFO L93 Difference]: Finished difference Result 129 states and 243 transitions. [2020-01-16 18:34:05,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:05,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:05,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:05,399 INFO L225 Difference]: With dead ends: 129 [2020-01-16 18:34:05,400 INFO L226 Difference]: Without dead ends: 117 [2020-01-16 18:34:05,400 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:05,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-01-16 18:34:05,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 73. [2020-01-16 18:34:05,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-01-16 18:34:05,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 167 transitions. [2020-01-16 18:34:05,402 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 167 transitions. Word has length 19 [2020-01-16 18:34:05,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:05,402 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 167 transitions. [2020-01-16 18:34:05,402 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 167 transitions. [2020-01-16 18:34:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:05,402 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:05,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-01-16 18:34:05,403 INFO L426 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-01-16 18:34:05,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:05,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2074699302, now seen corresponding path program 681 times [2020-01-16 18:34:05,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:05,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757611566] [2020-01-16 18:34:05,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:05,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757611566] [2020-01-16 18:34:05,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:05,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:05,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127368153] [2020-01-16 18:34:05,591 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:05,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:05,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:05,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:05,591 INFO L87 Difference]: Start difference. First operand 73 states and 167 transitions. Second operand 8 states. [2020-01-16 18:34:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:05,657 INFO L93 Difference]: Finished difference Result 133 states and 257 transitions. [2020-01-16 18:34:05,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:05,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:05,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:05,658 INFO L225 Difference]: With dead ends: 133 [2020-01-16 18:34:05,658 INFO L226 Difference]: Without dead ends: 119 [2020-01-16 18:34:05,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:05,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-01-16 18:34:05,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 78. [2020-01-16 18:34:05,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-01-16 18:34:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 177 transitions. [2020-01-16 18:34:05,660 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 177 transitions. Word has length 19 [2020-01-16 18:34:05,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:05,660 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 177 transitions. [2020-01-16 18:34:05,660 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:05,660 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 177 transitions. [2020-01-16 18:34:05,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:05,660 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:05,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-01-16 18:34:05,660 INFO L426 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-01-16 18:34:05,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:05,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1578211076, now seen corresponding path program 682 times [2020-01-16 18:34:05,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:05,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212109487] [2020-01-16 18:34:05,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:05,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212109487] [2020-01-16 18:34:05,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:05,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:05,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128377260] [2020-01-16 18:34:05,850 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:05,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:05,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:05,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:05,850 INFO L87 Difference]: Start difference. First operand 78 states and 177 transitions. Second operand 8 states. [2020-01-16 18:34:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:05,916 INFO L93 Difference]: Finished difference Result 123 states and 241 transitions. [2020-01-16 18:34:05,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:05,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:05,916 INFO L225 Difference]: With dead ends: 123 [2020-01-16 18:34:05,917 INFO L226 Difference]: Without dead ends: 105 [2020-01-16 18:34:05,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:05,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-01-16 18:34:05,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2020-01-16 18:34:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-01-16 18:34:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 165 transitions. [2020-01-16 18:34:05,919 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 165 transitions. Word has length 19 [2020-01-16 18:34:05,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:05,920 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 165 transitions. [2020-01-16 18:34:05,920 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 165 transitions. [2020-01-16 18:34:05,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:05,920 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:05,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:05,920 INFO L426 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-01-16 18:34:05,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:05,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1194227064, now seen corresponding path program 683 times [2020-01-16 18:34:05,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:05,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625184943] [2020-01-16 18:34:05,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:06,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625184943] [2020-01-16 18:34:06,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:06,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:06,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531153783] [2020-01-16 18:34:06,126 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:06,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:06,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:06,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:06,127 INFO L87 Difference]: Start difference. First operand 73 states and 165 transitions. Second operand 8 states. [2020-01-16 18:34:06,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:06,173 INFO L93 Difference]: Finished difference Result 126 states and 236 transitions. [2020-01-16 18:34:06,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:06,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:06,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:06,174 INFO L225 Difference]: With dead ends: 126 [2020-01-16 18:34:06,174 INFO L226 Difference]: Without dead ends: 116 [2020-01-16 18:34:06,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-01-16 18:34:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-01-16 18:34:06,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2020-01-16 18:34:06,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-01-16 18:34:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 168 transitions. [2020-01-16 18:34:06,176 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 168 transitions. Word has length 19 [2020-01-16 18:34:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:06,176 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 168 transitions. [2020-01-16 18:34:06,177 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 168 transitions. [2020-01-16 18:34:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:06,177 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:06,177 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:06,177 INFO L426 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-01-16 18:34:06,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:06,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1611335236, now seen corresponding path program 684 times [2020-01-16 18:34:06,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:06,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989463122] [2020-01-16 18:34:06,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:06,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:06,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989463122] [2020-01-16 18:34:06,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:06,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:06,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368083562] [2020-01-16 18:34:06,375 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:06,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:06,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:06,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:06,376 INFO L87 Difference]: Start difference. First operand 75 states and 168 transitions. Second operand 8 states. [2020-01-16 18:34:06,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:06,441 INFO L93 Difference]: Finished difference Result 120 states and 232 transitions. [2020-01-16 18:34:06,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:06,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:06,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:06,442 INFO L225 Difference]: With dead ends: 120 [2020-01-16 18:34:06,442 INFO L226 Difference]: Without dead ends: 103 [2020-01-16 18:34:06,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-01-16 18:34:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-01-16 18:34:06,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2020-01-16 18:34:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-01-16 18:34:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 160 transitions. [2020-01-16 18:34:06,444 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 160 transitions. Word has length 19 [2020-01-16 18:34:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:06,444 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 160 transitions. [2020-01-16 18:34:06,444 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 160 transitions. [2020-01-16 18:34:06,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:06,445 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:06,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-01-16 18:34:06,445 INFO L426 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-01-16 18:34:06,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:06,445 INFO L82 PathProgramCache]: Analyzing trace with hash 948213022, now seen corresponding path program 685 times [2020-01-16 18:34:06,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:06,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133507425] [2020-01-16 18:34:06,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:06,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-01-16 18:34:06,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133507425] [2020-01-16 18:34:06,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:06,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:06,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051662275] [2020-01-16 18:34:06,633 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:06,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:06,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:06,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:06,633 INFO L87 Difference]: Start difference. First operand 71 states and 160 transitions. Second operand 8 states. [2020-01-16 18:34:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:06,699 INFO L93 Difference]: Finished difference Result 129 states and 245 transitions. [2020-01-16 18:34:06,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:06,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:06,700 INFO L225 Difference]: With dead ends: 129 [2020-01-16 18:34:06,700 INFO L226 Difference]: Without dead ends: 115 [2020-01-16 18:34:06,700 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:06,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-01-16 18:34:06,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 71. [2020-01-16 18:34:06,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-01-16 18:34:06,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 156 transitions. [2020-01-16 18:34:06,702 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 156 transitions. Word has length 19 [2020-01-16 18:34:06,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:06,703 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 156 transitions. [2020-01-16 18:34:06,703 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:06,703 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 156 transitions. [2020-01-16 18:34:06,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:06,703 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:06,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-01-16 18:34:06,703 INFO L426 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-01-16 18:34:06,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:06,704 INFO L82 PathProgramCache]: Analyzing trace with hash 202915878, now seen corresponding path program 686 times [2020-01-16 18:34:06,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:06,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251961462] [2020-01-16 18:34:06,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:06,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:06,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251961462] [2020-01-16 18:34:06,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:06,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:06,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696590497] [2020-01-16 18:34:06,892 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:06,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:06,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:06,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:06,892 INFO L87 Difference]: Start difference. First operand 71 states and 156 transitions. Second operand 8 states. [2020-01-16 18:34:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:06,957 INFO L93 Difference]: Finished difference Result 127 states and 237 transitions. [2020-01-16 18:34:06,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:06,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:06,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:06,958 INFO L225 Difference]: With dead ends: 127 [2020-01-16 18:34:06,958 INFO L226 Difference]: Without dead ends: 111 [2020-01-16 18:34:06,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-01-16 18:34:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-01-16 18:34:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 67. [2020-01-16 18:34:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-01-16 18:34:06,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 144 transitions. [2020-01-16 18:34:06,960 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 144 transitions. Word has length 19 [2020-01-16 18:34:06,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:06,960 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 144 transitions. [2020-01-16 18:34:06,961 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:06,961 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 144 transitions. [2020-01-16 18:34:06,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:06,961 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:06,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-01-16 18:34:06,961 INFO L426 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-01-16 18:34:06,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:06,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1001613922, now seen corresponding path program 687 times [2020-01-16 18:34:06,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:06,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830672939] [2020-01-16 18:34:06,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:07,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830672939] [2020-01-16 18:34:07,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:07,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:07,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005285650] [2020-01-16 18:34:07,180 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:07,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:07,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:07,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:07,180 INFO L87 Difference]: Start difference. First operand 67 states and 144 transitions. Second operand 8 states. [2020-01-16 18:34:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:07,248 INFO L93 Difference]: Finished difference Result 120 states and 219 transitions. [2020-01-16 18:34:07,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:07,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:07,249 INFO L225 Difference]: With dead ends: 120 [2020-01-16 18:34:07,249 INFO L226 Difference]: Without dead ends: 106 [2020-01-16 18:34:07,250 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:07,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-01-16 18:34:07,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 61. [2020-01-16 18:34:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-01-16 18:34:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 127 transitions. [2020-01-16 18:34:07,252 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 127 transitions. Word has length 19 [2020-01-16 18:34:07,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:07,252 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 127 transitions. [2020-01-16 18:34:07,252 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:07,252 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 127 transitions. [2020-01-16 18:34:07,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:07,252 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:07,252 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:07,253 INFO L426 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-01-16 18:34:07,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:07,253 INFO L82 PathProgramCache]: Analyzing trace with hash -32729882, now seen corresponding path program 688 times [2020-01-16 18:34:07,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:07,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902702622] [2020-01-16 18:34:07,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:07,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:07,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902702622] [2020-01-16 18:34:07,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:07,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:07,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574470690] [2020-01-16 18:34:07,444 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:07,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:07,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:07,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:07,445 INFO L87 Difference]: Start difference. First operand 61 states and 127 transitions. Second operand 8 states. [2020-01-16 18:34:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:07,511 INFO L93 Difference]: Finished difference Result 110 states and 203 transitions. [2020-01-16 18:34:07,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:07,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:07,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:07,517 INFO L225 Difference]: With dead ends: 110 [2020-01-16 18:34:07,517 INFO L226 Difference]: Without dead ends: 92 [2020-01-16 18:34:07,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-01-16 18:34:07,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2020-01-16 18:34:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-01-16 18:34:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 113 transitions. [2020-01-16 18:34:07,518 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 113 transitions. Word has length 19 [2020-01-16 18:34:07,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:07,518 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 113 transitions. [2020-01-16 18:34:07,518 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:07,518 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 113 transitions. [2020-01-16 18:34:07,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:07,518 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:07,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-01-16 18:34:07,519 INFO L426 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-01-16 18:34:07,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:07,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1773987900, now seen corresponding path program 689 times [2020-01-16 18:34:07,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:07,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871459121] [2020-01-16 18:34:07,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:07,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-01-16 18:34:07,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871459121] [2020-01-16 18:34:07,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:07,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:07,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426607590] [2020-01-16 18:34:07,707 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:07,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:07,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:07,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:07,707 INFO L87 Difference]: Start difference. First operand 56 states and 113 transitions. Second operand 8 states. [2020-01-16 18:34:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:07,773 INFO L93 Difference]: Finished difference Result 108 states and 199 transitions. [2020-01-16 18:34:07,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:07,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:07,774 INFO L225 Difference]: With dead ends: 108 [2020-01-16 18:34:07,774 INFO L226 Difference]: Without dead ends: 96 [2020-01-16 18:34:07,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-01-16 18:34:07,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-01-16 18:34:07,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 60. [2020-01-16 18:34:07,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-01-16 18:34:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 121 transitions. [2020-01-16 18:34:07,776 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 121 transitions. Word has length 19 [2020-01-16 18:34:07,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:07,776 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 121 transitions. [2020-01-16 18:34:07,776 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:07,776 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 121 transitions. [2020-01-16 18:34:07,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:07,777 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:07,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-01-16 18:34:07,777 INFO L426 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-01-16 18:34:07,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:07,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1662104866, now seen corresponding path program 690 times [2020-01-16 18:34:07,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:07,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717804379] [2020-01-16 18:34:07,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:07,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717804379] [2020-01-16 18:34:07,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:07,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:07,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131696504] [2020-01-16 18:34:07,966 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:07,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:07,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:07,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:07,967 INFO L87 Difference]: Start difference. First operand 60 states and 121 transitions. Second operand 8 states. [2020-01-16 18:34:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:08,030 INFO L93 Difference]: Finished difference Result 95 states and 178 transitions. [2020-01-16 18:34:08,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:08,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:08,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:08,031 INFO L225 Difference]: With dead ends: 95 [2020-01-16 18:34:08,031 INFO L226 Difference]: Without dead ends: 74 [2020-01-16 18:34:08,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-01-16 18:34:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-01-16 18:34:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2020-01-16 18:34:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-01-16 18:34:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 103 transitions. [2020-01-16 18:34:08,033 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 103 transitions. Word has length 19 [2020-01-16 18:34:08,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:08,033 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 103 transitions. [2020-01-16 18:34:08,033 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 103 transitions. [2020-01-16 18:34:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:08,033 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:08,033 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:08,033 INFO L426 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-01-16 18:34:08,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:08,033 INFO L82 PathProgramCache]: Analyzing trace with hash 171031428, now seen corresponding path program 691 times [2020-01-16 18:34:08,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:08,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462458677] [2020-01-16 18:34:08,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:08,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:08,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462458677] [2020-01-16 18:34:08,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:08,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:08,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104156852] [2020-01-16 18:34:08,232 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:08,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:08,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:08,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:08,233 INFO L87 Difference]: Start difference. First operand 52 states and 103 transitions. Second operand 8 states. [2020-01-16 18:34:08,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:08,280 INFO L93 Difference]: Finished difference Result 101 states and 182 transitions. [2020-01-16 18:34:08,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:08,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:08,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:08,281 INFO L225 Difference]: With dead ends: 101 [2020-01-16 18:34:08,281 INFO L226 Difference]: Without dead ends: 91 [2020-01-16 18:34:08,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-01-16 18:34:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-01-16 18:34:08,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 56. [2020-01-16 18:34:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-01-16 18:34:08,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 113 transitions. [2020-01-16 18:34:08,283 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 113 transitions. Word has length 19 [2020-01-16 18:34:08,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:08,284 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 113 transitions. [2020-01-16 18:34:08,284 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 113 transitions. [2020-01-16 18:34:08,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:08,284 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:08,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-01-16 18:34:08,284 INFO L426 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-01-16 18:34:08,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:08,285 INFO L82 PathProgramCache]: Analyzing trace with hash -684275226, now seen corresponding path program 692 times [2020-01-16 18:34:08,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:08,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117577861] [2020-01-16 18:34:08,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:08,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117577861] [2020-01-16 18:34:08,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:08,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:08,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383203206] [2020-01-16 18:34:08,480 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:08,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:08,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:08,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:08,481 INFO L87 Difference]: Start difference. First operand 56 states and 113 transitions. Second operand 8 states. [2020-01-16 18:34:08,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:08,545 INFO L93 Difference]: Finished difference Result 103 states and 185 transitions. [2020-01-16 18:34:08,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:08,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:08,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:08,546 INFO L225 Difference]: With dead ends: 103 [2020-01-16 18:34:08,546 INFO L226 Difference]: Without dead ends: 89 [2020-01-16 18:34:08,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-01-16 18:34:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-01-16 18:34:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 54. [2020-01-16 18:34:08,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-01-16 18:34:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 108 transitions. [2020-01-16 18:34:08,548 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 108 transitions. Word has length 19 [2020-01-16 18:34:08,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:08,548 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 108 transitions. [2020-01-16 18:34:08,548 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:08,548 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 108 transitions. [2020-01-16 18:34:08,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:08,549 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:08,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-01-16 18:34:08,549 INFO L426 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-01-16 18:34:08,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:08,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1781972386, now seen corresponding path program 693 times [2020-01-16 18:34:08,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:08,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079315422] [2020-01-16 18:34:08,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:08,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079315422] [2020-01-16 18:34:08,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:08,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:08,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253296758] [2020-01-16 18:34:08,750 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:08,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:08,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:08,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:08,751 INFO L87 Difference]: Start difference. First operand 54 states and 108 transitions. Second operand 8 states. [2020-01-16 18:34:08,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:08,799 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2020-01-16 18:34:08,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:08,800 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:08,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:08,800 INFO L225 Difference]: With dead ends: 97 [2020-01-16 18:34:08,800 INFO L226 Difference]: Without dead ends: 87 [2020-01-16 18:34:08,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-01-16 18:34:08,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-01-16 18:34:08,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2020-01-16 18:34:08,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-01-16 18:34:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 111 transitions. [2020-01-16 18:34:08,802 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 111 transitions. Word has length 19 [2020-01-16 18:34:08,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:08,803 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 111 transitions. [2020-01-16 18:34:08,803 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 111 transitions. [2020-01-16 18:34:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:08,803 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:08,803 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:08,803 INFO L426 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-01-16 18:34:08,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:08,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1023589914, now seen corresponding path program 694 times [2020-01-16 18:34:08,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:08,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032728153] [2020-01-16 18:34:08,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:08,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032728153] [2020-01-16 18:34:08,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:08,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:08,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582074163] [2020-01-16 18:34:08,991 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:08,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:08,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:08,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:08,991 INFO L87 Difference]: Start difference. First operand 56 states and 111 transitions. Second operand 8 states. [2020-01-16 18:34:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:09,055 INFO L93 Difference]: Finished difference Result 91 states and 168 transitions. [2020-01-16 18:34:09,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:09,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:09,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:09,056 INFO L225 Difference]: With dead ends: 91 [2020-01-16 18:34:09,056 INFO L226 Difference]: Without dead ends: 76 [2020-01-16 18:34:09,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-01-16 18:34:09,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-01-16 18:34:09,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2020-01-16 18:34:09,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-01-16 18:34:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 106 transitions. [2020-01-16 18:34:09,058 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 106 transitions. Word has length 19 [2020-01-16 18:34:09,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:09,059 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 106 transitions. [2020-01-16 18:34:09,059 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 106 transitions. [2020-01-16 18:34:09,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:09,059 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:09,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-01-16 18:34:09,059 INFO L426 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-01-16 18:34:09,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:09,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1757360606, now seen corresponding path program 695 times [2020-01-16 18:34:09,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:09,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966710549] [2020-01-16 18:34:09,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:09,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966710549] [2020-01-16 18:34:09,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:09,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:09,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146003199] [2020-01-16 18:34:09,253 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:09,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:09,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:09,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:09,253 INFO L87 Difference]: Start difference. First operand 54 states and 106 transitions. Second operand 8 states. [2020-01-16 18:34:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:09,318 INFO L93 Difference]: Finished difference Result 84 states and 153 transitions. [2020-01-16 18:34:09,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:09,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:09,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:09,318 INFO L225 Difference]: With dead ends: 84 [2020-01-16 18:34:09,318 INFO L226 Difference]: Without dead ends: 72 [2020-01-16 18:34:09,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-01-16 18:34:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-01-16 18:34:09,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2020-01-16 18:34:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-01-16 18:34:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 114 transitions. [2020-01-16 18:34:09,320 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 114 transitions. Word has length 19 [2020-01-16 18:34:09,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:09,320 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 114 transitions. [2020-01-16 18:34:09,320 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 114 transitions. [2020-01-16 18:34:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:09,321 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:09,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-01-16 18:34:09,321 INFO L426 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-01-16 18:34:09,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:09,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1781972386, now seen corresponding path program 696 times [2020-01-16 18:34:09,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:09,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777874315] [2020-01-16 18:34:09,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:09,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777874315] [2020-01-16 18:34:09,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:09,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:09,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529874817] [2020-01-16 18:34:09,514 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:09,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:09,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:09,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:09,514 INFO L87 Difference]: Start difference. First operand 58 states and 114 transitions. Second operand 8 states. [2020-01-16 18:34:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:09,573 INFO L93 Difference]: Finished difference Result 71 states and 132 transitions. [2020-01-16 18:34:09,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:09,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:09,574 INFO L225 Difference]: With dead ends: 71 [2020-01-16 18:34:09,574 INFO L226 Difference]: Without dead ends: 50 [2020-01-16 18:34: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-01-16 18:34:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-01-16 18:34:09,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-01-16 18:34:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-01-16 18:34:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 99 transitions. [2020-01-16 18:34:09,576 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 99 transitions. Word has length 19 [2020-01-16 18:34:09,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:09,576 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 99 transitions. [2020-01-16 18:34:09,576 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 99 transitions. [2020-01-16 18:34:09,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:09,577 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:09,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-01-16 18:34:09,577 INFO L426 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-01-16 18:34:09,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:09,577 INFO L82 PathProgramCache]: Analyzing trace with hash -821726946, now seen corresponding path program 697 times [2020-01-16 18:34:09,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:09,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994179384] [2020-01-16 18:34:09,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:09,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:09,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994179384] [2020-01-16 18:34:09,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:09,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:09,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725622003] [2020-01-16 18:34:09,786 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:09,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:09,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:09,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:09,786 INFO L87 Difference]: Start difference. First operand 50 states and 99 transitions. Second operand 8 states. [2020-01-16 18:34:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:09,855 INFO L93 Difference]: Finished difference Result 83 states and 136 transitions. [2020-01-16 18:34:09,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:09,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:09,855 INFO L225 Difference]: With dead ends: 83 [2020-01-16 18:34:09,855 INFO L226 Difference]: Without dead ends: 73 [2020-01-16 18:34:09,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:09,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-01-16 18:34:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2020-01-16 18:34:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-01-16 18:34:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 100 transitions. [2020-01-16 18:34:09,857 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 100 transitions. Word has length 19 [2020-01-16 18:34:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:09,857 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 100 transitions. [2020-01-16 18:34:09,857 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 100 transitions. [2020-01-16 18:34:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:09,857 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:09,858 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:09,858 INFO L426 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-01-16 18:34:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1061369284, now seen corresponding path program 698 times [2020-01-16 18:34:09,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:09,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350297880] [2020-01-16 18:34:09,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:10,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350297880] [2020-01-16 18:34:10,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:10,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:10,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167464130] [2020-01-16 18:34:10,076 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:10,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:10,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:10,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:10,076 INFO L87 Difference]: Start difference. First operand 51 states and 100 transitions. Second operand 8 states. [2020-01-16 18:34:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:10,125 INFO L93 Difference]: Finished difference Result 83 states and 135 transitions. [2020-01-16 18:34:10,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:10,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:10,126 INFO L225 Difference]: With dead ends: 83 [2020-01-16 18:34:10,126 INFO L226 Difference]: Without dead ends: 72 [2020-01-16 18:34: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-01-16 18:34:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-01-16 18:34:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2020-01-16 18:34:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-01-16 18:34:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 98 transitions. [2020-01-16 18:34:10,128 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 98 transitions. Word has length 19 [2020-01-16 18:34:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:10,128 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 98 transitions. [2020-01-16 18:34:10,128 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 98 transitions. [2020-01-16 18:34:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:10,129 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:10,129 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:10,130 INFO L426 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-01-16 18:34:10,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:10,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1566429444, now seen corresponding path program 699 times [2020-01-16 18:34:10,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:10,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613646817] [2020-01-16 18:34:10,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:10,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613646817] [2020-01-16 18:34:10,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:10,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:10,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65484990] [2020-01-16 18:34:10,340 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:10,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:10,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:10,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:10,341 INFO L87 Difference]: Start difference. First operand 50 states and 98 transitions. Second operand 8 states. [2020-01-16 18:34:10,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:10,405 INFO L93 Difference]: Finished difference Result 86 states and 143 transitions. [2020-01-16 18:34:10,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:10,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:10,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:10,405 INFO L225 Difference]: With dead ends: 86 [2020-01-16 18:34:10,406 INFO L226 Difference]: Without dead ends: 76 [2020-01-16 18:34:10,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-01-16 18:34:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-01-16 18:34:10,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2020-01-16 18:34:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-01-16 18:34:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 101 transitions. [2020-01-16 18:34:10,407 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 101 transitions. Word has length 19 [2020-01-16 18:34:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:10,408 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 101 transitions. [2020-01-16 18:34:10,408 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 101 transitions. [2020-01-16 18:34:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:10,408 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:10,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-01-16 18:34:10,408 INFO L426 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-01-16 18:34:10,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:10,409 INFO L82 PathProgramCache]: Analyzing trace with hash 144183864, now seen corresponding path program 700 times [2020-01-16 18:34:10,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:10,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238867555] [2020-01-16 18:34:10,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:10,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238867555] [2020-01-16 18:34:10,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:10,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:10,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670230307] [2020-01-16 18:34:10,615 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:10,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:10,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:10,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:10,616 INFO L87 Difference]: Start difference. First operand 52 states and 101 transitions. Second operand 8 states. [2020-01-16 18:34:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:10,681 INFO L93 Difference]: Finished difference Result 88 states and 146 transitions. [2020-01-16 18:34:10,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:10,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:10,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:10,682 INFO L225 Difference]: With dead ends: 88 [2020-01-16 18:34:10,682 INFO L226 Difference]: Without dead ends: 74 [2020-01-16 18:34:10,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-01-16 18:34:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2020-01-16 18:34:10,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-01-16 18:34:10,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 97 transitions. [2020-01-16 18:34:10,684 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 97 transitions. Word has length 19 [2020-01-16 18:34:10,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:10,684 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 97 transitions. [2020-01-16 18:34:10,684 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:10,684 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 97 transitions. [2020-01-16 18:34:10,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:10,685 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:10,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-01-16 18:34:10,685 INFO L426 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-01-16 18:34:10,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:10,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2134454664, now seen corresponding path program 701 times [2020-01-16 18:34:10,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:10,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474914596] [2020-01-16 18:34:10,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:10,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474914596] [2020-01-16 18:34:10,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:10,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:10,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796783552] [2020-01-16 18:34:10,902 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:10,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:10,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:10,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:10,903 INFO L87 Difference]: Start difference. First operand 50 states and 97 transitions. Second operand 8 states. [2020-01-16 18:34:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:10,944 INFO L93 Difference]: Finished difference Result 86 states and 142 transitions. [2020-01-16 18:34:10,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:10,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:10,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:10,945 INFO L225 Difference]: With dead ends: 86 [2020-01-16 18:34:10,945 INFO L226 Difference]: Without dead ends: 76 [2020-01-16 18:34:10,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-01-16 18:34:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-01-16 18:34:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2020-01-16 18:34:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-01-16 18:34:10,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 100 transitions. [2020-01-16 18:34:10,947 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 100 transitions. Word has length 19 [2020-01-16 18:34:10,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:10,947 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 100 transitions. [2020-01-16 18:34:10,948 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:10,948 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 100 transitions. [2020-01-16 18:34:10,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:10,948 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:10,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-01-16 18:34:10,948 INFO L426 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-01-16 18:34:10,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:10,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1305205978, now seen corresponding path program 702 times [2020-01-16 18:34:10,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:10,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845859200] [2020-01-16 18:34:10,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:11,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-01-16 18:34:11,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845859200] [2020-01-16 18:34:11,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:11,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:11,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534574905] [2020-01-16 18:34:11,156 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:11,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:11,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:11,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:11,157 INFO L87 Difference]: Start difference. First operand 52 states and 100 transitions. Second operand 8 states. [2020-01-16 18:34:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:11,222 INFO L93 Difference]: Finished difference Result 88 states and 145 transitions. [2020-01-16 18:34:11,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:11,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:11,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:11,223 INFO L225 Difference]: With dead ends: 88 [2020-01-16 18:34:11,223 INFO L226 Difference]: Without dead ends: 73 [2020-01-16 18:34:11,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-01-16 18:34:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-01-16 18:34:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 49. [2020-01-16 18:34:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-01-16 18:34:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 95 transitions. [2020-01-16 18:34:11,225 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 95 transitions. Word has length 19 [2020-01-16 18:34:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:11,225 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 95 transitions. [2020-01-16 18:34:11,225 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 95 transitions. [2020-01-16 18:34:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:11,225 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:11,225 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:11,225 INFO L426 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-01-16 18:34:11,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:11,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1872802496, now seen corresponding path program 703 times [2020-01-16 18:34:11,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:11,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541934553] [2020-01-16 18:34:11,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:11,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541934553] [2020-01-16 18:34:11,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:11,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:11,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547112047] [2020-01-16 18:34:11,431 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:11,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:11,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:11,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:11,431 INFO L87 Difference]: Start difference. First operand 49 states and 95 transitions. Second operand 8 states. [2020-01-16 18:34:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:11,493 INFO L93 Difference]: Finished difference Result 81 states and 130 transitions. [2020-01-16 18:34:11,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:11,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:11,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:11,493 INFO L225 Difference]: With dead ends: 81 [2020-01-16 18:34:11,493 INFO L226 Difference]: Without dead ends: 71 [2020-01-16 18:34:11,494 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:11,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-01-16 18:34:11,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2020-01-16 18:34:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-01-16 18:34:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 94 transitions. [2020-01-16 18:34:11,495 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 94 transitions. Word has length 19 [2020-01-16 18:34:11,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:11,495 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 94 transitions. [2020-01-16 18:34:11,495 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 94 transitions. [2020-01-16 18:34:11,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:11,496 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:11,496 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:11,496 INFO L426 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-01-16 18:34:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:11,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1633160158, now seen corresponding path program 704 times [2020-01-16 18:34:11,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:11,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313540787] [2020-01-16 18:34:11,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:11,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313540787] [2020-01-16 18:34:11,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:11,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:11,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474906660] [2020-01-16 18:34:11,709 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:11,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:11,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:11,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:11,709 INFO L87 Difference]: Start difference. First operand 49 states and 94 transitions. Second operand 8 states. [2020-01-16 18:34:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:11,753 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2020-01-16 18:34:11,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:11,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:11,753 INFO L225 Difference]: With dead ends: 81 [2020-01-16 18:34:11,754 INFO L226 Difference]: Without dead ends: 70 [2020-01-16 18:34:11,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:11,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-01-16 18:34:11,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2020-01-16 18:34:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-01-16 18:34:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 92 transitions. [2020-01-16 18:34:11,755 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 92 transitions. Word has length 19 [2020-01-16 18:34:11,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:11,756 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 92 transitions. [2020-01-16 18:34:11,756 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 92 transitions. [2020-01-16 18:34:11,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:11,756 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:11,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-01-16 18:34:11,756 INFO L426 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-01-16 18:34:11,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:11,757 INFO L82 PathProgramCache]: Analyzing trace with hash 799717116, now seen corresponding path program 705 times [2020-01-16 18:34:11,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:11,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535431081] [2020-01-16 18:34:11,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:11,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:11,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535431081] [2020-01-16 18:34:11,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:11,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:11,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970525603] [2020-01-16 18:34:11,959 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:11,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:11,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:11,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:11,959 INFO L87 Difference]: Start difference. First operand 48 states and 92 transitions. Second operand 8 states. [2020-01-16 18:34:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:12,022 INFO L93 Difference]: Finished difference Result 83 states and 136 transitions. [2020-01-16 18:34:12,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:12,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:12,023 INFO L225 Difference]: With dead ends: 83 [2020-01-16 18:34:12,023 INFO L226 Difference]: Without dead ends: 73 [2020-01-16 18:34:12,023 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-01-16 18:34:12,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 50. [2020-01-16 18:34:12,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-01-16 18:34:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 95 transitions. [2020-01-16 18:34:12,024 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 95 transitions. Word has length 19 [2020-01-16 18:34:12,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:12,025 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 95 transitions. [2020-01-16 18:34:12,025 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 95 transitions. [2020-01-16 18:34:12,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:12,025 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:12,025 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:12,025 INFO L426 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-01-16 18:34:12,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:12,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1754696120, now seen corresponding path program 706 times [2020-01-16 18:34:12,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:12,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835119679] [2020-01-16 18:34:12,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:12,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835119679] [2020-01-16 18:34:12,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:12,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:12,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909499447] [2020-01-16 18:34:12,225 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:12,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:12,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:12,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:12,225 INFO L87 Difference]: Start difference. First operand 50 states and 95 transitions. Second operand 8 states. [2020-01-16 18:34:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:12,288 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2020-01-16 18:34:12,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:12,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:12,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:12,288 INFO L225 Difference]: With dead ends: 77 [2020-01-16 18:34:12,289 INFO L226 Difference]: Without dead ends: 62 [2020-01-16 18:34:12,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:12,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-01-16 18:34:12,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2020-01-16 18:34:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-01-16 18:34:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 91 transitions. [2020-01-16 18:34:12,290 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 91 transitions. Word has length 19 [2020-01-16 18:34:12,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:12,291 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 91 transitions. [2020-01-16 18:34:12,291 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:12,291 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 91 transitions. [2020-01-16 18:34:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:12,291 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:12,291 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:12,291 INFO L426 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-01-16 18:34:12,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:12,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2123951560, now seen corresponding path program 707 times [2020-01-16 18:34:12,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:12,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734064226] [2020-01-16 18:34:12,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:12,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:12,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734064226] [2020-01-16 18:34:12,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:12,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:12,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037186302] [2020-01-16 18:34:12,498 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:12,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:12,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:12,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:12,498 INFO L87 Difference]: Start difference. First operand 48 states and 91 transitions. Second operand 8 states. [2020-01-16 18:34:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:12,539 INFO L93 Difference]: Finished difference Result 83 states and 135 transitions. [2020-01-16 18:34:12,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:12,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:12,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:12,539 INFO L225 Difference]: With dead ends: 83 [2020-01-16 18:34:12,539 INFO L226 Difference]: Without dead ends: 73 [2020-01-16 18:34:12,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-01-16 18:34:12,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-01-16 18:34:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 50. [2020-01-16 18:34:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-01-16 18:34:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 94 transitions. [2020-01-16 18:34:12,540 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 94 transitions. Word has length 19 [2020-01-16 18:34:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:12,541 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 94 transitions. [2020-01-16 18:34:12,541 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 94 transitions. [2020-01-16 18:34:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:12,541 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:12,541 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:12,541 INFO L426 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-01-16 18:34:12,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:12,541 INFO L82 PathProgramCache]: Analyzing trace with hash -634546564, now seen corresponding path program 708 times [2020-01-16 18:34:12,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:12,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98870620] [2020-01-16 18:34:12,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:12,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98870620] [2020-01-16 18:34:12,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:12,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:12,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326666402] [2020-01-16 18:34:12,740 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:12,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:12,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:12,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:12,741 INFO L87 Difference]: Start difference. First operand 50 states and 94 transitions. Second operand 8 states. [2020-01-16 18:34:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:12,801 INFO L93 Difference]: Finished difference Result 77 states and 131 transitions. [2020-01-16 18:34:12,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:12,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:12,802 INFO L225 Difference]: With dead ends: 77 [2020-01-16 18:34:12,802 INFO L226 Difference]: Without dead ends: 61 [2020-01-16 18:34:12,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-01-16 18:34:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-01-16 18:34:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2020-01-16 18:34:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-01-16 18:34:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 89 transitions. [2020-01-16 18:34:12,805 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 89 transitions. Word has length 19 [2020-01-16 18:34:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:12,805 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 89 transitions. [2020-01-16 18:34:12,805 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:12,805 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 89 transitions. [2020-01-16 18:34:12,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:12,805 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:12,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-01-16 18:34:12,806 INFO L426 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-01-16 18:34:12,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:12,806 INFO L82 PathProgramCache]: Analyzing trace with hash -472337856, now seen corresponding path program 709 times [2020-01-16 18:34:12,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:12,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268736245] [2020-01-16 18:34:12,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:13,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-01-16 18:34:13,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268736245] [2020-01-16 18:34:13,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:13,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:13,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241169905] [2020-01-16 18:34:13,018 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:13,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:13,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:13,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:13,019 INFO L87 Difference]: Start difference. First operand 47 states and 89 transitions. Second operand 8 states. [2020-01-16 18:34:13,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:13,081 INFO L93 Difference]: Finished difference Result 79 states and 126 transitions. [2020-01-16 18:34:13,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:13,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:13,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:13,082 INFO L225 Difference]: With dead ends: 79 [2020-01-16 18:34:13,082 INFO L226 Difference]: Without dead ends: 69 [2020-01-16 18:34:13,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:13,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-01-16 18:34:13,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2020-01-16 18:34:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-01-16 18:34:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 87 transitions. [2020-01-16 18:34:13,085 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 87 transitions. Word has length 19 [2020-01-16 18:34:13,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:13,085 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 87 transitions. [2020-01-16 18:34:13,085 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 87 transitions. [2020-01-16 18:34:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:13,086 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:13,086 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:13,086 INFO L426 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-01-16 18:34:13,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:13,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1238275452, now seen corresponding path program 710 times [2020-01-16 18:34:13,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:13,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748941062] [2020-01-16 18:34:13,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:13,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:13,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748941062] [2020-01-16 18:34:13,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:13,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:13,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167610599] [2020-01-16 18:34:13,291 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:13,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:13,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:13,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:13,292 INFO L87 Difference]: Start difference. First operand 47 states and 87 transitions. Second operand 8 states. [2020-01-16 18:34:13,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:13,352 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2020-01-16 18:34:13,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:13,352 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:13,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:13,353 INFO L225 Difference]: With dead ends: 81 [2020-01-16 18:34:13,353 INFO L226 Difference]: Without dead ends: 67 [2020-01-16 18:34:13,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:13,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-01-16 18:34:13,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2020-01-16 18:34:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-01-16 18:34:13,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 82 transitions. [2020-01-16 18:34:13,355 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 82 transitions. Word has length 19 [2020-01-16 18:34:13,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:13,355 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 82 transitions. [2020-01-16 18:34:13,355 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:13,355 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 82 transitions. [2020-01-16 18:34:13,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:13,355 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:13,355 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:13,356 INFO L426 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-01-16 18:34:13,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:13,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1872802496, now seen corresponding path program 711 times [2020-01-16 18:34:13,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:13,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050384916] [2020-01-16 18:34:13,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:13,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050384916] [2020-01-16 18:34:13,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:13,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:13,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656079944] [2020-01-16 18:34:13,555 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:13,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:13,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:13,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:13,555 INFO L87 Difference]: Start difference. First operand 45 states and 82 transitions. Second operand 8 states. [2020-01-16 18:34:13,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:13,616 INFO L93 Difference]: Finished difference Result 76 states and 118 transitions. [2020-01-16 18:34:13,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:13,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:13,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:13,617 INFO L225 Difference]: With dead ends: 76 [2020-01-16 18:34:13,617 INFO L226 Difference]: Without dead ends: 66 [2020-01-16 18:34:13,617 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:13,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-01-16 18:34:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2020-01-16 18:34:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-01-16 18:34:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 77 transitions. [2020-01-16 18:34:13,618 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 77 transitions. Word has length 19 [2020-01-16 18:34:13,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:13,619 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 77 transitions. [2020-01-16 18:34:13,619 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:13,619 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 77 transitions. [2020-01-16 18:34:13,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:13,619 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:13,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-01-16 18:34:13,619 INFO L426 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-01-16 18:34:13,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:13,619 INFO L82 PathProgramCache]: Analyzing trace with hash 143755162, now seen corresponding path program 712 times [2020-01-16 18:34:13,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:13,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483179445] [2020-01-16 18:34:13,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:13,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-01-16 18:34:13,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483179445] [2020-01-16 18:34:13,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:13,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:13,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715402064] [2020-01-16 18:34:13,817 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:13,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:13,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:13,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:13,817 INFO L87 Difference]: Start difference. First operand 43 states and 77 transitions. Second operand 8 states. [2020-01-16 18:34:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:13,879 INFO L93 Difference]: Finished difference Result 70 states and 114 transitions. [2020-01-16 18:34:13,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:13,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:13,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:13,880 INFO L225 Difference]: With dead ends: 70 [2020-01-16 18:34:13,880 INFO L226 Difference]: Without dead ends: 55 [2020-01-16 18:34:13,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-01-16 18:34:13,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-01-16 18:34:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2020-01-16 18:34:13,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-01-16 18:34:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. [2020-01-16 18:34:13,881 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 72 transitions. Word has length 19 [2020-01-16 18:34:13,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:13,881 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-01-16 18:34:13,882 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:13,882 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 72 transitions. [2020-01-16 18:34:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:13,882 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:13,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-01-16 18:34:13,882 INFO L426 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-01-16 18:34:13,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:13,883 INFO L82 PathProgramCache]: Analyzing trace with hash 777853504, now seen corresponding path program 713 times [2020-01-16 18:34:13,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:13,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90104081] [2020-01-16 18:34:13,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:14,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90104081] [2020-01-16 18:34:14,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:14,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:14,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321002882] [2020-01-16 18:34:14,087 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:14,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:14,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:14,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:14,087 INFO L87 Difference]: Start difference. First operand 41 states and 72 transitions. Second operand 8 states. [2020-01-16 18:34:14,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:14,148 INFO L93 Difference]: Finished difference Result 71 states and 119 transitions. [2020-01-16 18:34:14,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:14,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:14,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:14,149 INFO L225 Difference]: With dead ends: 71 [2020-01-16 18:34:14,149 INFO L226 Difference]: Without dead ends: 59 [2020-01-16 18:34:14,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-01-16 18:34:14,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2020-01-16 18:34:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-01-16 18:34:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 80 transitions. [2020-01-16 18:34:14,151 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 80 transitions. Word has length 19 [2020-01-16 18:34:14,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:14,151 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 80 transitions. [2020-01-16 18:34:14,151 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:14,151 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 80 transitions. [2020-01-16 18:34:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:14,151 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:14,151 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:14,151 INFO L426 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-01-16 18:34:14,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:14,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1633160158, now seen corresponding path program 714 times [2020-01-16 18:34:14,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:14,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852043122] [2020-01-16 18:34:14,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:14,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852043122] [2020-01-16 18:34:14,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:14,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:14,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745393747] [2020-01-16 18:34:14,352 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:14,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:14,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:14,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:14,352 INFO L87 Difference]: Start difference. First operand 45 states and 80 transitions. Second operand 8 states. [2020-01-16 18:34:14,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:14,415 INFO L93 Difference]: Finished difference Result 58 states and 98 transitions. [2020-01-16 18:34:14,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:14,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:14,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:14,415 INFO L225 Difference]: With dead ends: 58 [2020-01-16 18:34:14,415 INFO L226 Difference]: Without dead ends: 39 [2020-01-16 18:34:14,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:14,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-01-16 18:34:14,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-01-16 18:34:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-01-16 18:34:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 68 transitions. [2020-01-16 18:34:14,417 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 68 transitions. Word has length 19 [2020-01-16 18:34:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:14,417 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 68 transitions. [2020-01-16 18:34:14,417 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2020-01-16 18:34:14,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:14,418 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:14,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-01-16 18:34:14,418 INFO L426 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-01-16 18:34:14,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:14,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1654166366, now seen corresponding path program 715 times [2020-01-16 18:34:14,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:14,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166779921] [2020-01-16 18:34:14,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:14,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166779921] [2020-01-16 18:34:14,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:14,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:14,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604342544] [2020-01-16 18:34:14,627 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:14,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:14,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:14,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:14,628 INFO L87 Difference]: Start difference. First operand 39 states and 68 transitions. Second operand 8 states. [2020-01-16 18:34:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:14,666 INFO L93 Difference]: Finished difference Result 58 states and 88 transitions. [2020-01-16 18:34:14,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:14,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:14,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:14,667 INFO L225 Difference]: With dead ends: 58 [2020-01-16 18:34:14,667 INFO L226 Difference]: Without dead ends: 48 [2020-01-16 18:34:14,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-01-16 18:34:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-01-16 18:34:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2020-01-16 18:34:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-01-16 18:34:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2020-01-16 18:34:14,669 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 19 [2020-01-16 18:34:14,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:14,669 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2020-01-16 18:34:14,669 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2020-01-16 18:34:14,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:14,670 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:14,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-01-16 18:34:14,670 INFO L426 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-01-16 18:34:14,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:14,670 INFO L82 PathProgramCache]: Analyzing trace with hash 798859712, now seen corresponding path program 716 times [2020-01-16 18:34:14,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:14,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707690701] [2020-01-16 18:34:14,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:14,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707690701] [2020-01-16 18:34:14,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:14,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:14,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803201424] [2020-01-16 18:34:14,877 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:14,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:14,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:14,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:14,877 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand 8 states. [2020-01-16 18:34:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:14,935 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2020-01-16 18:34:14,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:14,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:14,936 INFO L225 Difference]: With dead ends: 60 [2020-01-16 18:34:14,936 INFO L226 Difference]: Without dead ends: 46 [2020-01-16 18:34:14,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-01-16 18:34:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-01-16 18:34:14,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2020-01-16 18:34:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-01-16 18:34:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 61 transitions. [2020-01-16 18:34:14,937 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 61 transitions. Word has length 19 [2020-01-16 18:34:14,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:14,938 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 61 transitions. [2020-01-16 18:34:14,938 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:14,938 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2020-01-16 18:34:14,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:14,938 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:14,938 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:14,938 INFO L426 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-01-16 18:34:14,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:14,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1029859972, now seen corresponding path program 717 times [2020-01-16 18:34:14,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:14,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37027805] [2020-01-16 18:34:14,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:15,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37027805] [2020-01-16 18:34:15,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:15,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:15,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145317015] [2020-01-16 18:34:15,144 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:15,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:15,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:15,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:15,144 INFO L87 Difference]: Start difference. First operand 37 states and 61 transitions. Second operand 8 states. [2020-01-16 18:34:15,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:15,183 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2020-01-16 18:34:15,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:15,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:15,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:15,184 INFO L225 Difference]: With dead ends: 54 [2020-01-16 18:34:15,184 INFO L226 Difference]: Without dead ends: 44 [2020-01-16 18:34:15,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-01-16 18:34:15,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-01-16 18:34:15,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2020-01-16 18:34:15,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-01-16 18:34:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2020-01-16 18:34:15,186 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 19 [2020-01-16 18:34:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:15,186 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2020-01-16 18:34:15,186 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:15,186 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2020-01-16 18:34:15,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:15,186 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:15,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-01-16 18:34:15,187 INFO L426 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-01-16 18:34:15,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:15,187 INFO L82 PathProgramCache]: Analyzing trace with hash 459545024, now seen corresponding path program 718 times [2020-01-16 18:34:15,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:15,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11931016] [2020-01-16 18:34:15,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:15,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11931016] [2020-01-16 18:34:15,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:15,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:15,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284551149] [2020-01-16 18:34:15,383 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:15,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:15,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:15,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:15,384 INFO L87 Difference]: Start difference. First operand 35 states and 56 transitions. Second operand 8 states. [2020-01-16 18:34:15,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:15,444 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2020-01-16 18:34:15,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:15,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:15,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:15,445 INFO L225 Difference]: With dead ends: 48 [2020-01-16 18:34:15,445 INFO L226 Difference]: Without dead ends: 33 [2020-01-16 18:34:15,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:15,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-01-16 18:34:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-01-16 18:34:15,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-01-16 18:34:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 51 transitions. [2020-01-16 18:34:15,446 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 51 transitions. Word has length 19 [2020-01-16 18:34:15,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:15,447 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 51 transitions. [2020-01-16 18:34:15,447 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 51 transitions. [2020-01-16 18:34:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:15,447 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:15,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-01-16 18:34:15,447 INFO L426 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-01-16 18:34:15,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:15,448 INFO L82 PathProgramCache]: Analyzing trace with hash -274225668, now seen corresponding path program 719 times [2020-01-16 18:34:15,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:15,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556016839] [2020-01-16 18:34:15,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:15,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556016839] [2020-01-16 18:34:15,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:15,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:15,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331736362] [2020-01-16 18:34:15,648 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:15,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:15,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:15,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:15,648 INFO L87 Difference]: Start difference. First operand 33 states and 51 transitions. Second operand 8 states. [2020-01-16 18:34:15,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:15,704 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2020-01-16 18:34:15,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:15,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:15,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:15,705 INFO L225 Difference]: With dead ends: 41 [2020-01-16 18:34:15,705 INFO L226 Difference]: Without dead ends: 29 [2020-01-16 18:34:15,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-01-16 18:34:15,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-01-16 18:34:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-01-16 18:34:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-01-16 18:34:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2020-01-16 18:34:15,706 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 19 [2020-01-16 18:34:15,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:15,707 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2020-01-16 18:34:15,707 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:15,707 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2020-01-16 18:34:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:34:15,707 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:34:15,707 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:34:15,707 INFO L426 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-01-16 18:34:15,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:34:15,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1029859972, now seen corresponding path program 720 times [2020-01-16 18:34:15,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:34:15,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311076223] [2020-01-16 18:34:15,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:34:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:34:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:34:15,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311076223] [2020-01-16 18:34:15,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:34:15,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:34:15,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612739904] [2020-01-16 18:34:15,908 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:34:15,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:34:15,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:34:15,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:34:15,908 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 8 states. [2020-01-16 18:34:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:34:15,958 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2020-01-16 18:34:15,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:34:15,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:34:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:34:15,959 INFO L225 Difference]: With dead ends: 28 [2020-01-16 18:34:15,959 INFO L226 Difference]: Without dead ends: 0 [2020-01-16 18:34:15,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:34:15,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-01-16 18:34:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-01-16 18:34:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-01-16 18:34:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-01-16 18:34:15,960 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-01-16 18:34:15,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:34:15,960 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-01-16 18:34:15,960 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:34:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-01-16 18:34:15,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-01-16 18:34:15,964 INFO L202 PluginConnector]: Adding new model example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.01 06:34:15 BasicIcfg [2020-01-16 18:34:15,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-01-16 18:34:15,966 INFO L168 Benchmark]: Toolchain (without parser) took 210680.24 ms. Allocated memory was 138.4 MB in the beginning and 274.2 MB in the end (delta: 135.8 MB). Free memory was 119.1 MB in the beginning and 203.4 MB in the end (delta: -84.3 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. [2020-01-16 18:34:15,967 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.47 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-01-16 18:34:15,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.60 ms. Allocated memory is still 138.4 MB. Free memory was 118.9 MB in the beginning and 117.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-01-16 18:34:15,968 INFO L168 Benchmark]: Boogie Preprocessor took 25.50 ms. Allocated memory is still 138.4 MB. Free memory was 117.3 MB in the beginning and 116.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2020-01-16 18:34:15,968 INFO L168 Benchmark]: RCFGBuilder took 277.81 ms. Allocated memory is still 138.4 MB. Free memory was 116.0 MB in the beginning and 104.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2020-01-16 18:34:15,969 INFO L168 Benchmark]: TraceAbstraction took 210331.44 ms. Allocated memory was 138.4 MB in the beginning and 274.2 MB in the end (delta: 135.8 MB). Free memory was 103.8 MB in the beginning and 203.4 MB in the end (delta: -99.6 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. [2020-01-16 18:34:15,970 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.47 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 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.60 ms. Allocated memory is still 138.4 MB. Free memory was 118.9 MB in the beginning and 117.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.50 ms. Allocated memory is still 138.4 MB. Free memory was 117.3 MB in the beginning and 116.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 277.81 ms. Allocated memory is still 138.4 MB. Free memory was 116.0 MB in the beginning and 104.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 210331.44 ms. Allocated memory was 138.4 MB in the beginning and 274.2 MB in the end (delta: 135.8 MB). Free memory was 103.8 MB in the beginning and 203.4 MB in the end (delta: -99.6 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.4s, 52 ProgramPointsBefore, 44 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: 210.1s, OverallIterations: 724, TraceHistogramMax: 1, AutomataDifference: 57.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, HoareTripleCheckerStatistics: 48598 SDtfs, 89022 SDslu, 114886 SDs, 0 SdLazy, 25831 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5772 GetRequests, 728 SyntacticMatches, 0 SemanticMatches, 5044 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2880 ImplicationChecksByTransitivity, 163.7s 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.8s AutomataMinimizationTime, 724 MinimizatonAttempts, 91280 StatesRemovedByMinimization, 714 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 143.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...