/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-VariableLbe.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-abd8500 [2020-01-16 18:59:03,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-01-16 18:59:03,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-01-16 18:59:03,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-01-16 18:59:03,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-01-16 18:59:03,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-01-16 18:59:03,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-01-16 18:59:03,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-01-16 18:59:03,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-01-16 18:59:03,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-01-16 18:59:03,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-01-16 18:59:03,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-01-16 18:59:03,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-01-16 18:59:03,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-01-16 18:59:03,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-01-16 18:59:03,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-01-16 18:59:03,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-01-16 18:59:03,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-01-16 18:59:03,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-01-16 18:59:03,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-01-16 18:59:03,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-01-16 18:59:03,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-01-16 18:59:03,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-01-16 18:59:03,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-01-16 18:59:03,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-01-16 18:59:03,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-01-16 18:59:03,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-01-16 18:59:03,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-01-16 18:59:03,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-01-16 18:59:03,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-01-16 18:59:03,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-01-16 18:59:03,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-01-16 18:59:03,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-01-16 18:59:03,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-01-16 18:59:03,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-01-16 18:59:03,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-01-16 18:59:03,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-01-16 18:59:03,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-01-16 18:59:03,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-01-16 18:59:03,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-01-16 18:59:03,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-01-16 18:59:03,368 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-VariableLbe.epf [2020-01-16 18:59:03,382 INFO L113 SettingsManager]: Loading preferences was successful [2020-01-16 18:59:03,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-01-16 18:59:03,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-01-16 18:59:03,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-01-16 18:59:03,384 INFO L138 SettingsManager]: * Use SBE=true [2020-01-16 18:59:03,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-01-16 18:59:03,385 INFO L138 SettingsManager]: * sizeof long=4 [2020-01-16 18:59:03,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-01-16 18:59:03,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-01-16 18:59:03,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-01-16 18:59:03,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-01-16 18:59:03,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-01-16 18:59:03,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-01-16 18:59:03,386 INFO L138 SettingsManager]: * sizeof long double=12 [2020-01-16 18:59:03,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-01-16 18:59:03,386 INFO L138 SettingsManager]: * Use constant arrays=true [2020-01-16 18:59:03,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-01-16 18:59:03,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-01-16 18:59:03,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-01-16 18:59:03,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-01-16 18:59:03,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-01-16 18:59:03,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-01-16 18:59:03,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-01-16 18:59:03,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-01-16 18:59:03,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-01-16 18:59:03,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-01-16 18:59:03,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-01-16 18:59:03,388 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-01-16 18:59:03,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-01-16 18:59:03,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-01-16 18:59:03,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-01-16 18:59:03,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-01-16 18:59:03,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-01-16 18:59:03,699 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-01-16 18:59:03,700 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-01-16 18:59:03,701 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:59:03,702 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_6.bpl' [2020-01-16 18:59:03,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-01-16 18:59:03,742 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-01-16 18:59:03,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-01-16 18:59:03,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-01-16 18:59:03,743 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-01-16 18:59:03,759 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:59:03" (1/1) ... [2020-01-16 18:59:03,768 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:59:03" (1/1) ... [2020-01-16 18:59:03,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-01-16 18:59:03,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-01-16 18:59:03,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-01-16 18:59:03,778 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-01-16 18:59:03,788 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:59:03" (1/1) ... [2020-01-16 18:59:03,788 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:59:03" (1/1) ... [2020-01-16 18:59:03,789 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:59:03" (1/1) ... [2020-01-16 18:59:03,789 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:59:03" (1/1) ... [2020-01-16 18:59:03,793 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:59:03" (1/1) ... [2020-01-16 18:59:03,794 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:59:03" (1/1) ... [2020-01-16 18:59:03,794 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:59:03" (1/1) ... [2020-01-16 18:59:03,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-01-16 18:59:03,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-01-16 18:59:03,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-01-16 18:59:03,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-01-16 18:59:03,797 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:59:03" (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:59:03,859 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-01-16 18:59:03,860 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-01-16 18:59:03,860 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-01-16 18:59:03,860 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-01-16 18:59:03,860 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-01-16 18:59:03,861 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-01-16 18:59:03,861 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-01-16 18:59:03,861 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-01-16 18:59:03,861 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-01-16 18:59:03,861 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-01-16 18:59:03,862 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-01-16 18:59:03,862 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-01-16 18:59:03,862 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-01-16 18:59:03,862 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-01-16 18:59:03,862 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-01-16 18:59:03,863 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-01-16 18:59:03,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-01-16 18:59:03,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-01-16 18:59:03,863 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-01-16 18:59:03,863 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-01-16 18:59:03,864 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-01-16 18:59:03,865 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:59:04,090 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-01-16 18:59:04,090 INFO L287 CfgBuilder]: Removed 0 assume(true) statements. [2020-01-16 18:59:04,092 INFO L202 PluginConnector]: Adding new model example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.01 06:59:04 BoogieIcfgContainer [2020-01-16 18:59:04,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-01-16 18:59:04,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-01-16 18:59:04,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-01-16 18:59:04,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-01-16 18:59:04,097 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:59:03" (1/2) ... [2020-01-16 18:59:04,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661bb244 and model type example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.01 06:59:04, skipping insertion in model container [2020-01-16 18:59:04,098 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:59:04" (2/2) ... [2020-01-16 18:59:04,100 INFO L109 eAbstractionObserver]: Analyzing ICFG example_6.bpl [2020-01-16 18:59:04,121 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-01-16 18:59:04,121 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-01-16 18:59:04,130 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-01-16 18:59:04,131 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-01-16 18:59:04,269 INFO L250 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-01-16 18:59:04,288 INFO L374 AbstractCegarLoop]: Interprodecural is true [2020-01-16 18:59:04,288 INFO L375 AbstractCegarLoop]: Hoare is true [2020-01-16 18:59:04,289 INFO L376 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-01-16 18:59:04,289 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-01-16 18:59:04,289 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-01-16 18:59:04,289 INFO L379 AbstractCegarLoop]: Difference is false [2020-01-16 18:59:04,289 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-01-16 18:59:04,289 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-01-16 18:59:04,303 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 63 transitions [2020-01-16 18:59:04,305 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 52 places, 63 transitions [2020-01-16 18:59:04,438 INFO L129 PetriNetUnfolder]: 129/213 cut-off events. [2020-01-16 18:59:04,438 INFO L130 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2020-01-16 18:59:04,456 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:59:04,461 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 52 places, 63 transitions [2020-01-16 18:59:04,515 INFO L129 PetriNetUnfolder]: 129/213 cut-off events. [2020-01-16 18:59:04,516 INFO L130 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2020-01-16 18:59:04,520 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:59:04,528 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 780 [2020-01-16 18:59:04,530 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-01-16 18:59:04,652 INFO L206 etLargeBlockEncoding]: Checked pairs total: 225 [2020-01-16 18:59:04,653 INFO L214 etLargeBlockEncoding]: Total number of compositions: 7 [2020-01-16 18:59:04,657 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 56 transitions [2020-01-16 18:59:04,730 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 794 states. [2020-01-16 18:59:04,732 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states. [2020-01-16 18:59:04,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:04,753 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:04,754 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:04,755 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:59:04,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:04,762 INFO L82 PathProgramCache]: Analyzing trace with hash -773222054, now seen corresponding path program 1 times [2020-01-16 18:59:04,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:04,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448780198] [2020-01-16 18:59:04,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:04,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:59:04,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448780198] [2020-01-16 18:59:04,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:04,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:59:04,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583703381] [2020-01-16 18:59:04,916 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:59:04,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:04,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:59:04,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:59:04,933 INFO L87 Difference]: Start difference. First operand 794 states. Second operand 3 states. [2020-01-16 18:59:04,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:04,998 INFO L93 Difference]: Finished difference Result 602 states and 2198 transitions. [2020-01-16 18:59:04,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:59:04,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-01-16 18:59:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:05,026 INFO L225 Difference]: With dead ends: 602 [2020-01-16 18:59:05,026 INFO L226 Difference]: Without dead ends: 601 [2020-01-16 18:59:05,027 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:59:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2020-01-16 18:59:05,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2020-01-16 18:59:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2020-01-16 18:59:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 2197 transitions. [2020-01-16 18:59:05,128 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 2197 transitions. Word has length 19 [2020-01-16 18:59:05,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:05,129 INFO L478 AbstractCegarLoop]: Abstraction has 601 states and 2197 transitions. [2020-01-16 18:59:05,129 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:59:05,129 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 2197 transitions. [2020-01-16 18:59:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:05,133 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:05,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:59:05,133 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:59:05,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:05,134 INFO L82 PathProgramCache]: Analyzing trace with hash 969558490, now seen corresponding path program 1 times [2020-01-16 18:59:05,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:05,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077769436] [2020-01-16 18:59:05,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:05,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077769436] [2020-01-16 18:59:05,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:05,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:59:05,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032470461] [2020-01-16 18:59:05,167 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:59:05,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:05,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:59:05,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:59:05,168 INFO L87 Difference]: Start difference. First operand 601 states and 2197 transitions. Second operand 3 states. [2020-01-16 18:59:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:05,195 INFO L93 Difference]: Finished difference Result 417 states and 1445 transitions. [2020-01-16 18:59:05,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:59:05,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-01-16 18:59:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:05,199 INFO L225 Difference]: With dead ends: 417 [2020-01-16 18:59:05,199 INFO L226 Difference]: Without dead ends: 417 [2020-01-16 18:59:05,200 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:59:05,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-01-16 18:59:05,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2020-01-16 18:59:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-01-16 18:59:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1445 transitions. [2020-01-16 18:59:05,227 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1445 transitions. Word has length 19 [2020-01-16 18:59:05,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:05,227 INFO L478 AbstractCegarLoop]: Abstraction has 417 states and 1445 transitions. [2020-01-16 18:59:05,227 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:59:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1445 transitions. [2020-01-16 18:59:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:05,229 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:05,229 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:05,230 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:59:05,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:05,230 INFO L82 PathProgramCache]: Analyzing trace with hash 160210872, now seen corresponding path program 1 times [2020-01-16 18:59:05,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:05,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061211105] [2020-01-16 18:59:05,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:05,714 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2020-01-16 18:59:05,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:05,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061211105] [2020-01-16 18:59:05,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:05,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:05,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474204129] [2020-01-16 18:59:05,811 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:05,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:05,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:05,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:05,815 INFO L87 Difference]: Start difference. First operand 417 states and 1445 transitions. Second operand 8 states. [2020-01-16 18:59:06,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:06,050 INFO L93 Difference]: Finished difference Result 861 states and 2672 transitions. [2020-01-16 18:59:06,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:06,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:06,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:06,059 INFO L225 Difference]: With dead ends: 861 [2020-01-16 18:59:06,060 INFO L226 Difference]: Without dead ends: 823 [2020-01-16 18:59:06,060 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:59:06,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2020-01-16 18:59:06,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 447. [2020-01-16 18:59:06,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2020-01-16 18:59:06,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1541 transitions. [2020-01-16 18:59:06,094 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1541 transitions. Word has length 19 [2020-01-16 18:59:06,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:06,094 INFO L478 AbstractCegarLoop]: Abstraction has 447 states and 1541 transitions. [2020-01-16 18:59:06,095 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:06,095 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1541 transitions. [2020-01-16 18:59:06,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:06,097 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:06,097 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:06,098 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:59:06,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:06,098 INFO L82 PathProgramCache]: Analyzing trace with hash 534862058, now seen corresponding path program 2 times [2020-01-16 18:59:06,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:06,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831506328] [2020-01-16 18:59:06,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:06,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:06,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831506328] [2020-01-16 18:59:06,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:06,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:06,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929101361] [2020-01-16 18:59:06,475 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:06,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:06,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:06,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:06,476 INFO L87 Difference]: Start difference. First operand 447 states and 1541 transitions. Second operand 8 states. [2020-01-16 18:59:06,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:06,600 INFO L93 Difference]: Finished difference Result 871 states and 2699 transitions. [2020-01-16 18:59:06,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:06,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:06,607 INFO L225 Difference]: With dead ends: 871 [2020-01-16 18:59:06,607 INFO L226 Difference]: Without dead ends: 812 [2020-01-16 18:59:06,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-01-16 18:59:06,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 436. [2020-01-16 18:59:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-01-16 18:59:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1507 transitions. [2020-01-16 18:59:06,635 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1507 transitions. Word has length 19 [2020-01-16 18:59:06,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:06,636 INFO L478 AbstractCegarLoop]: Abstraction has 436 states and 1507 transitions. [2020-01-16 18:59:06,636 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1507 transitions. [2020-01-16 18:59:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:06,638 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:06,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:59:06,638 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:59:06,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:06,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1341600626, now seen corresponding path program 3 times [2020-01-16 18:59:06,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:06,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861046422] [2020-01-16 18:59:06,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:06,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:59:06,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861046422] [2020-01-16 18:59:06,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:06,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:06,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871250956] [2020-01-16 18:59:06,999 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:06,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:06,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:06,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:07,000 INFO L87 Difference]: Start difference. First operand 436 states and 1507 transitions. Second operand 8 states. [2020-01-16 18:59:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:07,102 INFO L93 Difference]: Finished difference Result 855 states and 2646 transitions. [2020-01-16 18:59:07,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:07,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:07,110 INFO L225 Difference]: With dead ends: 855 [2020-01-16 18:59:07,110 INFO L226 Difference]: Without dead ends: 817 [2020-01-16 18:59:07,111 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:59:07,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2020-01-16 18:59:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 445. [2020-01-16 18:59:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-01-16 18:59:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1528 transitions. [2020-01-16 18:59:07,137 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1528 transitions. Word has length 19 [2020-01-16 18:59:07,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:07,138 INFO L478 AbstractCegarLoop]: Abstraction has 445 states and 1528 transitions. [2020-01-16 18:59:07,138 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:07,139 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1528 transitions. [2020-01-16 18:59:07,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:07,140 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:07,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:07,141 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:59:07,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:07,141 INFO L82 PathProgramCache]: Analyzing trace with hash 365395876, now seen corresponding path program 4 times [2020-01-16 18:59:07,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:07,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404167299] [2020-01-16 18:59:07,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:07,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:59:07,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404167299] [2020-01-16 18:59:07,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:07,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:07,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338247771] [2020-01-16 18:59:07,467 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:07,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:07,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:07,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:07,468 INFO L87 Difference]: Start difference. First operand 445 states and 1528 transitions. Second operand 8 states. [2020-01-16 18:59:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:07,564 INFO L93 Difference]: Finished difference Result 861 states and 2662 transitions. [2020-01-16 18:59:07,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:07,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:07,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:07,571 INFO L225 Difference]: With dead ends: 861 [2020-01-16 18:59:07,571 INFO L226 Difference]: Without dead ends: 808 [2020-01-16 18:59:07,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2020-01-16 18:59:07,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 436. [2020-01-16 18:59:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-01-16 18:59:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1498 transitions. [2020-01-16 18:59:07,595 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1498 transitions. Word has length 19 [2020-01-16 18:59:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:07,596 INFO L478 AbstractCegarLoop]: Abstraction has 436 states and 1498 transitions. [2020-01-16 18:59:07,596 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1498 transitions. [2020-01-16 18:59:07,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:07,598 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:07,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:59:07,598 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:59:07,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:07,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1763599130, now seen corresponding path program 5 times [2020-01-16 18:59:07,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:07,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394820406] [2020-01-16 18:59:07,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:08,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:59:08,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394820406] [2020-01-16 18:59:08,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:08,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:08,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160342587] [2020-01-16 18:59:08,048 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:08,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:08,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:08,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:08,050 INFO L87 Difference]: Start difference. First operand 436 states and 1498 transitions. Second operand 8 states. [2020-01-16 18:59:08,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:08,172 INFO L93 Difference]: Finished difference Result 882 states and 2745 transitions. [2020-01-16 18:59:08,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:08,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:08,181 INFO L225 Difference]: With dead ends: 882 [2020-01-16 18:59:08,181 INFO L226 Difference]: Without dead ends: 834 [2020-01-16 18:59:08,182 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:59:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2020-01-16 18:59:08,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 452. [2020-01-16 18:59:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-01-16 18:59:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1546 transitions. [2020-01-16 18:59:08,208 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1546 transitions. Word has length 19 [2020-01-16 18:59:08,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:08,209 INFO L478 AbstractCegarLoop]: Abstraction has 452 states and 1546 transitions. [2020-01-16 18:59:08,209 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1546 transitions. [2020-01-16 18:59:08,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:08,215 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:08,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:59:08,215 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:59:08,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:08,216 INFO L82 PathProgramCache]: Analyzing trace with hash -905319246, now seen corresponding path program 6 times [2020-01-16 18:59:08,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:08,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102285317] [2020-01-16 18:59:08,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:08,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:59:08,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102285317] [2020-01-16 18:59:08,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:08,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:08,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103868370] [2020-01-16 18:59:08,492 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:08,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:08,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:08,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:08,493 INFO L87 Difference]: Start difference. First operand 452 states and 1546 transitions. Second operand 8 states. [2020-01-16 18:59:08,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:08,581 INFO L93 Difference]: Finished difference Result 878 states and 2717 transitions. [2020-01-16 18:59:08,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:08,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:08,595 INFO L225 Difference]: With dead ends: 878 [2020-01-16 18:59:08,595 INFO L226 Difference]: Without dead ends: 807 [2020-01-16 18:59:08,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:08,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2020-01-16 18:59:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 425. [2020-01-16 18:59:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-01-16 18:59:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1468 transitions. [2020-01-16 18:59:08,617 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1468 transitions. Word has length 19 [2020-01-16 18:59:08,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:08,618 INFO L478 AbstractCegarLoop]: Abstraction has 425 states and 1468 transitions. [2020-01-16 18:59:08,618 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:08,618 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1468 transitions. [2020-01-16 18:59:08,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:08,620 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:08,621 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:08,621 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:59:08,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:08,621 INFO L82 PathProgramCache]: Analyzing trace with hash 903297962, now seen corresponding path program 7 times [2020-01-16 18:59:08,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:08,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62855060] [2020-01-16 18:59:08,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:08,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62855060] [2020-01-16 18:59:08,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:08,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:08,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170338942] [2020-01-16 18:59:08,927 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:08,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:08,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:08,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:08,928 INFO L87 Difference]: Start difference. First operand 425 states and 1468 transitions. Second operand 8 states. [2020-01-16 18:59:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:09,000 INFO L93 Difference]: Finished difference Result 838 states and 2569 transitions. [2020-01-16 18:59:09,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:09,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:09,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:09,006 INFO L225 Difference]: With dead ends: 838 [2020-01-16 18:59:09,007 INFO L226 Difference]: Without dead ends: 800 [2020-01-16 18:59:09,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:09,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2020-01-16 18:59:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 442. [2020-01-16 18:59:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-01-16 18:59:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1513 transitions. [2020-01-16 18:59:09,027 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1513 transitions. Word has length 19 [2020-01-16 18:59:09,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:09,027 INFO L478 AbstractCegarLoop]: Abstraction has 442 states and 1513 transitions. [2020-01-16 18:59:09,027 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1513 transitions. [2020-01-16 18:59:09,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:09,029 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:09,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:59:09,030 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:59:09,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:09,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1277949148, now seen corresponding path program 8 times [2020-01-16 18:59:09,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:09,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288950248] [2020-01-16 18:59:09,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:09,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288950248] [2020-01-16 18:59:09,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:09,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:09,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284768095] [2020-01-16 18:59:09,271 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:09,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:09,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:09,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:09,272 INFO L87 Difference]: Start difference. First operand 442 states and 1513 transitions. Second operand 8 states. [2020-01-16 18:59:09,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:09,367 INFO L93 Difference]: Finished difference Result 848 states and 2596 transitions. [2020-01-16 18:59:09,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:09,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:09,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:09,373 INFO L225 Difference]: With dead ends: 848 [2020-01-16 18:59:09,373 INFO L226 Difference]: Without dead ends: 789 [2020-01-16 18:59:09,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:09,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2020-01-16 18:59:09,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 431. [2020-01-16 18:59:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-01-16 18:59:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1483 transitions. [2020-01-16 18:59:09,395 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1483 transitions. Word has length 19 [2020-01-16 18:59:09,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:09,396 INFO L478 AbstractCegarLoop]: Abstraction has 431 states and 1483 transitions. [2020-01-16 18:59:09,396 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1483 transitions. [2020-01-16 18:59:09,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:09,398 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:09,398 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:09,399 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:59:09,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:09,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1759091492, now seen corresponding path program 9 times [2020-01-16 18:59:09,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:09,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213948494] [2020-01-16 18:59:09,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:09,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213948494] [2020-01-16 18:59:09,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:09,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:09,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287827731] [2020-01-16 18:59:09,660 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:09,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:09,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:09,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:09,661 INFO L87 Difference]: Start difference. First operand 431 states and 1483 transitions. Second operand 8 states. [2020-01-16 18:59:09,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:09,723 INFO L93 Difference]: Finished difference Result 821 states and 2505 transitions. [2020-01-16 18:59:09,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:09,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:09,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:09,729 INFO L225 Difference]: With dead ends: 821 [2020-01-16 18:59:09,729 INFO L226 Difference]: Without dead ends: 783 [2020-01-16 18:59:09,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2020-01-16 18:59:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 436. [2020-01-16 18:59:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-01-16 18:59:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1492 transitions. [2020-01-16 18:59:09,749 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1492 transitions. Word has length 19 [2020-01-16 18:59:09,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:09,749 INFO L478 AbstractCegarLoop]: Abstraction has 436 states and 1492 transitions. [2020-01-16 18:59:09,750 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:09,750 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1492 transitions. [2020-01-16 18:59:09,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:09,753 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:09,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:59:09,753 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:59:09,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:09,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1008029398, now seen corresponding path program 10 times [2020-01-16 18:59:09,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:09,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451790449] [2020-01-16 18:59:09,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:10,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451790449] [2020-01-16 18:59:10,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:10,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:10,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047458067] [2020-01-16 18:59:10,028 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:10,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:10,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:10,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:10,028 INFO L87 Difference]: Start difference. First operand 436 states and 1492 transitions. Second operand 8 states. [2020-01-16 18:59:10,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:10,112 INFO L93 Difference]: Finished difference Result 820 states and 2499 transitions. [2020-01-16 18:59:10,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:10,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:10,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:10,117 INFO L225 Difference]: With dead ends: 820 [2020-01-16 18:59:10,117 INFO L226 Difference]: Without dead ends: 778 [2020-01-16 18:59:10,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:10,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2020-01-16 18:59:10,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 431. [2020-01-16 18:59:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-01-16 18:59:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1478 transitions. [2020-01-16 18:59:10,135 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1478 transitions. Word has length 19 [2020-01-16 18:59:10,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:10,135 INFO L478 AbstractCegarLoop]: Abstraction has 431 states and 1478 transitions. [2020-01-16 18:59:10,135 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1478 transitions. [2020-01-16 18:59:10,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:10,137 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:10,137 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:10,137 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:59:10,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:10,137 INFO L82 PathProgramCache]: Analyzing trace with hash -262091078, now seen corresponding path program 11 times [2020-01-16 18:59:10,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:10,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586043428] [2020-01-16 18:59:10,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:10,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:59:10,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586043428] [2020-01-16 18:59:10,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:10,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:10,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204352111] [2020-01-16 18:59:10,362 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:10,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:10,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:10,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:10,363 INFO L87 Difference]: Start difference. First operand 431 states and 1478 transitions. Second operand 8 states. [2020-01-16 18:59:10,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:10,450 INFO L93 Difference]: Finished difference Result 845 states and 2591 transitions. [2020-01-16 18:59:10,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:10,450 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:10,455 INFO L225 Difference]: With dead ends: 845 [2020-01-16 18:59:10,456 INFO L226 Difference]: Without dead ends: 797 [2020-01-16 18:59:10,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2020-01-16 18:59:10,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 440. [2020-01-16 18:59:10,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-01-16 18:59:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1500 transitions. [2020-01-16 18:59:10,474 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1500 transitions. Word has length 19 [2020-01-16 18:59:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:10,475 INFO L478 AbstractCegarLoop]: Abstraction has 440 states and 1500 transitions. [2020-01-16 18:59:10,475 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1500 transitions. [2020-01-16 18:59:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:10,476 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:10,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:59:10,477 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:59:10,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:10,477 INFO L82 PathProgramCache]: Analyzing trace with hash -262685724, now seen corresponding path program 12 times [2020-01-16 18:59:10,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:10,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75818226] [2020-01-16 18:59:10,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:10,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:59:10,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75818226] [2020-01-16 18:59:10,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:10,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:10,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446616086] [2020-01-16 18:59:10,717 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:10,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:10,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:10,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:10,718 INFO L87 Difference]: Start difference. First operand 440 states and 1500 transitions. Second operand 8 states. [2020-01-16 18:59:10,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:10,802 INFO L93 Difference]: Finished difference Result 834 states and 2544 transitions. [2020-01-16 18:59:10,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:10,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:10,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:10,809 INFO L225 Difference]: With dead ends: 834 [2020-01-16 18:59:10,809 INFO L226 Difference]: Without dead ends: 782 [2020-01-16 18:59:10,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:10,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2020-01-16 18:59:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 425. [2020-01-16 18:59:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-01-16 18:59:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1462 transitions. [2020-01-16 18:59:10,826 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1462 transitions. Word has length 19 [2020-01-16 18:59:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:10,826 INFO L478 AbstractCegarLoop]: Abstraction has 425 states and 1462 transitions. [2020-01-16 18:59:10,827 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:10,827 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1462 transitions. [2020-01-16 18:59:10,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:10,828 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:10,828 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:10,828 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:59:10,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:10,829 INFO L82 PathProgramCache]: Analyzing trace with hash -272531798, now seen corresponding path program 13 times [2020-01-16 18:59:10,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:10,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855516169] [2020-01-16 18:59:10,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:11,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:11,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855516169] [2020-01-16 18:59:11,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:11,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:11,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270862799] [2020-01-16 18:59:11,059 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:11,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:11,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:11,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:11,059 INFO L87 Difference]: Start difference. First operand 425 states and 1462 transitions. Second operand 8 states. [2020-01-16 18:59:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:11,141 INFO L93 Difference]: Finished difference Result 813 states and 2484 transitions. [2020-01-16 18:59:11,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:11,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:11,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:11,146 INFO L225 Difference]: With dead ends: 813 [2020-01-16 18:59:11,147 INFO L226 Difference]: Without dead ends: 775 [2020-01-16 18:59:11,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:59:11,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2020-01-16 18:59:11,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 435. [2020-01-16 18:59:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-01-16 18:59:11,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1490 transitions. [2020-01-16 18:59:11,164 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1490 transitions. Word has length 19 [2020-01-16 18:59:11,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:11,164 INFO L478 AbstractCegarLoop]: Abstraction has 435 states and 1490 transitions. [2020-01-16 18:59:11,164 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1490 transitions. [2020-01-16 18:59:11,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:11,166 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:11,166 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:11,166 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:59:11,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:11,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1023593892, now seen corresponding path program 14 times [2020-01-16 18:59:11,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:11,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920255304] [2020-01-16 18:59:11,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:11,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920255304] [2020-01-16 18:59:11,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:11,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:11,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823372524] [2020-01-16 18:59:11,391 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:11,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:11,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:11,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:11,392 INFO L87 Difference]: Start difference. First operand 435 states and 1490 transitions. Second operand 8 states. [2020-01-16 18:59:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:11,484 INFO L93 Difference]: Finished difference Result 812 states and 2478 transitions. [2020-01-16 18:59:11,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:11,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:11,490 INFO L225 Difference]: With dead ends: 812 [2020-01-16 18:59:11,490 INFO L226 Difference]: Without dead ends: 770 [2020-01-16 18:59:11,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:11,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2020-01-16 18:59:11,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 430. [2020-01-16 18:59:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-01-16 18:59:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1476 transitions. [2020-01-16 18:59:11,508 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1476 transitions. Word has length 19 [2020-01-16 18:59:11,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:11,508 INFO L478 AbstractCegarLoop]: Abstraction has 430 states and 1476 transitions. [2020-01-16 18:59:11,509 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:11,509 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1476 transitions. [2020-01-16 18:59:11,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:11,510 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:11,511 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:11,511 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:59:11,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:11,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1872969652, now seen corresponding path program 15 times [2020-01-16 18:59:11,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:11,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438997890] [2020-01-16 18:59:11,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:11,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:59:11,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438997890] [2020-01-16 18:59:11,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:11,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:11,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189382079] [2020-01-16 18:59:11,796 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:11,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:11,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:11,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:11,797 INFO L87 Difference]: Start difference. First operand 430 states and 1476 transitions. Second operand 8 states. [2020-01-16 18:59:11,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:11,871 INFO L93 Difference]: Finished difference Result 824 states and 2521 transitions. [2020-01-16 18:59:11,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:11,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:11,878 INFO L225 Difference]: With dead ends: 824 [2020-01-16 18:59:11,878 INFO L226 Difference]: Without dead ends: 786 [2020-01-16 18:59:11,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:59:11,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2020-01-16 18:59:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 439. [2020-01-16 18:59:11,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-01-16 18:59:11,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1497 transitions. [2020-01-16 18:59:11,895 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1497 transitions. Word has length 19 [2020-01-16 18:59:11,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:11,895 INFO L478 AbstractCegarLoop]: Abstraction has 439 states and 1497 transitions. [2020-01-16 18:59:11,895 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1497 transitions. [2020-01-16 18:59:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:11,897 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:11,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:59:11,897 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:59:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:11,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1445792894, now seen corresponding path program 16 times [2020-01-16 18:59:11,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:11,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747169846] [2020-01-16 18:59:11,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:12,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:59:12,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747169846] [2020-01-16 18:59:12,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:12,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:12,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466255860] [2020-01-16 18:59:12,137 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:12,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:12,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:12,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:12,138 INFO L87 Difference]: Start difference. First operand 439 states and 1497 transitions. Second operand 8 states. [2020-01-16 18:59:12,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:12,243 INFO L93 Difference]: Finished difference Result 830 states and 2537 transitions. [2020-01-16 18:59:12,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:12,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:12,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:12,247 INFO L225 Difference]: With dead ends: 830 [2020-01-16 18:59:12,247 INFO L226 Difference]: Without dead ends: 777 [2020-01-16 18:59:12,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:59:12,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2020-01-16 18:59:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 430. [2020-01-16 18:59:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-01-16 18:59:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1471 transitions. [2020-01-16 18:59:12,262 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1471 transitions. Word has length 19 [2020-01-16 18:59:12,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:12,263 INFO L478 AbstractCegarLoop]: Abstraction has 430 states and 1471 transitions. [2020-01-16 18:59:12,263 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1471 transitions. [2020-01-16 18:59:12,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:12,264 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:12,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:59:12,265 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:59:12,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:12,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1221170070, now seen corresponding path program 17 times [2020-01-16 18:59:12,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:12,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162581444] [2020-01-16 18:59:12,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:12,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162581444] [2020-01-16 18:59:12,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:12,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:12,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498368811] [2020-01-16 18:59:12,497 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:12,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:12,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:12,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:12,498 INFO L87 Difference]: Start difference. First operand 430 states and 1471 transitions. Second operand 8 states. [2020-01-16 18:59:12,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:12,607 INFO L93 Difference]: Finished difference Result 821 states and 2512 transitions. [2020-01-16 18:59:12,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:12,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:12,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:12,613 INFO L225 Difference]: With dead ends: 821 [2020-01-16 18:59:12,614 INFO L226 Difference]: Without dead ends: 784 [2020-01-16 18:59:12,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:59:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2020-01-16 18:59:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 438. [2020-01-16 18:59:12,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-01-16 18:59:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1491 transitions. [2020-01-16 18:59:12,629 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1491 transitions. Word has length 19 [2020-01-16 18:59:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:12,629 INFO L478 AbstractCegarLoop]: Abstraction has 438 states and 1491 transitions. [2020-01-16 18:59:12,629 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1491 transitions. [2020-01-16 18:59:12,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:12,631 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59: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:59:12,631 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:59:12,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:12,632 INFO L82 PathProgramCache]: Analyzing trace with hash -362295540, now seen corresponding path program 18 times [2020-01-16 18:59:12,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:12,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549211302] [2020-01-16 18:59:12,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:12,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:59:12,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549211302] [2020-01-16 18:59:12,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:12,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:12,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759497449] [2020-01-16 18:59:12,905 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:12,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:12,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:12,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:12,905 INFO L87 Difference]: Start difference. First operand 438 states and 1491 transitions. Second operand 8 states. [2020-01-16 18:59:12,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:12,992 INFO L93 Difference]: Finished difference Result 828 states and 2530 transitions. [2020-01-16 18:59:12,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:12,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:12,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:13,003 INFO L225 Difference]: With dead ends: 828 [2020-01-16 18:59:13,003 INFO L226 Difference]: Without dead ends: 771 [2020-01-16 18:59:13,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2020-01-16 18:59:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 425. [2020-01-16 18:59:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-01-16 18:59:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1457 transitions. [2020-01-16 18:59:13,026 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1457 transitions. Word has length 19 [2020-01-16 18:59:13,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:13,026 INFO L478 AbstractCegarLoop]: Abstraction has 425 states and 1457 transitions. [2020-01-16 18:59:13,026 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1457 transitions. [2020-01-16 18:59:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:13,028 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:13,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:13,028 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:59:13,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:13,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1500056126, now seen corresponding path program 19 times [2020-01-16 18:59:13,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:13,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383194674] [2020-01-16 18:59:13,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:13,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:59:13,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383194674] [2020-01-16 18:59:13,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:13,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:13,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228393133] [2020-01-16 18:59:13,244 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:13,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:13,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:13,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:13,244 INFO L87 Difference]: Start difference. First operand 425 states and 1457 transitions. Second operand 8 states. [2020-01-16 18:59:13,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:13,333 INFO L93 Difference]: Finished difference Result 861 states and 2675 transitions. [2020-01-16 18:59:13,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:13,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:13,337 INFO L225 Difference]: With dead ends: 861 [2020-01-16 18:59:13,343 INFO L226 Difference]: Without dead ends: 813 [2020-01-16 18:59:13,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:59:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2020-01-16 18:59:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 442. [2020-01-16 18:59:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-01-16 18:59:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1515 transitions. [2020-01-16 18:59:13,371 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1515 transitions. Word has length 19 [2020-01-16 18:59:13,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:13,371 INFO L478 AbstractCegarLoop]: Abstraction has 442 states and 1515 transitions. [2020-01-16 18:59:13,371 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:13,371 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1515 transitions. [2020-01-16 18:59:13,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:13,373 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:13,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:59:13,375 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:59:13,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:13,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1499461480, now seen corresponding path program 20 times [2020-01-16 18:59:13,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:13,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187365293] [2020-01-16 18:59:13,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:13,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187365293] [2020-01-16 18:59:13,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:13,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:13,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409251559] [2020-01-16 18:59:13,627 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:13,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:13,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:13,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:13,628 INFO L87 Difference]: Start difference. First operand 442 states and 1515 transitions. Second operand 8 states. [2020-01-16 18:59:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:13,714 INFO L93 Difference]: Finished difference Result 850 states and 2628 transitions. [2020-01-16 18:59:13,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:13,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:13,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:13,717 INFO L225 Difference]: With dead ends: 850 [2020-01-16 18:59:13,717 INFO L226 Difference]: Without dead ends: 804 [2020-01-16 18:59:13,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:59:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2020-01-16 18:59:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 433. [2020-01-16 18:59:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2020-01-16 18:59:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1485 transitions. [2020-01-16 18:59:13,736 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1485 transitions. Word has length 19 [2020-01-16 18:59:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:13,736 INFO L478 AbstractCegarLoop]: Abstraction has 433 states and 1485 transitions. [2020-01-16 18:59:13,736 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1485 transitions. [2020-01-16 18:59:13,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:13,738 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:13,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:59:13,739 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:59:13,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:13,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1939604516, now seen corresponding path program 21 times [2020-01-16 18:59:13,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:13,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271575978] [2020-01-16 18:59:13,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:14,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:59:14,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271575978] [2020-01-16 18:59:14,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:14,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:14,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845484247] [2020-01-16 18:59:14,028 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:14,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:14,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:14,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:14,029 INFO L87 Difference]: Start difference. First operand 433 states and 1485 transitions. Second operand 8 states. [2020-01-16 18:59:14,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:14,119 INFO L93 Difference]: Finished difference Result 875 states and 2726 transitions. [2020-01-16 18:59:14,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:14,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:14,123 INFO L225 Difference]: With dead ends: 875 [2020-01-16 18:59:14,124 INFO L226 Difference]: Without dead ends: 827 [2020-01-16 18:59:14,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:59:14,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2020-01-16 18:59:14,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 449. [2020-01-16 18:59:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2020-01-16 18:59:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1533 transitions. [2020-01-16 18:59:14,142 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1533 transitions. Word has length 19 [2020-01-16 18:59:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:14,142 INFO L478 AbstractCegarLoop]: Abstraction has 449 states and 1533 transitions. [2020-01-16 18:59:14,142 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1533 transitions. [2020-01-16 18:59:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:14,144 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:14,144 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:14,144 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:59:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1081324632, now seen corresponding path program 22 times [2020-01-16 18:59:14,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:14,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719656328] [2020-01-16 18:59:14,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:14,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:59:14,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719656328] [2020-01-16 18:59:14,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:14,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:14,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287891372] [2020-01-16 18:59:14,452 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:14,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:14,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:14,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:14,452 INFO L87 Difference]: Start difference. First operand 449 states and 1533 transitions. Second operand 8 states. [2020-01-16 18:59:14,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:14,549 INFO L93 Difference]: Finished difference Result 871 states and 2698 transitions. [2020-01-16 18:59:14,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:14,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:14,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:14,553 INFO L225 Difference]: With dead ends: 871 [2020-01-16 18:59:14,553 INFO L226 Difference]: Without dead ends: 811 [2020-01-16 18:59:14,554 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:59:14,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-01-16 18:59:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 433. [2020-01-16 18:59:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2020-01-16 18:59:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1477 transitions. [2020-01-16 18:59:14,567 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1477 transitions. Word has length 19 [2020-01-16 18:59:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:14,567 INFO L478 AbstractCegarLoop]: Abstraction has 433 states and 1477 transitions. [2020-01-16 18:59:14,567 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1477 transitions. [2020-01-16 18:59:14,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:14,569 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:14,569 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:14,569 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:59:14,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:14,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1958633188, now seen corresponding path program 23 times [2020-01-16 18:59:14,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:14,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907742895] [2020-01-16 18:59:14,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:14,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907742895] [2020-01-16 18:59:14,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:14,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:14,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713230942] [2020-01-16 18:59:14,799 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:14,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:14,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:14,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:14,800 INFO L87 Difference]: Start difference. First operand 433 states and 1477 transitions. Second operand 8 states. [2020-01-16 18:59:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:14,902 INFO L93 Difference]: Finished difference Result 845 states and 2606 transitions. [2020-01-16 18:59:14,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:14,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:14,906 INFO L225 Difference]: With dead ends: 845 [2020-01-16 18:59:14,906 INFO L226 Difference]: Without dead ends: 808 [2020-01-16 18:59:14,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2020-01-16 18:59:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 441. [2020-01-16 18:59:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-01-16 18:59:14,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1497 transitions. [2020-01-16 18:59:14,925 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1497 transitions. Word has length 19 [2020-01-16 18:59:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:14,927 INFO L478 AbstractCegarLoop]: Abstraction has 441 states and 1497 transitions. [2020-01-16 18:59:14,927 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1497 transitions. [2020-01-16 18:59:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:14,929 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:14,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:59:14,929 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:59:14,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:14,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1099758658, now seen corresponding path program 24 times [2020-01-16 18:59:14,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:14,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581437523] [2020-01-16 18:59:14,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:15,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581437523] [2020-01-16 18:59:15,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:15,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:15,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002234697] [2020-01-16 18:59:15,145 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:15,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:15,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:15,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:15,146 INFO L87 Difference]: Start difference. First operand 441 states and 1497 transitions. Second operand 8 states. [2020-01-16 18:59:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:15,236 INFO L93 Difference]: Finished difference Result 852 states and 2624 transitions. [2020-01-16 18:59:15,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:15,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:15,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:15,239 INFO L225 Difference]: With dead ends: 852 [2020-01-16 18:59:15,240 INFO L226 Difference]: Without dead ends: 784 [2020-01-16 18:59:15,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:15,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2020-01-16 18:59:15,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 417. [2020-01-16 18:59:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-01-16 18:59:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1439 transitions. [2020-01-16 18:59:15,257 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1439 transitions. Word has length 19 [2020-01-16 18:59:15,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:15,258 INFO L478 AbstractCegarLoop]: Abstraction has 417 states and 1439 transitions. [2020-01-16 18:59:15,258 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1439 transitions. [2020-01-16 18:59:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:15,259 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:15,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:59:15,260 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:59:15,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:15,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1228367856, now seen corresponding path program 25 times [2020-01-16 18:59:15,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:15,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248242205] [2020-01-16 18:59:15,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:15,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:59:15,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248242205] [2020-01-16 18:59:15,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:15,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:15,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879522885] [2020-01-16 18:59:15,497 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:15,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:15,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:15,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:15,498 INFO L87 Difference]: Start difference. First operand 417 states and 1439 transitions. Second operand 8 states. [2020-01-16 18:59:15,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:15,560 INFO L93 Difference]: Finished difference Result 860 states and 2665 transitions. [2020-01-16 18:59:15,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:15,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:15,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:15,563 INFO L225 Difference]: With dead ends: 860 [2020-01-16 18:59:15,564 INFO L226 Difference]: Without dead ends: 822 [2020-01-16 18:59:15,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:15,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2020-01-16 18:59:15,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 446. [2020-01-16 18:59:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-01-16 18:59:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1534 transitions. [2020-01-16 18:59:15,579 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1534 transitions. Word has length 19 [2020-01-16 18:59:15,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:15,579 INFO L478 AbstractCegarLoop]: Abstraction has 446 states and 1534 transitions. [2020-01-16 18:59:15,579 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1534 transitions. [2020-01-16 18:59:15,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:15,580 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:15,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:59:15,581 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:59:15,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:15,581 INFO L82 PathProgramCache]: Analyzing trace with hash -853716670, now seen corresponding path program 26 times [2020-01-16 18:59:15,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:15,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874811551] [2020-01-16 18:59:15,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:15,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874811551] [2020-01-16 18:59:15,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:15,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:15,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582678801] [2020-01-16 18:59:15,835 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:15,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:15,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:15,835 INFO L87 Difference]: Start difference. First operand 446 states and 1534 transitions. Second operand 8 states. [2020-01-16 18:59:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:15,930 INFO L93 Difference]: Finished difference Result 870 states and 2692 transitions. [2020-01-16 18:59:15,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:15,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:15,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:15,933 INFO L225 Difference]: With dead ends: 870 [2020-01-16 18:59:15,933 INFO L226 Difference]: Without dead ends: 811 [2020-01-16 18:59:15,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:15,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-01-16 18:59:15,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 435. [2020-01-16 18:59:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-01-16 18:59:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1500 transitions. [2020-01-16 18:59:15,948 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1500 transitions. Word has length 19 [2020-01-16 18:59:15,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:15,948 INFO L478 AbstractCegarLoop]: Abstraction has 435 states and 1500 transitions. [2020-01-16 18:59:15,948 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:15,948 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1500 transitions. [2020-01-16 18:59:15,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:15,949 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:15,950 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:15,950 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:59:15,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:15,950 INFO L82 PathProgramCache]: Analyzing trace with hash -46978102, now seen corresponding path program 27 times [2020-01-16 18:59:15,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:15,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042327441] [2020-01-16 18:59:15,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:16,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:59:16,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042327441] [2020-01-16 18:59:16,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:16,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:16,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970020582] [2020-01-16 18:59:16,162 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:16,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:16,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:16,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:16,163 INFO L87 Difference]: Start difference. First operand 435 states and 1500 transitions. Second operand 8 states. [2020-01-16 18:59:16,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:16,229 INFO L93 Difference]: Finished difference Result 854 states and 2639 transitions. [2020-01-16 18:59:16,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:16,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:16,233 INFO L225 Difference]: With dead ends: 854 [2020-01-16 18:59:16,233 INFO L226 Difference]: Without dead ends: 816 [2020-01-16 18:59:16,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:59:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2020-01-16 18:59:16,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 444. [2020-01-16 18:59:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2020-01-16 18:59:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1521 transitions. [2020-01-16 18:59:16,249 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1521 transitions. Word has length 19 [2020-01-16 18:59:16,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:16,249 INFO L478 AbstractCegarLoop]: Abstraction has 444 states and 1521 transitions. [2020-01-16 18:59:16,249 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:16,249 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1521 transitions. [2020-01-16 18:59:16,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:16,251 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:16,251 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:16,251 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:59:16,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:16,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1023182852, now seen corresponding path program 28 times [2020-01-16 18:59:16,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:16,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672085097] [2020-01-16 18:59:16,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:16,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:59:16,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672085097] [2020-01-16 18:59:16,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:16,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:16,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496255572] [2020-01-16 18:59:16,484 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:16,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:16,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:16,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:16,486 INFO L87 Difference]: Start difference. First operand 444 states and 1521 transitions. Second operand 8 states. [2020-01-16 18:59:16,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:16,575 INFO L93 Difference]: Finished difference Result 860 states and 2655 transitions. [2020-01-16 18:59:16,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:16,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:16,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:16,578 INFO L225 Difference]: With dead ends: 860 [2020-01-16 18:59:16,578 INFO L226 Difference]: Without dead ends: 807 [2020-01-16 18:59:16,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:16,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2020-01-16 18:59:16,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 435. [2020-01-16 18:59:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-01-16 18:59:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1491 transitions. [2020-01-16 18:59:16,595 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1491 transitions. Word has length 19 [2020-01-16 18:59:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:16,596 INFO L478 AbstractCegarLoop]: Abstraction has 435 states and 1491 transitions. [2020-01-16 18:59:16,596 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1491 transitions. [2020-01-16 18:59:16,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:16,597 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:16,597 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:16,597 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:59:16,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:16,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1142789438, now seen corresponding path program 29 times [2020-01-16 18:59:16,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:16,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445219733] [2020-01-16 18:59:16,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:16,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445219733] [2020-01-16 18:59:16,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:16,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:16,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120729574] [2020-01-16 18:59:16,813 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:16,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:16,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:16,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:16,814 INFO L87 Difference]: Start difference. First operand 435 states and 1491 transitions. Second operand 8 states. [2020-01-16 18:59:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:16,898 INFO L93 Difference]: Finished difference Result 881 states and 2738 transitions. [2020-01-16 18:59:16,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:16,898 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:16,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:16,901 INFO L225 Difference]: With dead ends: 881 [2020-01-16 18:59:16,902 INFO L226 Difference]: Without dead ends: 833 [2020-01-16 18:59:16,902 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2020-01-16 18:59:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 451. [2020-01-16 18:59:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2020-01-16 18:59:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1539 transitions. [2020-01-16 18:59:16,919 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1539 transitions. Word has length 19 [2020-01-16 18:59:16,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:16,919 INFO L478 AbstractCegarLoop]: Abstraction has 451 states and 1539 transitions. [2020-01-16 18:59:16,919 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:16,919 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1539 transitions. [2020-01-16 18:59:16,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:16,921 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:16,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:59:16,921 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:59:16,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:16,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2001069322, now seen corresponding path program 30 times [2020-01-16 18:59:16,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:16,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627012149] [2020-01-16 18:59:16,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:17,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627012149] [2020-01-16 18:59:17,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:17,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:17,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817804449] [2020-01-16 18:59:17,163 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:17,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:17,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:17,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:17,163 INFO L87 Difference]: Start difference. First operand 451 states and 1539 transitions. Second operand 8 states. [2020-01-16 18:59:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:17,248 INFO L93 Difference]: Finished difference Result 877 states and 2710 transitions. [2020-01-16 18:59:17,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:17,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:17,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:17,254 INFO L225 Difference]: With dead ends: 877 [2020-01-16 18:59:17,254 INFO L226 Difference]: Without dead ends: 806 [2020-01-16 18:59:17,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2020-01-16 18:59:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 424. [2020-01-16 18:59:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-01-16 18:59:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1461 transitions. [2020-01-16 18:59:17,268 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1461 transitions. Word has length 19 [2020-01-16 18:59:17,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:17,269 INFO L478 AbstractCegarLoop]: Abstraction has 424 states and 1461 transitions. [2020-01-16 18:59:17,269 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:17,269 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1461 transitions. [2020-01-16 18:59:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:17,270 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:17,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:17,270 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:59:17,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:17,271 INFO L82 PathProgramCache]: Analyzing trace with hash 784001922, now seen corresponding path program 31 times [2020-01-16 18:59:17,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:17,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868771563] [2020-01-16 18:59:17,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:17,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868771563] [2020-01-16 18:59:17,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:17,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:17,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043515082] [2020-01-16 18:59:17,475 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:17,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:17,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:17,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:17,476 INFO L87 Difference]: Start difference. First operand 424 states and 1461 transitions. Second operand 8 states. [2020-01-16 18:59:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:17,551 INFO L93 Difference]: Finished difference Result 837 states and 2562 transitions. [2020-01-16 18:59:17,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:17,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:17,554 INFO L225 Difference]: With dead ends: 837 [2020-01-16 18:59:17,554 INFO L226 Difference]: Without dead ends: 799 [2020-01-16 18:59:17,555 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2020-01-16 18:59:17,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 441. [2020-01-16 18:59:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-01-16 18:59:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1506 transitions. [2020-01-16 18:59:17,571 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1506 transitions. Word has length 19 [2020-01-16 18:59:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:17,571 INFO L478 AbstractCegarLoop]: Abstraction has 441 states and 1506 transitions. [2020-01-16 18:59:17,571 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1506 transitions. [2020-01-16 18:59:17,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:17,573 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:17,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:59:17,573 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:59:17,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:17,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1158653108, now seen corresponding path program 32 times [2020-01-16 18:59:17,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:17,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271150315] [2020-01-16 18:59:17,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:17,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271150315] [2020-01-16 18:59:17,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:17,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:17,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676502197] [2020-01-16 18:59:17,789 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:17,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:17,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:17,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:17,790 INFO L87 Difference]: Start difference. First operand 441 states and 1506 transitions. Second operand 8 states. [2020-01-16 18:59:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:17,883 INFO L93 Difference]: Finished difference Result 847 states and 2589 transitions. [2020-01-16 18:59:17,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:17,884 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:17,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:17,887 INFO L225 Difference]: With dead ends: 847 [2020-01-16 18:59:17,888 INFO L226 Difference]: Without dead ends: 788 [2020-01-16 18:59:17,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:59:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2020-01-16 18:59:17,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 430. [2020-01-16 18:59:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-01-16 18:59:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1476 transitions. [2020-01-16 18:59:17,904 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1476 transitions. Word has length 19 [2020-01-16 18:59:17,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:17,905 INFO L478 AbstractCegarLoop]: Abstraction has 430 states and 1476 transitions. [2020-01-16 18:59:17,905 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:17,905 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1476 transitions. [2020-01-16 18:59:17,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:17,906 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:17,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:59:17,906 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:59:17,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:17,907 INFO L82 PathProgramCache]: Analyzing trace with hash 988603004, now seen corresponding path program 33 times [2020-01-16 18:59:17,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:17,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577691058] [2020-01-16 18:59:17,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:18,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577691058] [2020-01-16 18:59:18,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:18,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:18,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307196461] [2020-01-16 18:59:18,113 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:18,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:18,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:18,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:18,113 INFO L87 Difference]: Start difference. First operand 430 states and 1476 transitions. Second operand 8 states. [2020-01-16 18:59:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:18,170 INFO L93 Difference]: Finished difference Result 820 states and 2498 transitions. [2020-01-16 18:59:18,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:18,171 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:18,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:18,172 INFO L225 Difference]: With dead ends: 820 [2020-01-16 18:59:18,172 INFO L226 Difference]: Without dead ends: 782 [2020-01-16 18:59:18,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:59:18,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2020-01-16 18:59:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 435. [2020-01-16 18:59:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-01-16 18:59:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1485 transitions. [2020-01-16 18:59:18,183 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1485 transitions. Word has length 19 [2020-01-16 18:59:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:18,184 INFO L478 AbstractCegarLoop]: Abstraction has 435 states and 1485 transitions. [2020-01-16 18:59:18,184 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1485 transitions. [2020-01-16 18:59:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:18,185 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:18,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:59:18,186 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:59:18,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:18,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1865254260, now seen corresponding path program 1 times [2020-01-16 18:59:18,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:18,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729152151] [2020-01-16 18:59:18,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:18,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:59:18,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729152151] [2020-01-16 18:59:18,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:18,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:59:18,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500577732] [2020-01-16 18:59:18,200 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:59:18,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:18,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:59:18,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:59:18,200 INFO L87 Difference]: Start difference. First operand 435 states and 1485 transitions. Second operand 3 states. [2020-01-16 18:59:18,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:18,207 INFO L93 Difference]: Finished difference Result 349 states and 1112 transitions. [2020-01-16 18:59:18,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:59:18,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-01-16 18:59:18,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:18,209 INFO L225 Difference]: With dead ends: 349 [2020-01-16 18:59:18,209 INFO L226 Difference]: Without dead ends: 349 [2020-01-16 18:59:18,209 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:59:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-01-16 18:59:18,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2020-01-16 18:59:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:59:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1112 transitions. [2020-01-16 18:59:18,218 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1112 transitions. Word has length 19 [2020-01-16 18:59:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:18,219 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1112 transitions. [2020-01-16 18:59:18,219 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:59:18,219 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1112 transitions. [2020-01-16 18:59:18,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:18,224 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:18,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:59:18,224 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:59:18,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:18,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1163123542, now seen corresponding path program 34 times [2020-01-16 18:59:18,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:18,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979012687] [2020-01-16 18:59:18,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:18,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:59:18,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979012687] [2020-01-16 18:59:18,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:18,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:18,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416079940] [2020-01-16 18:59:18,428 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:18,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:18,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:18,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:18,429 INFO L87 Difference]: Start difference. First operand 349 states and 1112 transitions. Second operand 8 states. [2020-01-16 18:59:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:18,521 INFO L93 Difference]: Finished difference Result 644 states and 1770 transitions. [2020-01-16 18:59:18,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:18,521 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:18,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:18,522 INFO L225 Difference]: With dead ends: 644 [2020-01-16 18:59:18,523 INFO L226 Difference]: Without dead ends: 611 [2020-01-16 18:59:18,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:18,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2020-01-16 18:59:18,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 346. [2020-01-16 18:59:18,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-01-16 18:59:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1105 transitions. [2020-01-16 18:59:18,532 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1105 transitions. Word has length 19 [2020-01-16 18:59:18,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:18,532 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 1105 transitions. [2020-01-16 18:59:18,532 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1105 transitions. [2020-01-16 18:59:18,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:18,533 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:18,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:59:18,533 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:59:18,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:18,533 INFO L82 PathProgramCache]: Analyzing trace with hash -409413030, now seen corresponding path program 35 times [2020-01-16 18:59:18,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:18,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451950858] [2020-01-16 18:59:18,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:18,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:59:18,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451950858] [2020-01-16 18:59:18,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:18,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:18,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905246188] [2020-01-16 18:59:18,736 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:18,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:18,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:18,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:18,737 INFO L87 Difference]: Start difference. First operand 346 states and 1105 transitions. Second operand 8 states. [2020-01-16 18:59:18,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:18,824 INFO L93 Difference]: Finished difference Result 666 states and 1842 transitions. [2020-01-16 18:59:18,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:18,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:18,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:18,826 INFO L225 Difference]: With dead ends: 666 [2020-01-16 18:59:18,826 INFO L226 Difference]: Without dead ends: 626 [2020-01-16 18:59:18,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-01-16 18:59:18,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 352. [2020-01-16 18:59:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-01-16 18:59:18,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1117 transitions. [2020-01-16 18:59:18,838 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1117 transitions. Word has length 19 [2020-01-16 18:59:18,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:18,838 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 1117 transitions. [2020-01-16 18:59:18,838 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:18,838 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1117 transitions. [2020-01-16 18:59:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:18,839 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:18,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:59:18,839 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:59:18,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:18,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1283748356, now seen corresponding path program 36 times [2020-01-16 18:59:18,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:18,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553294974] [2020-01-16 18:59:18,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:19,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:59:19,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553294974] [2020-01-16 18:59:19,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:19,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:19,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323422173] [2020-01-16 18:59:19,063 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:19,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:19,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:19,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:19,064 INFO L87 Difference]: Start difference. First operand 352 states and 1117 transitions. Second operand 8 states. [2020-01-16 18:59:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:19,173 INFO L93 Difference]: Finished difference Result 656 states and 1805 transitions. [2020-01-16 18:59:19,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:19,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:19,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:19,175 INFO L225 Difference]: With dead ends: 656 [2020-01-16 18:59:19,175 INFO L226 Difference]: Without dead ends: 616 [2020-01-16 18:59:19,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-01-16 18:59:19,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 342. [2020-01-16 18:59:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-01-16 18:59:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1096 transitions. [2020-01-16 18:59:19,186 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1096 transitions. Word has length 19 [2020-01-16 18:59:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:19,186 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 1096 transitions. [2020-01-16 18:59:19,187 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1096 transitions. [2020-01-16 18:59:19,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:19,188 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:19,188 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:19,188 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:59:19,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:19,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1043020286, now seen corresponding path program 37 times [2020-01-16 18:59:19,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:19,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578884868] [2020-01-16 18:59:19,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:19,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578884868] [2020-01-16 18:59:19,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:19,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:19,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739623003] [2020-01-16 18:59:19,379 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:19,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:19,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:19,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:19,379 INFO L87 Difference]: Start difference. First operand 342 states and 1096 transitions. Second operand 8 states. [2020-01-16 18:59:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:19,446 INFO L93 Difference]: Finished difference Result 637 states and 1753 transitions. [2020-01-16 18:59:19,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:19,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:19,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:19,448 INFO L225 Difference]: With dead ends: 637 [2020-01-16 18:59:19,448 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 18:59:19,448 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:59:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 18:59:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 348. [2020-01-16 18:59:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-01-16 18:59:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1110 transitions. [2020-01-16 18:59:19,459 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1110 transitions. Word has length 19 [2020-01-16 18:59:19,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:19,459 INFO L478 AbstractCegarLoop]: Abstraction has 348 states and 1110 transitions. [2020-01-16 18:59:19,459 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1110 transitions. [2020-01-16 18:59:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:19,460 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:19,460 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:19,460 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:59:19,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:19,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1100220464, now seen corresponding path program 38 times [2020-01-16 18:59:19,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:19,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417004431] [2020-01-16 18:59:19,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:19,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417004431] [2020-01-16 18:59:19,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:19,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:19,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799174867] [2020-01-16 18:59:19,688 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:19,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:19,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:19,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:19,689 INFO L87 Difference]: Start difference. First operand 348 states and 1110 transitions. Second operand 8 states. [2020-01-16 18:59:19,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:19,764 INFO L93 Difference]: Finished difference Result 636 states and 1749 transitions. [2020-01-16 18:59:19,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:19,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:19,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:19,766 INFO L225 Difference]: With dead ends: 636 [2020-01-16 18:59:19,766 INFO L226 Difference]: Without dead ends: 603 [2020-01-16 18:59:19,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:59:19,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2020-01-16 18:59:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 345. [2020-01-16 18:59:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:59:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1103 transitions. [2020-01-16 18:59:19,774 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1103 transitions. Word has length 19 [2020-01-16 18:59:19,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:19,774 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1103 transitions. [2020-01-16 18:59:19,774 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:19,774 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1103 transitions. [2020-01-16 18:59:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:19,775 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:19,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:59:19,776 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:59:19,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:19,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1549366552, now seen corresponding path program 39 times [2020-01-16 18:59:19,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:19,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900870544] [2020-01-16 18:59:19,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:19,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:59:19,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900870544] [2020-01-16 18:59:19,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:19,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:19,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544382888] [2020-01-16 18:59:19,974 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:19,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:19,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:19,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:19,975 INFO L87 Difference]: Start difference. First operand 345 states and 1103 transitions. Second operand 8 states. [2020-01-16 18:59:20,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:20,053 INFO L93 Difference]: Finished difference Result 646 states and 1779 transitions. [2020-01-16 18:59:20,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:20,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:20,055 INFO L225 Difference]: With dead ends: 646 [2020-01-16 18:59:20,055 INFO L226 Difference]: Without dead ends: 615 [2020-01-16 18:59:20,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:20,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-01-16 18:59:20,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 351. [2020-01-16 18:59:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-01-16 18:59:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1114 transitions. [2020-01-16 18:59:20,065 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1114 transitions. Word has length 19 [2020-01-16 18:59:20,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:20,066 INFO L478 AbstractCegarLoop]: Abstraction has 351 states and 1114 transitions. [2020-01-16 18:59:20,066 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:20,066 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1114 transitions. [2020-01-16 18:59:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:20,067 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:20,067 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:20,067 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:59:20,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:20,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1769395994, now seen corresponding path program 40 times [2020-01-16 18:59:20,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:20,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048903417] [2020-01-16 18:59:20,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:20,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:59:20,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048903417] [2020-01-16 18:59:20,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:20,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:20,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304387663] [2020-01-16 18:59:20,306 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:20,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:20,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:20,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:20,307 INFO L87 Difference]: Start difference. First operand 351 states and 1114 transitions. Second operand 8 states. [2020-01-16 18:59:20,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:20,424 INFO L93 Difference]: Finished difference Result 651 states and 1791 transitions. [2020-01-16 18:59:20,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:20,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:20,425 INFO L225 Difference]: With dead ends: 651 [2020-01-16 18:59:20,425 INFO L226 Difference]: Without dead ends: 609 [2020-01-16 18:59:20,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:59:20,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-01-16 18:59:20,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 345. [2020-01-16 18:59:20,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:59:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1100 transitions. [2020-01-16 18:59:20,435 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1100 transitions. Word has length 19 [2020-01-16 18:59:20,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:20,435 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1100 transitions. [2020-01-16 18:59:20,435 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:20,435 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1100 transitions. [2020-01-16 18:59:20,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:20,436 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:20,436 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:20,437 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:59:20,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:20,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1215861966, now seen corresponding path program 41 times [2020-01-16 18:59:20,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:20,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147079210] [2020-01-16 18:59:20,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:20,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:59:20,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147079210] [2020-01-16 18:59:20,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:20,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:20,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759868808] [2020-01-16 18:59:20,616 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:20,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:20,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:20,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:20,617 INFO L87 Difference]: Start difference. First operand 345 states and 1100 transitions. Second operand 8 states. [2020-01-16 18:59:20,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:20,708 INFO L93 Difference]: Finished difference Result 643 states and 1772 transitions. [2020-01-16 18:59:20,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:20,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:20,710 INFO L225 Difference]: With dead ends: 643 [2020-01-16 18:59:20,710 INFO L226 Difference]: Without dead ends: 613 [2020-01-16 18:59:20,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-01-16 18:59:20,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 350. [2020-01-16 18:59:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-01-16 18:59:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1110 transitions. [2020-01-16 18:59:20,718 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1110 transitions. Word has length 19 [2020-01-16 18:59:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:20,718 INFO L478 AbstractCegarLoop]: Abstraction has 350 states and 1110 transitions. [2020-01-16 18:59:20,718 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1110 transitions. [2020-01-16 18:59:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:20,719 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:20,719 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:20,720 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:59:20,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:20,720 INFO L82 PathProgramCache]: Analyzing trace with hash -513185368, now seen corresponding path program 42 times [2020-01-16 18:59:20,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:20,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34407138] [2020-01-16 18:59:20,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:20,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34407138] [2020-01-16 18:59:20,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:20,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:20,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180652966] [2020-01-16 18:59:20,912 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:20,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:20,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:20,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:20,912 INFO L87 Difference]: Start difference. First operand 350 states and 1110 transitions. Second operand 8 states. [2020-01-16 18:59:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:21,005 INFO L93 Difference]: Finished difference Result 649 states and 1786 transitions. [2020-01-16 18:59:21,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:21,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:21,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:21,007 INFO L225 Difference]: With dead ends: 649 [2020-01-16 18:59:21,007 INFO L226 Difference]: Without dead ends: 605 [2020-01-16 18:59:21,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:21,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-01-16 18:59:21,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 342. [2020-01-16 18:59:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-01-16 18:59:21,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1093 transitions. [2020-01-16 18:59:21,016 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1093 transitions. Word has length 19 [2020-01-16 18:59:21,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:21,017 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 1093 transitions. [2020-01-16 18:59:21,017 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1093 transitions. [2020-01-16 18:59:21,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:21,017 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:21,017 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:21,018 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:59:21,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:21,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1822419634, now seen corresponding path program 43 times [2020-01-16 18:59:21,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:21,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156184906] [2020-01-16 18:59:21,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:21,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:59:21,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156184906] [2020-01-16 18:59:21,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:21,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:21,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500974779] [2020-01-16 18:59:21,213 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:21,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:21,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:21,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:21,214 INFO L87 Difference]: Start difference. First operand 342 states and 1093 transitions. Second operand 8 states. [2020-01-16 18:59:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:21,301 INFO L93 Difference]: Finished difference Result 678 states and 1898 transitions. [2020-01-16 18:59:21,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:21,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:21,303 INFO L225 Difference]: With dead ends: 678 [2020-01-16 18:59:21,303 INFO L226 Difference]: Without dead ends: 638 [2020-01-16 18:59:21,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:59:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-01-16 18:59:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 353. [2020-01-16 18:59:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-01-16 18:59:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1125 transitions. [2020-01-16 18:59:21,312 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1125 transitions. Word has length 19 [2020-01-16 18:59:21,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:21,312 INFO L478 AbstractCegarLoop]: Abstraction has 353 states and 1125 transitions. [2020-01-16 18:59:21,313 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1125 transitions. [2020-01-16 18:59:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:21,313 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:21,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:59:21,313 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:59:21,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:21,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1598212336, now seen corresponding path program 44 times [2020-01-16 18:59:21,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:21,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547466403] [2020-01-16 18:59:21,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:21,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547466403] [2020-01-16 18:59:21,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:21,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:21,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57214651] [2020-01-16 18:59:21,527 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:21,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:21,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:21,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:21,528 INFO L87 Difference]: Start difference. First operand 353 states and 1125 transitions. Second operand 8 states. [2020-01-16 18:59:21,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:21,617 INFO L93 Difference]: Finished difference Result 668 states and 1861 transitions. [2020-01-16 18:59:21,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:21,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:21,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:21,620 INFO L225 Difference]: With dead ends: 668 [2020-01-16 18:59:21,620 INFO L226 Difference]: Without dead ends: 632 [2020-01-16 18:59:21,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:59:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-01-16 18:59:21,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 347. [2020-01-16 18:59:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-01-16 18:59:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1108 transitions. [2020-01-16 18:59:21,632 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1108 transitions. Word has length 19 [2020-01-16 18:59:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:21,632 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 1108 transitions. [2020-01-16 18:59:21,632 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1108 transitions. [2020-01-16 18:59:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:21,633 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:21,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:59:21,634 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:59:21,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:21,634 INFO L82 PathProgramCache]: Analyzing trace with hash 411687860, now seen corresponding path program 45 times [2020-01-16 18:59:21,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:21,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875421228] [2020-01-16 18:59:21,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:21,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:59:21,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875421228] [2020-01-16 18:59:21,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:21,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:21,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133340068] [2020-01-16 18:59:21,828 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:21,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:21,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:21,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:21,829 INFO L87 Difference]: Start difference. First operand 347 states and 1108 transitions. Second operand 8 states. [2020-01-16 18:59:21,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:21,904 INFO L93 Difference]: Finished difference Result 690 states and 1937 transitions. [2020-01-16 18:59:21,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:21,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:21,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:21,906 INFO L225 Difference]: With dead ends: 690 [2020-01-16 18:59:21,906 INFO L226 Difference]: Without dead ends: 650 [2020-01-16 18:59:21,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-01-16 18:59:21,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 359. [2020-01-16 18:59:21,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2020-01-16 18:59:21,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1139 transitions. [2020-01-16 18:59:21,914 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1139 transitions. Word has length 19 [2020-01-16 18:59:21,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:21,914 INFO L478 AbstractCegarLoop]: Abstraction has 359 states and 1139 transitions. [2020-01-16 18:59:21,914 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1139 transitions. [2020-01-16 18:59:21,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:21,915 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:21,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:59:21,915 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:59:21,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:21,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1380571900, now seen corresponding path program 46 times [2020-01-16 18:59:21,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:21,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747871060] [2020-01-16 18:59:21,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:22,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:59:22,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747871060] [2020-01-16 18:59:22,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:22,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:22,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509621904] [2020-01-16 18:59:22,114 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:22,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:22,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:22,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:22,114 INFO L87 Difference]: Start difference. First operand 359 states and 1139 transitions. Second operand 8 states. [2020-01-16 18:59:22,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:22,211 INFO L93 Difference]: Finished difference Result 686 states and 1913 transitions. [2020-01-16 18:59:22,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:22,211 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:22,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:22,213 INFO L225 Difference]: With dead ends: 686 [2020-01-16 18:59:22,213 INFO L226 Difference]: Without dead ends: 638 [2020-01-16 18:59:22,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:22,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-01-16 18:59:22,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 347. [2020-01-16 18:59:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-01-16 18:59:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1103 transitions. [2020-01-16 18:59:22,222 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1103 transitions. Word has length 19 [2020-01-16 18:59:22,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:22,222 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 1103 transitions. [2020-01-16 18:59:22,222 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1103 transitions. [2020-01-16 18:59:22,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:22,223 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:22,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:59:22,223 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:59:22,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:22,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1771460028, now seen corresponding path program 47 times [2020-01-16 18:59:22,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:22,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158664598] [2020-01-16 18:59:22,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:22,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:22,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158664598] [2020-01-16 18:59:22,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:22,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:22,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267180367] [2020-01-16 18:59:22,434 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:22,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:22,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:22,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:22,434 INFO L87 Difference]: Start difference. First operand 347 states and 1103 transitions. Second operand 8 states. [2020-01-16 18:59:22,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:22,523 INFO L93 Difference]: Finished difference Result 663 states and 1842 transitions. [2020-01-16 18:59:22,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:22,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:22,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:22,525 INFO L225 Difference]: With dead ends: 663 [2020-01-16 18:59:22,525 INFO L226 Difference]: Without dead ends: 633 [2020-01-16 18:59:22,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:59:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-01-16 18:59:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 352. [2020-01-16 18:59:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-01-16 18:59:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1113 transitions. [2020-01-16 18:59:22,538 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1113 transitions. Word has length 19 [2020-01-16 18:59:22,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:22,539 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 1113 transitions. [2020-01-16 18:59:22,539 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:22,539 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1113 transitions. [2020-01-16 18:59:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:22,540 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:22,540 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:22,540 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:59:22,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:22,541 INFO L82 PathProgramCache]: Analyzing trace with hash 42412694, now seen corresponding path program 48 times [2020-01-16 18:59:22,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:22,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133581991] [2020-01-16 18:59:22,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:22,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:59:22,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133581991] [2020-01-16 18:59:22,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:22,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:22,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433068194] [2020-01-16 18:59:22,728 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:22,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:22,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:22,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:22,728 INFO L87 Difference]: Start difference. First operand 352 states and 1113 transitions. Second operand 8 states. [2020-01-16 18:59:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:22,840 INFO L93 Difference]: Finished difference Result 669 states and 1856 transitions. [2020-01-16 18:59:22,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:22,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:22,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:22,842 INFO L225 Difference]: With dead ends: 669 [2020-01-16 18:59:22,842 INFO L226 Difference]: Without dead ends: 618 [2020-01-16 18:59:22,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-01-16 18:59:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 337. [2020-01-16 18:59:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-01-16 18:59:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1082 transitions. [2020-01-16 18:59:22,850 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1082 transitions. Word has length 19 [2020-01-16 18:59:22,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:22,851 INFO L478 AbstractCegarLoop]: Abstraction has 337 states and 1082 transitions. [2020-01-16 18:59:22,851 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1082 transitions. [2020-01-16 18:59:22,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:22,852 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:22,852 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:22,852 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:59:22,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:22,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1950102064, now seen corresponding path program 49 times [2020-01-16 18:59:22,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:22,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608800467] [2020-01-16 18:59:22,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:23,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:59:23,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608800467] [2020-01-16 18:59:23,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:23,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:23,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170051458] [2020-01-16 18:59:23,092 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:23,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:23,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:23,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:23,092 INFO L87 Difference]: Start difference. First operand 337 states and 1082 transitions. Second operand 8 states. [2020-01-16 18:59:23,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:23,161 INFO L93 Difference]: Finished difference Result 648 states and 1785 transitions. [2020-01-16 18:59:23,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:23,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:23,163 INFO L225 Difference]: With dead ends: 648 [2020-01-16 18:59:23,163 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 18:59:23,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:59:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 18:59:23,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 353. [2020-01-16 18:59:23,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-01-16 18:59:23,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1124 transitions. [2020-01-16 18:59:23,171 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1124 transitions. Word has length 19 [2020-01-16 18:59:23,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:23,171 INFO L478 AbstractCegarLoop]: Abstraction has 353 states and 1124 transitions. [2020-01-16 18:59:23,172 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:23,172 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1124 transitions. [2020-01-16 18:59:23,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:23,172 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:23,172 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:23,173 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:59:23,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:23,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1575450878, now seen corresponding path program 50 times [2020-01-16 18:59:23,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:23,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080309484] [2020-01-16 18:59:23,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:23,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080309484] [2020-01-16 18:59:23,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:23,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:23,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162686324] [2020-01-16 18:59:23,396 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:23,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:23,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:23,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:23,396 INFO L87 Difference]: Start difference. First operand 353 states and 1124 transitions. Second operand 8 states. [2020-01-16 18:59:23,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:23,482 INFO L93 Difference]: Finished difference Result 657 states and 1808 transitions. [2020-01-16 18:59:23,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:23,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:23,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:23,484 INFO L225 Difference]: With dead ends: 657 [2020-01-16 18:59:23,484 INFO L226 Difference]: Without dead ends: 609 [2020-01-16 18:59:23,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:23,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-01-16 18:59:23,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 345. [2020-01-16 18:59:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:59:23,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1106 transitions. [2020-01-16 18:59:23,497 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1106 transitions. Word has length 19 [2020-01-16 18:59:23,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:23,497 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1106 transitions. [2020-01-16 18:59:23,497 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:23,497 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1106 transitions. [2020-01-16 18:59:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:23,498 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:23,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:59:23,498 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:59:23,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:23,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1745500982, now seen corresponding path program 51 times [2020-01-16 18:59:23,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:23,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473062593] [2020-01-16 18:59:23,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:23,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473062593] [2020-01-16 18:59:23,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:23,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:23,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273398855] [2020-01-16 18:59:23,736 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:23,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:23,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:23,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:23,736 INFO L87 Difference]: Start difference. First operand 345 states and 1106 transitions. Second operand 8 states. [2020-01-16 18:59:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:23,804 INFO L93 Difference]: Finished difference Result 633 states and 1736 transitions. [2020-01-16 18:59:23,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:23,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:23,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:23,806 INFO L225 Difference]: With dead ends: 633 [2020-01-16 18:59:23,806 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 18:59:23,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:59:23,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 18:59:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 348. [2020-01-16 18:59:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-01-16 18:59:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1110 transitions. [2020-01-16 18:59:23,817 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1110 transitions. Word has length 19 [2020-01-16 18:59:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:23,817 INFO L478 AbstractCegarLoop]: Abstraction has 348 states and 1110 transitions. [2020-01-16 18:59:23,817 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1110 transitions. [2020-01-16 18:59:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:23,818 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:23,818 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:23,818 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:59:23,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash 397739768, now seen corresponding path program 52 times [2020-01-16 18:59:23,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:23,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590307496] [2020-01-16 18:59:23,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:24,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:59:24,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590307496] [2020-01-16 18:59:24,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:24,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:24,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195421937] [2020-01-16 18:59:24,028 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:24,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:24,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:24,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:24,029 INFO L87 Difference]: Start difference. First operand 348 states and 1110 transitions. Second operand 8 states. [2020-01-16 18:59:24,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:24,139 INFO L93 Difference]: Finished difference Result 632 states and 1732 transitions. [2020-01-16 18:59:24,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:24,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:24,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:24,141 INFO L225 Difference]: With dead ends: 632 [2020-01-16 18:59:24,141 INFO L226 Difference]: Without dead ends: 599 [2020-01-16 18:59:24,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:24,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-01-16 18:59:24,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 345. [2020-01-16 18:59:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:59:24,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1103 transitions. [2020-01-16 18:59:24,150 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1103 transitions. Word has length 19 [2020-01-16 18:59:24,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:24,150 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1103 transitions. [2020-01-16 18:59:24,150 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:24,150 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1103 transitions. [2020-01-16 18:59:24,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:24,151 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:24,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:59:24,151 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:59:24,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:24,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1151450280, now seen corresponding path program 53 times [2020-01-16 18:59:24,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:24,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91231418] [2020-01-16 18:59:24,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:24,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91231418] [2020-01-16 18:59:24,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:24,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:24,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803700083] [2020-01-16 18:59:24,398 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:24,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:24,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:24,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:24,399 INFO L87 Difference]: Start difference. First operand 345 states and 1103 transitions. Second operand 8 states. [2020-01-16 18:59:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:24,502 INFO L93 Difference]: Finished difference Result 654 states and 1804 transitions. [2020-01-16 18:59:24,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:24,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:24,504 INFO L225 Difference]: With dead ends: 654 [2020-01-16 18:59:24,505 INFO L226 Difference]: Without dead ends: 614 [2020-01-16 18:59:24,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-01-16 18:59:24,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 351. [2020-01-16 18:59:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-01-16 18:59:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1115 transitions. [2020-01-16 18:59:24,514 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1115 transitions. Word has length 19 [2020-01-16 18:59:24,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:24,514 INFO L478 AbstractCegarLoop]: Abstraction has 351 states and 1115 transitions. [2020-01-16 18:59:24,514 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1115 transitions. [2020-01-16 18:59:24,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:24,516 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:24,516 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:24,516 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:59:24,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:24,516 INFO L82 PathProgramCache]: Analyzing trace with hash 277114954, now seen corresponding path program 54 times [2020-01-16 18:59:24,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:24,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569630405] [2020-01-16 18:59:24,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:24,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569630405] [2020-01-16 18:59:24,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:24,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:24,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270216542] [2020-01-16 18:59:24,729 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:24,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:24,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:24,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:24,729 INFO L87 Difference]: Start difference. First operand 351 states and 1115 transitions. Second operand 8 states. [2020-01-16 18:59:24,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:24,828 INFO L93 Difference]: Finished difference Result 644 states and 1767 transitions. [2020-01-16 18:59:24,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:24,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:24,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:24,830 INFO L225 Difference]: With dead ends: 644 [2020-01-16 18:59:24,830 INFO L226 Difference]: Without dead ends: 604 [2020-01-16 18:59:24,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:59:24,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-01-16 18:59:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 341. [2020-01-16 18:59:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:59:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1094 transitions. [2020-01-16 18:59:24,840 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1094 transitions. Word has length 19 [2020-01-16 18:59:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:24,840 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1094 transitions. [2020-01-16 18:59:24,840 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1094 transitions. [2020-01-16 18:59:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:24,841 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:24,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:59:24,841 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:59:24,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:24,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1499893780, now seen corresponding path program 55 times [2020-01-16 18:59:24,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:24,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402421218] [2020-01-16 18:59:24,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:25,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402421218] [2020-01-16 18:59:25,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:25,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:25,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600604932] [2020-01-16 18:59:25,069 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:25,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:25,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:25,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:25,070 INFO L87 Difference]: Start difference. First operand 341 states and 1094 transitions. Second operand 8 states. [2020-01-16 18:59:25,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:25,135 INFO L93 Difference]: Finished difference Result 658 states and 1820 transitions. [2020-01-16 18:59:25,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:25,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:25,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:25,136 INFO L225 Difference]: With dead ends: 658 [2020-01-16 18:59:25,137 INFO L226 Difference]: Without dead ends: 627 [2020-01-16 18:59:25,137 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:25,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-01-16 18:59:25,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 355. [2020-01-16 18:59:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2020-01-16 18:59:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 1129 transitions. [2020-01-16 18:59:25,145 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 1129 transitions. Word has length 19 [2020-01-16 18:59:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:25,145 INFO L478 AbstractCegarLoop]: Abstraction has 355 states and 1129 transitions. [2020-01-16 18:59:25,146 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 1129 transitions. [2020-01-16 18:59:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:25,146 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:25,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:59:25,147 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:59:25,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:25,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1874544966, now seen corresponding path program 56 times [2020-01-16 18:59:25,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:25,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643903199] [2020-01-16 18:59:25,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:25,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:59:25,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643903199] [2020-01-16 18:59:25,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:25,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:25,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354318314] [2020-01-16 18:59:25,383 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:25,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:25,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:25,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:25,384 INFO L87 Difference]: Start difference. First operand 355 states and 1129 transitions. Second operand 8 states. [2020-01-16 18:59:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:25,468 INFO L93 Difference]: Finished difference Result 667 states and 1843 transitions. [2020-01-16 18:59:25,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:25,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:25,470 INFO L225 Difference]: With dead ends: 667 [2020-01-16 18:59:25,471 INFO L226 Difference]: Without dead ends: 619 [2020-01-16 18:59:25,471 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:25,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-01-16 18:59:25,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 347. [2020-01-16 18:59:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-01-16 18:59:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1109 transitions. [2020-01-16 18:59:25,484 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1109 transitions. Word has length 19 [2020-01-16 18:59:25,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:25,484 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 1109 transitions. [2020-01-16 18:59:25,485 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1109 transitions. [2020-01-16 18:59:25,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:25,485 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:25,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:59:25,485 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:59:25,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:25,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1939279986, now seen corresponding path program 57 times [2020-01-16 18:59:25,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:25,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622255298] [2020-01-16 18:59:25,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:25,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:59:25,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622255298] [2020-01-16 18:59:25,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:25,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:25,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631764692] [2020-01-16 18:59:25,706 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:25,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:25,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:25,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:25,707 INFO L87 Difference]: Start difference. First operand 347 states and 1109 transitions. Second operand 8 states. [2020-01-16 18:59:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:25,787 INFO L93 Difference]: Finished difference Result 648 states and 1786 transitions. [2020-01-16 18:59:25,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:25,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:25,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:25,789 INFO L225 Difference]: With dead ends: 648 [2020-01-16 18:59:25,789 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 18:59:25,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:59:25,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 18:59:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 352. [2020-01-16 18:59:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-01-16 18:59:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1118 transitions. [2020-01-16 18:59:25,803 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1118 transitions. Word has length 19 [2020-01-16 18:59:25,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:25,803 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 1118 transitions. [2020-01-16 18:59:25,804 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:25,804 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1118 transitions. [2020-01-16 18:59:25,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:25,805 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:25,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:59:25,806 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:59:25,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:25,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1604625216, now seen corresponding path program 58 times [2020-01-16 18:59:25,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:25,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484169841] [2020-01-16 18:59:25,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:26,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:59:26,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484169841] [2020-01-16 18:59:26,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:26,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:26,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086885366] [2020-01-16 18:59:26,026 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:26,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:26,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:26,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:26,026 INFO L87 Difference]: Start difference. First operand 352 states and 1118 transitions. Second operand 8 states. [2020-01-16 18:59:26,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:26,096 INFO L93 Difference]: Finished difference Result 650 states and 1790 transitions. [2020-01-16 18:59:26,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:26,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:26,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:26,098 INFO L225 Difference]: With dead ends: 650 [2020-01-16 18:59:26,098 INFO L226 Difference]: Without dead ends: 612 [2020-01-16 18:59:26,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:26,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-01-16 18:59:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 347. [2020-01-16 18:59:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-01-16 18:59:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1104 transitions. [2020-01-16 18:59:26,108 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1104 transitions. Word has length 19 [2020-01-16 18:59:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:26,108 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 1104 transitions. [2020-01-16 18:59:26,108 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1104 transitions. [2020-01-16 18:59:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:26,109 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:26,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:59:26,110 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:59:26,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:26,110 INFO L82 PathProgramCache]: Analyzing trace with hash 334504740, now seen corresponding path program 59 times [2020-01-16 18:59:26,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:26,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386197020] [2020-01-16 18:59:26,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:26,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:59:26,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386197020] [2020-01-16 18:59:26,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:26,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:26,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982098392] [2020-01-16 18:59:26,311 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:26,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:26,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:26,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:26,312 INFO L87 Difference]: Start difference. First operand 347 states and 1104 transitions. Second operand 8 states. [2020-01-16 18:59:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:26,416 INFO L93 Difference]: Finished difference Result 670 states and 1858 transitions. [2020-01-16 18:59:26,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:26,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:26,418 INFO L225 Difference]: With dead ends: 670 [2020-01-16 18:59:26,418 INFO L226 Difference]: Without dead ends: 630 [2020-01-16 18:59:26,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-01-16 18:59:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 356. [2020-01-16 18:59:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2020-01-16 18:59:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 1126 transitions. [2020-01-16 18:59:26,427 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 1126 transitions. Word has length 19 [2020-01-16 18:59:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:26,427 INFO L478 AbstractCegarLoop]: Abstraction has 356 states and 1126 transitions. [2020-01-16 18:59:26,427 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 1126 transitions. [2020-01-16 18:59:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:26,428 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:26,428 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:26,428 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:59:26,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:26,428 INFO L82 PathProgramCache]: Analyzing trace with hash 333910094, now seen corresponding path program 60 times [2020-01-16 18:59:26,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:26,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578404183] [2020-01-16 18:59:26,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:26,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:26,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578404183] [2020-01-16 18:59:26,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:26,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:26,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320644514] [2020-01-16 18:59:26,642 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:26,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:26,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:26,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:26,642 INFO L87 Difference]: Start difference. First operand 356 states and 1126 transitions. Second operand 8 states. [2020-01-16 18:59:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:26,751 INFO L93 Difference]: Finished difference Result 663 states and 1828 transitions. [2020-01-16 18:59:26,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:26,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:26,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:26,753 INFO L225 Difference]: With dead ends: 663 [2020-01-16 18:59:26,753 INFO L226 Difference]: Without dead ends: 615 [2020-01-16 18:59:26,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:59:26,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-01-16 18:59:26,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 341. [2020-01-16 18:59:26,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:59:26,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1090 transitions. [2020-01-16 18:59:26,761 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1090 transitions. Word has length 19 [2020-01-16 18:59:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:26,761 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1090 transitions. [2020-01-16 18:59:26,761 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1090 transitions. [2020-01-16 18:59:26,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:26,762 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:26,762 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:26,762 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:59:26,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:26,763 INFO L82 PathProgramCache]: Analyzing trace with hash -985705328, now seen corresponding path program 61 times [2020-01-16 18:59:26,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:26,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393213922] [2020-01-16 18:59:26,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:26,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:59:26,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393213922] [2020-01-16 18:59:26,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:26,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:26,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380322731] [2020-01-16 18:59:26,976 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:26,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:26,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:26,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:26,976 INFO L87 Difference]: Start difference. First operand 341 states and 1090 transitions. Second operand 8 states. [2020-01-16 18:59:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:27,047 INFO L93 Difference]: Finished difference Result 620 states and 1696 transitions. [2020-01-16 18:59:27,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:27,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:27,049 INFO L225 Difference]: With dead ends: 620 [2020-01-16 18:59:27,049 INFO L226 Difference]: Without dead ends: 589 [2020-01-16 18:59:27,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:59:27,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-01-16 18:59:27,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 347. [2020-01-16 18:59:27,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-01-16 18:59:27,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1104 transitions. [2020-01-16 18:59:27,058 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1104 transitions. Word has length 19 [2020-01-16 18:59:27,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:27,058 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 1104 transitions. [2020-01-16 18:59:27,059 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:27,059 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1104 transitions. [2020-01-16 18:59:27,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:27,060 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:27,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:59:27,060 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:59:27,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:27,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1157535422, now seen corresponding path program 62 times [2020-01-16 18:59:27,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:27,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360910247] [2020-01-16 18:59:27,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:27,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:59:27,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360910247] [2020-01-16 18:59:27,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:27,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:27,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712521618] [2020-01-16 18:59:27,280 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:27,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:27,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:27,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:27,281 INFO L87 Difference]: Start difference. First operand 347 states and 1104 transitions. Second operand 8 states. [2020-01-16 18:59:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:27,394 INFO L93 Difference]: Finished difference Result 619 states and 1692 transitions. [2020-01-16 18:59:27,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:27,395 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:27,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:27,396 INFO L225 Difference]: With dead ends: 619 [2020-01-16 18:59:27,396 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 18:59:27,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:59:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 18:59:27,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 344. [2020-01-16 18:59:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-01-16 18:59:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1097 transitions. [2020-01-16 18:59:27,417 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1097 transitions. Word has length 19 [2020-01-16 18:59:27,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:27,417 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 1097 transitions. [2020-01-16 18:59:27,417 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1097 transitions. [2020-01-16 18:59:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:27,418 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:27,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:59:27,419 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:59:27,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:27,419 INFO L82 PathProgramCache]: Analyzing trace with hash 108386260, now seen corresponding path program 63 times [2020-01-16 18:59:27,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:27,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205026037] [2020-01-16 18:59:27,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:27,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205026037] [2020-01-16 18:59:27,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:27,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:27,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407919976] [2020-01-16 18:59:27,626 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:27,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:27,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:27,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:27,627 INFO L87 Difference]: Start difference. First operand 344 states and 1097 transitions. Second operand 8 states. [2020-01-16 18:59:27,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:27,700 INFO L93 Difference]: Finished difference Result 625 states and 1710 transitions. [2020-01-16 18:59:27,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:27,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:27,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:27,702 INFO L225 Difference]: With dead ends: 625 [2020-01-16 18:59:27,702 INFO L226 Difference]: Without dead ends: 594 [2020-01-16 18:59:27,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:59:27,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2020-01-16 18:59:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 349. [2020-01-16 18:59:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:59:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1106 transitions. [2020-01-16 18:59:27,713 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1106 transitions. Word has length 19 [2020-01-16 18:59:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:27,713 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1106 transitions. [2020-01-16 18:59:27,713 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1106 transitions. [2020-01-16 18:59:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:27,714 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:27,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:59:27,715 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:59:27,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:27,715 INFO L82 PathProgramCache]: Analyzing trace with hash -642675834, now seen corresponding path program 64 times [2020-01-16 18:59:27,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:27,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992216381] [2020-01-16 18:59:27,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:27,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:59:27,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992216381] [2020-01-16 18:59:27,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:27,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:27,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835052204] [2020-01-16 18:59:27,919 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:27,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:27,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:27,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:27,920 INFO L87 Difference]: Start difference. First operand 349 states and 1106 transitions. Second operand 8 states. [2020-01-16 18:59:28,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:28,017 INFO L93 Difference]: Finished difference Result 627 states and 1714 transitions. [2020-01-16 18:59:28,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:28,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:28,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:28,019 INFO L225 Difference]: With dead ends: 627 [2020-01-16 18:59:28,019 INFO L226 Difference]: Without dead ends: 589 [2020-01-16 18:59:28,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:59:28,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-01-16 18:59:28,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 344. [2020-01-16 18:59:28,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-01-16 18:59:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1094 transitions. [2020-01-16 18:59:28,028 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1094 transitions. Word has length 19 [2020-01-16 18:59:28,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:28,028 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 1094 transitions. [2020-01-16 18:59:28,028 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1094 transitions. [2020-01-16 18:59:28,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:28,029 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:28,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:59:28,030 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:59:28,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:28,030 INFO L82 PathProgramCache]: Analyzing trace with hash 517971322, now seen corresponding path program 65 times [2020-01-16 18:59:28,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:28,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010050787] [2020-01-16 18:59:28,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:28,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010050787] [2020-01-16 18:59:28,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:28,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:28,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503137673] [2020-01-16 18:59:28,243 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:28,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:28,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:28,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:28,243 INFO L87 Difference]: Start difference. First operand 344 states and 1094 transitions. Second operand 8 states. [2020-01-16 18:59:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:28,332 INFO L93 Difference]: Finished difference Result 622 states and 1703 transitions. [2020-01-16 18:59:28,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:28,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:28,334 INFO L225 Difference]: With dead ends: 622 [2020-01-16 18:59:28,334 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 18:59:28,334 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:28,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 18:59:28,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 348. [2020-01-16 18:59:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-01-16 18:59:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1102 transitions. [2020-01-16 18:59:28,342 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1102 transitions. Word has length 19 [2020-01-16 18:59:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:28,342 INFO L478 AbstractCegarLoop]: Abstraction has 348 states and 1102 transitions. [2020-01-16 18:59:28,342 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1102 transitions. [2020-01-16 18:59:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:28,343 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:28,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:59:28,343 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:59:28,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:28,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2066382666, now seen corresponding path program 66 times [2020-01-16 18:59:28,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:28,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188878433] [2020-01-16 18:59:28,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:28,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:59:28,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188878433] [2020-01-16 18:59:28,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:28,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:28,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678192899] [2020-01-16 18:59:28,576 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:28,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:28,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:28,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:28,577 INFO L87 Difference]: Start difference. First operand 348 states and 1102 transitions. Second operand 8 states. [2020-01-16 18:59:28,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:28,674 INFO L93 Difference]: Finished difference Result 625 states and 1709 transitions. [2020-01-16 18:59:28,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:28,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:28,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:28,676 INFO L225 Difference]: With dead ends: 625 [2020-01-16 18:59:28,676 INFO L226 Difference]: Without dead ends: 585 [2020-01-16 18:59:28,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:28,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2020-01-16 18:59:28,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 341. [2020-01-16 18:59:28,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:59:28,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1087 transitions. [2020-01-16 18:59:28,684 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1087 transitions. Word has length 19 [2020-01-16 18:59:28,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:28,685 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1087 transitions. [2020-01-16 18:59:28,685 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:28,685 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1087 transitions. [2020-01-16 18:59:28,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:28,685 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:28,686 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:28,686 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:59:28,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:28,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1775607780, now seen corresponding path program 67 times [2020-01-16 18:59:28,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:28,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846014932] [2020-01-16 18:59:28,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:28,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:59:28,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846014932] [2020-01-16 18:59:28,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:28,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:28,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471111463] [2020-01-16 18:59:28,874 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:28,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:28,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:28,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:28,875 INFO L87 Difference]: Start difference. First operand 341 states and 1087 transitions. Second operand 8 states. [2020-01-16 18:59:28,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:28,957 INFO L93 Difference]: Finished difference Result 658 states and 1828 transitions. [2020-01-16 18:59:28,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:28,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:28,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:28,958 INFO L225 Difference]: With dead ends: 658 [2020-01-16 18:59:28,958 INFO L226 Difference]: Without dead ends: 618 [2020-01-16 18:59:28,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:59:28,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-01-16 18:59:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 351. [2020-01-16 18:59:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-01-16 18:59:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1115 transitions. [2020-01-16 18:59:28,967 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1115 transitions. Word has length 19 [2020-01-16 18:59:28,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:28,968 INFO L478 AbstractCegarLoop]: Abstraction has 351 states and 1115 transitions. [2020-01-16 18:59:28,968 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:28,968 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1115 transitions. [2020-01-16 18:59:28,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:28,969 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:28,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:28,969 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:59:28,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:28,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1645024190, now seen corresponding path program 68 times [2020-01-16 18:59:28,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:28,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570245759] [2020-01-16 18:59:28,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:29,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:29,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570245759] [2020-01-16 18:59:29,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:29,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:29,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146898464] [2020-01-16 18:59:29,167 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:29,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:29,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:29,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:29,168 INFO L87 Difference]: Start difference. First operand 351 states and 1115 transitions. Second operand 8 states. [2020-01-16 18:59:29,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:29,255 INFO L93 Difference]: Finished difference Result 648 states and 1791 transitions. [2020-01-16 18:59:29,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:29,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:29,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:29,257 INFO L225 Difference]: With dead ends: 648 [2020-01-16 18:59:29,257 INFO L226 Difference]: Without dead ends: 612 [2020-01-16 18:59:29,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:59:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-01-16 18:59:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 345. [2020-01-16 18:59:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:59:29,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1099 transitions. [2020-01-16 18:59:29,265 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1099 transitions. Word has length 19 [2020-01-16 18:59:29,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:29,265 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1099 transitions. [2020-01-16 18:59:29,265 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:29,265 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1099 transitions. [2020-01-16 18:59:29,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:29,266 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:29,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:59:29,266 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:59:29,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:29,266 INFO L82 PathProgramCache]: Analyzing trace with hash -286202784, now seen corresponding path program 69 times [2020-01-16 18:59:29,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:29,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401382986] [2020-01-16 18:59:29,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:29,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:59:29,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401382986] [2020-01-16 18:59:29,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:29,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:29,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117778320] [2020-01-16 18:59:29,456 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:29,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:29,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:29,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:29,457 INFO L87 Difference]: Start difference. First operand 345 states and 1099 transitions. Second operand 8 states. [2020-01-16 18:59:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:29,545 INFO L93 Difference]: Finished difference Result 664 states and 1847 transitions. [2020-01-16 18:59:29,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:29,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:29,547 INFO L225 Difference]: With dead ends: 664 [2020-01-16 18:59:29,547 INFO L226 Difference]: Without dead ends: 624 [2020-01-16 18:59:29,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:59:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2020-01-16 18:59:29,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 354. [2020-01-16 18:59:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-01-16 18:59:29,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1121 transitions. [2020-01-16 18:59:29,555 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1121 transitions. Word has length 19 [2020-01-16 18:59:29,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:29,555 INFO L478 AbstractCegarLoop]: Abstraction has 354 states and 1121 transitions. [2020-01-16 18:59:29,555 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1121 transitions. [2020-01-16 18:59:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:29,556 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:29,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:59:29,556 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:59:29,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:29,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1031499928, now seen corresponding path program 70 times [2020-01-16 18:59:29,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:29,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402895899] [2020-01-16 18:59:29,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:29,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:59:29,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402895899] [2020-01-16 18:59:29,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:29,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:29,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374257570] [2020-01-16 18:59:29,772 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:29,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:29,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:29,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:29,772 INFO L87 Difference]: Start difference. First operand 354 states and 1121 transitions. Second operand 8 states. [2020-01-16 18:59:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:29,863 INFO L93 Difference]: Finished difference Result 657 states and 1817 transitions. [2020-01-16 18:59:29,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:29,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:29,865 INFO L225 Difference]: With dead ends: 657 [2020-01-16 18:59:29,865 INFO L226 Difference]: Without dead ends: 615 [2020-01-16 18:59:29,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-01-16 18:59:29,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 345. [2020-01-16 18:59:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:59:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1095 transitions. [2020-01-16 18:59:29,872 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1095 transitions. Word has length 19 [2020-01-16 18:59:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:29,872 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1095 transitions. [2020-01-16 18:59:29,872 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1095 transitions. [2020-01-16 18:59:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:29,873 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:29,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:59:29,874 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:59:29,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:29,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1073569384, now seen corresponding path program 71 times [2020-01-16 18:59:29,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:29,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349489264] [2020-01-16 18:59:29,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:30,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349489264] [2020-01-16 18:59:30,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:30,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:30,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292063594] [2020-01-16 18:59:30,065 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:30,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:30,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:30,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:30,066 INFO L87 Difference]: Start difference. First operand 345 states and 1095 transitions. Second operand 8 states. [2020-01-16 18:59:30,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:30,153 INFO L93 Difference]: Finished difference Result 639 states and 1762 transitions. [2020-01-16 18:59:30,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:30,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:30,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:30,155 INFO L225 Difference]: With dead ends: 639 [2020-01-16 18:59:30,155 INFO L226 Difference]: Without dead ends: 609 [2020-01-16 18:59:30,155 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2020-01-16 18:59:30,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 349. [2020-01-16 18:59:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:59:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1103 transitions. [2020-01-16 18:59:30,163 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1103 transitions. Word has length 19 [2020-01-16 18:59:30,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:30,163 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1103 transitions. [2020-01-16 18:59:30,163 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1103 transitions. [2020-01-16 18:59:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:30,164 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:30,164 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:30,164 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:59:30,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:30,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1510784604, now seen corresponding path program 72 times [2020-01-16 18:59:30,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:30,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753946504] [2020-01-16 18:59:30,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:30,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:59:30,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753946504] [2020-01-16 18:59:30,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:30,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:30,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237324734] [2020-01-16 18:59:30,366 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:30,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:30,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:30,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:30,367 INFO L87 Difference]: Start difference. First operand 349 states and 1103 transitions. Second operand 8 states. [2020-01-16 18:59:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:30,456 INFO L93 Difference]: Finished difference Result 642 states and 1768 transitions. [2020-01-16 18:59:30,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:30,456 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:30,458 INFO L225 Difference]: With dead ends: 642 [2020-01-16 18:59:30,458 INFO L226 Difference]: Without dead ends: 597 [2020-01-16 18:59:30,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:59:30,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-01-16 18:59:30,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2020-01-16 18:59:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-01-16 18:59:30,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1078 transitions. [2020-01-16 18:59:30,466 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1078 transitions. Word has length 19 [2020-01-16 18:59:30,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:30,466 INFO L478 AbstractCegarLoop]: Abstraction has 337 states and 1078 transitions. [2020-01-16 18:59:30,466 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:30,466 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1078 transitions. [2020-01-16 18:59:30,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:30,467 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:30,467 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:30,467 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:59:30,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:30,467 INFO L82 PathProgramCache]: Analyzing trace with hash 458482122, now seen corresponding path program 73 times [2020-01-16 18:59:30,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:30,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225610208] [2020-01-16 18:59:30,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:30,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:59:30,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225610208] [2020-01-16 18:59:30,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:30,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:30,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298071912] [2020-01-16 18:59:30,678 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:30,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:30,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:30,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:30,679 INFO L87 Difference]: Start difference. First operand 337 states and 1078 transitions. Second operand 8 states. [2020-01-16 18:59:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:30,747 INFO L93 Difference]: Finished difference Result 609 states and 1671 transitions. [2020-01-16 18:59:30,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:30,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:30,749 INFO L225 Difference]: With dead ends: 609 [2020-01-16 18:59:30,749 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 18:59:30,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:30,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 18:59:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 346. [2020-01-16 18:59:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-01-16 18:59:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1105 transitions. [2020-01-16 18:59:30,757 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1105 transitions. Word has length 19 [2020-01-16 18:59:30,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:30,757 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 1105 transitions. [2020-01-16 18:59:30,757 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1105 transitions. [2020-01-16 18:59:30,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:30,758 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:30,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:30,758 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:59:30,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:30,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1693244424, now seen corresponding path program 74 times [2020-01-16 18:59:30,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:30,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952825093] [2020-01-16 18:59:30,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59: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:59:30,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952825093] [2020-01-16 18:59:30,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:30,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:30,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484667288] [2020-01-16 18:59:30,998 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:30,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:30,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:30,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:30,998 INFO L87 Difference]: Start difference. First operand 346 states and 1105 transitions. Second operand 8 states. [2020-01-16 18:59:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:31,088 INFO L93 Difference]: Finished difference Result 608 states and 1667 transitions. [2020-01-16 18:59:31,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:31,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:31,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:31,090 INFO L225 Difference]: With dead ends: 608 [2020-01-16 18:59:31,090 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 18:59:31,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:59:31,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 18:59:31,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 343. [2020-01-16 18:59:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-01-16 18:59:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1098 transitions. [2020-01-16 18:59:31,099 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1098 transitions. Word has length 19 [2020-01-16 18:59:31,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:31,100 INFO L478 AbstractCegarLoop]: Abstraction has 343 states and 1098 transitions. [2020-01-16 18:59:31,100 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:31,100 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1098 transitions. [2020-01-16 18:59:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:31,101 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:31,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:59:31,101 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:59:31,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:31,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1552573710, now seen corresponding path program 75 times [2020-01-16 18:59:31,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:31,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370003102] [2020-01-16 18:59:31,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:31,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370003102] [2020-01-16 18:59:31,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:31,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:31,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339468947] [2020-01-16 18:59:31,356 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:31,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:31,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:31,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:31,357 INFO L87 Difference]: Start difference. First operand 343 states and 1098 transitions. Second operand 8 states. [2020-01-16 18:59:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:31,424 INFO L93 Difference]: Finished difference Result 614 states and 1685 transitions. [2020-01-16 18:59:31,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:31,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:31,426 INFO L225 Difference]: With dead ends: 614 [2020-01-16 18:59:31,426 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 18:59:31,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:59:31,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 18:59:31,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 348. [2020-01-16 18:59:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-01-16 18:59:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1107 transitions. [2020-01-16 18:59:31,434 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1107 transitions. Word has length 19 [2020-01-16 18:59:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:31,434 INFO L478 AbstractCegarLoop]: Abstraction has 348 states and 1107 transitions. [2020-01-16 18:59:31,434 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1107 transitions. [2020-01-16 18:59:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:31,435 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:31,435 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:31,435 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:59:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:31,435 INFO L82 PathProgramCache]: Analyzing trace with hash 801511616, now seen corresponding path program 76 times [2020-01-16 18:59:31,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:31,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753115100] [2020-01-16 18:59:31,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:31,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:59:31,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753115100] [2020-01-16 18:59:31,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:31,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:31,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929159310] [2020-01-16 18:59:31,647 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:31,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:31,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:31,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:31,648 INFO L87 Difference]: Start difference. First operand 348 states and 1107 transitions. Second operand 8 states. [2020-01-16 18:59:31,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:31,735 INFO L93 Difference]: Finished difference Result 616 states and 1689 transitions. [2020-01-16 18:59:31,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:31,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:31,737 INFO L225 Difference]: With dead ends: 616 [2020-01-16 18:59:31,737 INFO L226 Difference]: Without dead ends: 578 [2020-01-16 18:59:31,738 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:31,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-01-16 18:59:31,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 343. [2020-01-16 18:59:31,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-01-16 18:59:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1095 transitions. [2020-01-16 18:59:31,746 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1095 transitions. Word has length 19 [2020-01-16 18:59:31,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:31,746 INFO L478 AbstractCegarLoop]: Abstraction has 343 states and 1095 transitions. [2020-01-16 18:59:31,746 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1095 transitions. [2020-01-16 18:59:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:31,747 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:31,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:59:31,747 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:59:31,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:31,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1962158772, now seen corresponding path program 77 times [2020-01-16 18:59:31,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:31,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706869978] [2020-01-16 18:59:31,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:31,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:59:31,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706869978] [2020-01-16 18:59:31,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:31,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:31,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216672410] [2020-01-16 18:59:31,959 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:31,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:31,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:31,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:31,960 INFO L87 Difference]: Start difference. First operand 343 states and 1095 transitions. Second operand 8 states. [2020-01-16 18:59:32,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:32,046 INFO L93 Difference]: Finished difference Result 611 states and 1678 transitions. [2020-01-16 18:59:32,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:32,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:32,048 INFO L225 Difference]: With dead ends: 611 [2020-01-16 18:59:32,048 INFO L226 Difference]: Without dead ends: 581 [2020-01-16 18:59:32,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:59:32,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-01-16 18:59:32,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 347. [2020-01-16 18:59:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-01-16 18:59:32,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1103 transitions. [2020-01-16 18:59:32,056 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1103 transitions. Word has length 19 [2020-01-16 18:59:32,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:32,056 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 1103 transitions. [2020-01-16 18:59:32,056 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1103 transitions. [2020-01-16 18:59:32,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:32,057 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:32,057 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:32,057 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:59:32,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:32,057 INFO L82 PathProgramCache]: Analyzing trace with hash -622195216, now seen corresponding path program 78 times [2020-01-16 18:59:32,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:32,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835215854] [2020-01-16 18:59:32,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:32,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835215854] [2020-01-16 18:59:32,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:32,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:32,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891218211] [2020-01-16 18:59:32,256 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:32,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:32,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:32,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:32,257 INFO L87 Difference]: Start difference. First operand 347 states and 1103 transitions. Second operand 8 states. [2020-01-16 18:59:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:32,375 INFO L93 Difference]: Finished difference Result 614 states and 1684 transitions. [2020-01-16 18:59:32,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:32,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:32,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:32,378 INFO L225 Difference]: With dead ends: 614 [2020-01-16 18:59:32,378 INFO L226 Difference]: Without dead ends: 574 [2020-01-16 18:59:32,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:59:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-01-16 18:59:32,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 340. [2020-01-16 18:59:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-01-16 18:59:32,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1088 transitions. [2020-01-16 18:59:32,393 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1088 transitions. Word has length 19 [2020-01-16 18:59:32,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:32,393 INFO L478 AbstractCegarLoop]: Abstraction has 340 states and 1088 transitions. [2020-01-16 18:59:32,393 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1088 transitions. [2020-01-16 18:59:32,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:32,395 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:32,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:59:32,395 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:59:32,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:32,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1910451096, now seen corresponding path program 79 times [2020-01-16 18:59:32,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:32,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146150298] [2020-01-16 18:59:32,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:32,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:59:32,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146150298] [2020-01-16 18:59:32,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:32,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:32,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052122895] [2020-01-16 18:59:32,665 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:32,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:32,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:32,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:32,665 INFO L87 Difference]: Start difference. First operand 340 states and 1088 transitions. Second operand 8 states. [2020-01-16 18:59:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:32,769 INFO L93 Difference]: Finished difference Result 614 states and 1683 transitions. [2020-01-16 18:59:32,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:32,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:32,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:32,772 INFO L225 Difference]: With dead ends: 614 [2020-01-16 18:59:32,772 INFO L226 Difference]: Without dead ends: 583 [2020-01-16 18:59:32,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:59:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-01-16 18:59:32,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 346. [2020-01-16 18:59:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-01-16 18:59:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1102 transitions. [2020-01-16 18:59:32,787 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1102 transitions. Word has length 19 [2020-01-16 18:59:32,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:32,787 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 1102 transitions. [2020-01-16 18:59:32,787 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:32,788 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1102 transitions. [2020-01-16 18:59:32,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:32,789 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:32,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:59:32,789 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:59:32,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:32,790 INFO L82 PathProgramCache]: Analyzing trace with hash 232789654, now seen corresponding path program 80 times [2020-01-16 18:59:32,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:32,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283998191] [2020-01-16 18:59:32,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:33,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283998191] [2020-01-16 18:59:33,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:33,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:33,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544831977] [2020-01-16 18:59:33,016 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:33,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:33,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:33,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:33,016 INFO L87 Difference]: Start difference. First operand 346 states and 1102 transitions. Second operand 8 states. [2020-01-16 18:59:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:33,095 INFO L93 Difference]: Finished difference Result 613 states and 1679 transitions. [2020-01-16 18:59:33,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:33,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:33,097 INFO L225 Difference]: With dead ends: 613 [2020-01-16 18:59:33,097 INFO L226 Difference]: Without dead ends: 580 [2020-01-16 18:59:33,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:33,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-01-16 18:59:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 343. [2020-01-16 18:59:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-01-16 18:59:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1095 transitions. [2020-01-16 18:59:33,107 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1095 transitions. Word has length 19 [2020-01-16 18:59:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:33,107 INFO L478 AbstractCegarLoop]: Abstraction has 343 states and 1095 transitions. [2020-01-16 18:59:33,107 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1095 transitions. [2020-01-16 18:59:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:33,108 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:33,108 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:33,109 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:59:33,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:33,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1878169934, now seen corresponding path program 81 times [2020-01-16 18:59:33,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:33,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246887551] [2020-01-16 18:59:33,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:33,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:59:33,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246887551] [2020-01-16 18:59:33,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:33,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:33,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108423394] [2020-01-16 18:59:33,308 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:33,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:33,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:33,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:33,308 INFO L87 Difference]: Start difference. First operand 343 states and 1095 transitions. Second operand 8 states. [2020-01-16 18:59:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:33,392 INFO L93 Difference]: Finished difference Result 623 states and 1709 transitions. [2020-01-16 18:59:33,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:33,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:33,393 INFO L225 Difference]: With dead ends: 623 [2020-01-16 18:59:33,393 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 18:59:33,394 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:33,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 18:59:33,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 349. [2020-01-16 18:59:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:59:33,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1106 transitions. [2020-01-16 18:59:33,409 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1106 transitions. Word has length 19 [2020-01-16 18:59:33,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:33,409 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1106 transitions. [2020-01-16 18:59:33,409 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:33,409 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1106 transitions. [2020-01-16 18:59:33,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:33,410 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:33,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:59:33,410 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:59:33,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:33,411 INFO L82 PathProgramCache]: Analyzing trace with hash 901965184, now seen corresponding path program 82 times [2020-01-16 18:59:33,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:33,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103876008] [2020-01-16 18:59:33,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:33,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103876008] [2020-01-16 18:59:33,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:33,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:33,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689347877] [2020-01-16 18:59:33,660 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:33,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:33,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:33,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:33,660 INFO L87 Difference]: Start difference. First operand 349 states and 1106 transitions. Second operand 8 states. [2020-01-16 18:59:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:33,740 INFO L93 Difference]: Finished difference Result 628 states and 1721 transitions. [2020-01-16 18:59:33,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:33,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:33,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:33,742 INFO L225 Difference]: With dead ends: 628 [2020-01-16 18:59:33,742 INFO L226 Difference]: Without dead ends: 586 [2020-01-16 18:59:33,742 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-01-16 18:59:33,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 343. [2020-01-16 18:59:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-01-16 18:59:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1092 transitions. [2020-01-16 18:59:33,750 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1092 transitions. Word has length 19 [2020-01-16 18:59:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:33,750 INFO L478 AbstractCegarLoop]: Abstraction has 343 states and 1092 transitions. [2020-01-16 18:59:33,750 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:33,750 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1092 transitions. [2020-01-16 18:59:33,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:33,751 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:33,751 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:33,751 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:59:33,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:33,752 INFO L82 PathProgramCache]: Analyzing trace with hash 348431156, now seen corresponding path program 83 times [2020-01-16 18:59:33,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:33,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63536251] [2020-01-16 18:59:33,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:33,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:59:33,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63536251] [2020-01-16 18:59:33,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:33,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:33,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317396558] [2020-01-16 18:59:33,947 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:33,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:33,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:33,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:33,948 INFO L87 Difference]: Start difference. First operand 343 states and 1092 transitions. Second operand 8 states. [2020-01-16 18:59:34,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:34,046 INFO L93 Difference]: Finished difference Result 620 states and 1702 transitions. [2020-01-16 18:59:34,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:34,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:34,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:34,048 INFO L225 Difference]: With dead ends: 620 [2020-01-16 18:59:34,048 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 18:59:34,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:59:34,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 18:59:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 348. [2020-01-16 18:59:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-01-16 18:59:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1102 transitions. [2020-01-16 18:59:34,056 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1102 transitions. Word has length 19 [2020-01-16 18:59:34,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:34,056 INFO L478 AbstractCegarLoop]: Abstraction has 348 states and 1102 transitions. [2020-01-16 18:59:34,056 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1102 transitions. [2020-01-16 18:59:34,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:34,057 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:34,057 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:34,057 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:59:34,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:34,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1380616178, now seen corresponding path program 84 times [2020-01-16 18:59:34,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:34,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661290660] [2020-01-16 18:59:34,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:34,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661290660] [2020-01-16 18:59:34,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:34,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:34,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160020920] [2020-01-16 18:59:34,245 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:34,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:34,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:34,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:34,245 INFO L87 Difference]: Start difference. First operand 348 states and 1102 transitions. Second operand 8 states. [2020-01-16 18:59:34,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:34,339 INFO L93 Difference]: Finished difference Result 626 states and 1716 transitions. [2020-01-16 18:59:34,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:34,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:34,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:34,341 INFO L225 Difference]: With dead ends: 626 [2020-01-16 18:59:34,341 INFO L226 Difference]: Without dead ends: 582 [2020-01-16 18:59:34,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:59:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-01-16 18:59:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 340. [2020-01-16 18:59:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-01-16 18:59:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1085 transitions. [2020-01-16 18:59:34,348 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1085 transitions. Word has length 19 [2020-01-16 18:59:34,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:34,348 INFO L478 AbstractCegarLoop]: Abstraction has 340 states and 1085 transitions. [2020-01-16 18:59:34,348 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1085 transitions. [2020-01-16 18:59:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:34,349 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:34,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:59:34,349 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:59:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:34,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1259258648, now seen corresponding path program 85 times [2020-01-16 18:59:34,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:34,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254381165] [2020-01-16 18:59:34,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:34,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254381165] [2020-01-16 18:59:34,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:34,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:34,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957722088] [2020-01-16 18:59:34,571 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:34,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:34,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:34,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:34,572 INFO L87 Difference]: Start difference. First operand 340 states and 1085 transitions. Second operand 8 states. [2020-01-16 18:59:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:34,661 INFO L93 Difference]: Finished difference Result 629 states and 1736 transitions. [2020-01-16 18:59:34,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:34,662 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:34,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:34,663 INFO L225 Difference]: With dead ends: 629 [2020-01-16 18:59:34,663 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 18:59:34,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:34,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 18:59:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 350. [2020-01-16 18:59:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-01-16 18:59:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1113 transitions. [2020-01-16 18:59:34,671 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1113 transitions. Word has length 19 [2020-01-16 18:59:34,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:34,671 INFO L478 AbstractCegarLoop]: Abstraction has 350 states and 1113 transitions. [2020-01-16 18:59:34,671 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1113 transitions. [2020-01-16 18:59:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:34,672 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:34,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:59:34,672 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:59:34,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:34,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2010320742, now seen corresponding path program 86 times [2020-01-16 18:59:34,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:34,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780732938] [2020-01-16 18:59:34,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:34,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:59:34,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780732938] [2020-01-16 18:59:34,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:34,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:34,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788131701] [2020-01-16 18:59:34,929 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:34,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:34,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:34,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:34,930 INFO L87 Difference]: Start difference. First operand 350 states and 1113 transitions. Second operand 8 states. [2020-01-16 18:59:35,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:35,017 INFO L93 Difference]: Finished difference Result 631 states and 1740 transitions. [2020-01-16 18:59:35,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:35,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:35,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:35,019 INFO L225 Difference]: With dead ends: 631 [2020-01-16 18:59:35,019 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 18:59:35,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:59:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 18:59:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 345. [2020-01-16 18:59:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:59:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1099 transitions. [2020-01-16 18:59:35,027 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1099 transitions. Word has length 19 [2020-01-16 18:59:35,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:35,027 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1099 transitions. [2020-01-16 18:59:35,027 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:35,027 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1099 transitions. [2020-01-16 18:59:35,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:35,028 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:35,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:35,028 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:59:35,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:35,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1435270794, now seen corresponding path program 87 times [2020-01-16 18:59:35,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:35,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716401216] [2020-01-16 18:59:35,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:35,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:35,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716401216] [2020-01-16 18:59:35,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:35,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:35,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975292071] [2020-01-16 18:59:35,238 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:35,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:35,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:35,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:35,239 INFO L87 Difference]: Start difference. First operand 345 states and 1099 transitions. Second operand 8 states. [2020-01-16 18:59:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:35,315 INFO L93 Difference]: Finished difference Result 633 states and 1743 transitions. [2020-01-16 18:59:35,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:35,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:35,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:35,317 INFO L225 Difference]: With dead ends: 633 [2020-01-16 18:59:35,318 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 18:59:35,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:59:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 18:59:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 351. [2020-01-16 18:59:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-01-16 18:59:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1110 transitions. [2020-01-16 18:59:35,327 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1110 transitions. Word has length 19 [2020-01-16 18:59:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:35,327 INFO L478 AbstractCegarLoop]: Abstraction has 351 states and 1110 transitions. [2020-01-16 18:59:35,327 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1110 transitions. [2020-01-16 18:59:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:35,328 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:35,328 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:35,329 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:59:35,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:35,329 INFO L82 PathProgramCache]: Analyzing trace with hash 459066044, now seen corresponding path program 88 times [2020-01-16 18:59:35,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:35,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291785422] [2020-01-16 18:59:35,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:35,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:59:35,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291785422] [2020-01-16 18:59:35,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:35,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:35,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091745403] [2020-01-16 18:59:35,567 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:35,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:35,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:35,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:35,567 INFO L87 Difference]: Start difference. First operand 351 states and 1110 transitions. Second operand 8 states. [2020-01-16 18:59:35,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:35,685 INFO L93 Difference]: Finished difference Result 638 states and 1755 transitions. [2020-01-16 18:59:35,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:35,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:35,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:35,688 INFO L225 Difference]: With dead ends: 638 [2020-01-16 18:59:35,688 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 18:59:35,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:59:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 18:59:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 345. [2020-01-16 18:59:35,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:59:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1094 transitions. [2020-01-16 18:59:35,700 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1094 transitions. Word has length 19 [2020-01-16 18:59:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:35,700 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1094 transitions. [2020-01-16 18:59:35,700 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1094 transitions. [2020-01-16 18:59:35,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:35,701 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:35,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:59:35,702 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:59:35,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:35,702 INFO L82 PathProgramCache]: Analyzing trace with hash 2087070376, now seen corresponding path program 89 times [2020-01-16 18:59:35,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:35,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868699878] [2020-01-16 18:59:35,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:35,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868699878] [2020-01-16 18:59:35,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:35,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:35,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430778578] [2020-01-16 18:59:35,924 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:35,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:35,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:35,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:35,925 INFO L87 Difference]: Start difference. First operand 345 states and 1094 transitions. Second operand 8 states. [2020-01-16 18:59:36,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:36,001 INFO L93 Difference]: Finished difference Result 639 states and 1767 transitions. [2020-01-16 18:59:36,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:36,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:36,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:36,002 INFO L225 Difference]: With dead ends: 639 [2020-01-16 18:59:36,002 INFO L226 Difference]: Without dead ends: 606 [2020-01-16 18:59:36,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:36,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-01-16 18:59:36,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 353. [2020-01-16 18:59:36,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-01-16 18:59:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1114 transitions. [2020-01-16 18:59:36,014 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1114 transitions. Word has length 19 [2020-01-16 18:59:36,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:36,014 INFO L478 AbstractCegarLoop]: Abstraction has 353 states and 1114 transitions. [2020-01-16 18:59:36,014 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:36,014 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1114 transitions. [2020-01-16 18:59:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:36,015 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:36,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:59:36,015 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:59:36,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:36,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1349022390, now seen corresponding path program 90 times [2020-01-16 18:59:36,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:36,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25766229] [2020-01-16 18:59:36,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:36,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:59:36,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25766229] [2020-01-16 18:59:36,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:36,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:36,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926658119] [2020-01-16 18:59:36,226 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:36,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:36,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:36,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:36,226 INFO L87 Difference]: Start difference. First operand 353 states and 1114 transitions. Second operand 8 states. [2020-01-16 18:59:36,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:36,350 INFO L93 Difference]: Finished difference Result 642 states and 1768 transitions. [2020-01-16 18:59:36,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:36,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:36,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:36,352 INFO L225 Difference]: With dead ends: 642 [2020-01-16 18:59:36,352 INFO L226 Difference]: Without dead ends: 593 [2020-01-16 18:59:36,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-01-16 18:59:36,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 340. [2020-01-16 18:59:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-01-16 18:59:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1082 transitions. [2020-01-16 18:59:36,360 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1082 transitions. Word has length 19 [2020-01-16 18:59:36,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:36,360 INFO L478 AbstractCegarLoop]: Abstraction has 340 states and 1082 transitions. [2020-01-16 18:59:36,360 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1082 transitions. [2020-01-16 18:59:36,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:36,361 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:36,361 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:36,361 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:59:36,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:36,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1252078038, now seen corresponding path program 91 times [2020-01-16 18:59:36,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:36,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043602225] [2020-01-16 18:59:36,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:36,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:59:36,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043602225] [2020-01-16 18:59:36,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:36,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:36,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3133196] [2020-01-16 18:59:36,585 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:36,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:36,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:36,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:36,585 INFO L87 Difference]: Start difference. First operand 340 states and 1082 transitions. Second operand 8 states. [2020-01-16 18:59:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:36,679 INFO L93 Difference]: Finished difference Result 622 states and 1721 transitions. [2020-01-16 18:59:36,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:36,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:36,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:36,681 INFO L225 Difference]: With dead ends: 622 [2020-01-16 18:59:36,681 INFO L226 Difference]: Without dead ends: 592 [2020-01-16 18:59:36,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:59:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-01-16 18:59:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 348. [2020-01-16 18:59:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-01-16 18:59:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1106 transitions. [2020-01-16 18:59:36,688 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1106 transitions. Word has length 19 [2020-01-16 18:59:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:36,688 INFO L478 AbstractCegarLoop]: Abstraction has 348 states and 1106 transitions. [2020-01-16 18:59:36,688 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:36,689 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1106 transitions. [2020-01-16 18:59:36,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:36,689 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:36,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:59:36,689 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:59:36,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:36,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1332275950, now seen corresponding path program 92 times [2020-01-16 18:59:36,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:36,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146701513] [2020-01-16 18:59:36,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:36,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146701513] [2020-01-16 18:59:36,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:36,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:36,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622981992] [2020-01-16 18:59:36,904 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:36,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:36,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:36,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:36,905 INFO L87 Difference]: Start difference. First operand 348 states and 1106 transitions. Second operand 8 states. [2020-01-16 18:59:36,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:36,999 INFO L93 Difference]: Finished difference Result 625 states and 1727 transitions. [2020-01-16 18:59:37,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:37,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:37,001 INFO L225 Difference]: With dead ends: 625 [2020-01-16 18:59:37,001 INFO L226 Difference]: Without dead ends: 588 [2020-01-16 18:59:37,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:59:37,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2020-01-16 18:59:37,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 344. [2020-01-16 18:59:37,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-01-16 18:59:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1094 transitions. [2020-01-16 18:59:37,008 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1094 transitions. Word has length 19 [2020-01-16 18:59:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:37,009 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 1094 transitions. [2020-01-16 18:59:37,009 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1094 transitions. [2020-01-16 18:59:37,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:37,009 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:37,010 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:37,010 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:59:37,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:37,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1996780536, now seen corresponding path program 93 times [2020-01-16 18:59:37,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:37,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371027179] [2020-01-16 18:59:37,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:37,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:59:37,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371027179] [2020-01-16 18:59:37,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:37,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:37,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176170965] [2020-01-16 18:59:37,215 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:37,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:37,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:37,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:37,215 INFO L87 Difference]: Start difference. First operand 344 states and 1094 transitions. Second operand 8 states. [2020-01-16 18:59:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:37,328 INFO L93 Difference]: Finished difference Result 626 states and 1729 transitions. [2020-01-16 18:59:37,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:37,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:37,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:37,329 INFO L225 Difference]: With dead ends: 626 [2020-01-16 18:59:37,329 INFO L226 Difference]: Without dead ends: 596 [2020-01-16 18:59:37,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:37,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-01-16 18:59:37,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 349. [2020-01-16 18:59:37,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:59:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1104 transitions. [2020-01-16 18:59:37,336 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1104 transitions. Word has length 19 [2020-01-16 18:59:37,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:37,337 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1104 transitions. [2020-01-16 18:59:37,337 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1104 transitions. [2020-01-16 18:59:37,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:37,337 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:37,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:59:37,338 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:59:37,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:37,339 INFO L82 PathProgramCache]: Analyzing trace with hash 267733202, now seen corresponding path program 94 times [2020-01-16 18:59:37,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:37,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119083843] [2020-01-16 18:59:37,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:37,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:59:37,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119083843] [2020-01-16 18:59:37,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:37,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:37,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647544335] [2020-01-16 18:59:37,547 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:37,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:37,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:37,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:37,548 INFO L87 Difference]: Start difference. First operand 349 states and 1104 transitions. Second operand 8 states. [2020-01-16 18:59:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:37,637 INFO L93 Difference]: Finished difference Result 632 states and 1743 transitions. [2020-01-16 18:59:37,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:37,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:37,639 INFO L225 Difference]: With dead ends: 632 [2020-01-16 18:59:37,640 INFO L226 Difference]: Without dead ends: 591 [2020-01-16 18:59:37,640 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-01-16 18:59:37,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 344. [2020-01-16 18:59:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-01-16 18:59:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1090 transitions. [2020-01-16 18:59:37,649 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1090 transitions. Word has length 19 [2020-01-16 18:59:37,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:37,649 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 1090 transitions. [2020-01-16 18:59:37,649 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1090 transitions. [2020-01-16 18:59:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:37,650 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:37,650 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:37,651 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:59:37,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:37,651 INFO L82 PathProgramCache]: Analyzing trace with hash 901831544, now seen corresponding path program 95 times [2020-01-16 18:59:37,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:37,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694954437] [2020-01-16 18:59:37,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:37,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:59:37,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694954437] [2020-01-16 18:59:37,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:37,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:37,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513578675] [2020-01-16 18:59:37,895 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:37,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:37,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:37,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:37,896 INFO L87 Difference]: Start difference. First operand 344 states and 1090 transitions. Second operand 8 states. [2020-01-16 18:59:37,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:37,979 INFO L93 Difference]: Finished difference Result 635 states and 1758 transitions. [2020-01-16 18:59:37,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:37,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:37,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:37,981 INFO L225 Difference]: With dead ends: 635 [2020-01-16 18:59:37,981 INFO L226 Difference]: Without dead ends: 602 [2020-01-16 18:59:37,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:59:37,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-01-16 18:59:37,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 352. [2020-01-16 18:59:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-01-16 18:59:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1110 transitions. [2020-01-16 18:59:37,989 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1110 transitions. Word has length 19 [2020-01-16 18:59:37,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:37,990 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 1110 transitions. [2020-01-16 18:59:37,990 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:37,990 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1110 transitions. [2020-01-16 18:59:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:37,990 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:37,991 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:37,991 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:59:37,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:37,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1757138198, now seen corresponding path program 96 times [2020-01-16 18:59:37,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:37,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869927798] [2020-01-16 18:59:37,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:38,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:59:38,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869927798] [2020-01-16 18:59:38,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:38,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:38,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643908898] [2020-01-16 18:59:38,215 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:38,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:38,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:38,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:38,215 INFO L87 Difference]: Start difference. First operand 352 states and 1110 transitions. Second operand 8 states. [2020-01-16 18:59:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:38,316 INFO L93 Difference]: Finished difference Result 638 states and 1759 transitions. [2020-01-16 18:59:38,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:38,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:38,318 INFO L225 Difference]: With dead ends: 638 [2020-01-16 18:59:38,318 INFO L226 Difference]: Without dead ends: 587 [2020-01-16 18:59:38,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:59:38,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-01-16 18:59:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 337. [2020-01-16 18:59:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-01-16 18:59:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1075 transitions. [2020-01-16 18:59:38,328 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 1075 transitions. Word has length 19 [2020-01-16 18:59:38,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:38,328 INFO L478 AbstractCegarLoop]: Abstraction has 337 states and 1075 transitions. [2020-01-16 18:59:38,328 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 1075 transitions. [2020-01-16 18:59:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:38,329 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:38,330 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:38,330 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:59:38,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:38,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1665827752, now seen corresponding path program 97 times [2020-01-16 18:59:38,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:38,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914735954] [2020-01-16 18:59:38,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:38,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914735954] [2020-01-16 18:59:38,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:38,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:38,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671638087] [2020-01-16 18:59:38,534 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:38,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:38,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:38,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:38,535 INFO L87 Difference]: Start difference. First operand 337 states and 1075 transitions. Second operand 8 states. [2020-01-16 18:59:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:38,618 INFO L93 Difference]: Finished difference Result 676 states and 1927 transitions. [2020-01-16 18:59:38,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:38,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:38,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:38,621 INFO L225 Difference]: With dead ends: 676 [2020-01-16 18:59:38,621 INFO L226 Difference]: Without dead ends: 636 [2020-01-16 18:59:38,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:38,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2020-01-16 18:59:38,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 351. [2020-01-16 18:59:38,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-01-16 18:59:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1123 transitions. [2020-01-16 18:59:38,629 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1123 transitions. Word has length 19 [2020-01-16 18:59:38,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:38,629 INFO L478 AbstractCegarLoop]: Abstraction has 351 states and 1123 transitions. [2020-01-16 18:59:38,630 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:38,630 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1123 transitions. [2020-01-16 18:59:38,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:38,631 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:38,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:59:38,631 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:59:38,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:38,631 INFO L82 PathProgramCache]: Analyzing trace with hash 791492426, now seen corresponding path program 98 times [2020-01-16 18:59:38,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:38,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977714567] [2020-01-16 18:59:38,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:38,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977714567] [2020-01-16 18:59:38,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:38,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:38,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399304766] [2020-01-16 18:59:38,817 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:38,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:38,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:38,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:38,818 INFO L87 Difference]: Start difference. First operand 351 states and 1123 transitions. Second operand 8 states. [2020-01-16 18:59:38,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:38,904 INFO L93 Difference]: Finished difference Result 666 states and 1890 transitions. [2020-01-16 18:59:38,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:38,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:38,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:38,906 INFO L225 Difference]: With dead ends: 666 [2020-01-16 18:59:38,906 INFO L226 Difference]: Without dead ends: 630 [2020-01-16 18:59:38,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:38,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-01-16 18:59:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 345. [2020-01-16 18:59:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:59:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1107 transitions. [2020-01-16 18:59:38,915 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1107 transitions. Word has length 19 [2020-01-16 18:59:38,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:38,915 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1107 transitions. [2020-01-16 18:59:38,916 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1107 transitions. [2020-01-16 18:59:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:38,916 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:38,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:59:38,917 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:59:38,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:38,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1139734548, now seen corresponding path program 99 times [2020-01-16 18:59:38,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:38,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026769206] [2020-01-16 18:59:38,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:39,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026769206] [2020-01-16 18:59:39,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:39,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:39,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376105403] [2020-01-16 18:59:39,105 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:39,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:39,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:39,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:39,106 INFO L87 Difference]: Start difference. First operand 345 states and 1107 transitions. Second operand 8 states. [2020-01-16 18:59:39,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:39,190 INFO L93 Difference]: Finished difference Result 682 states and 1946 transitions. [2020-01-16 18:59:39,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:39,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:39,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:39,192 INFO L225 Difference]: With dead ends: 682 [2020-01-16 18:59:39,192 INFO L226 Difference]: Without dead ends: 642 [2020-01-16 18:59:39,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-01-16 18:59:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 354. [2020-01-16 18:59:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-01-16 18:59:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1129 transitions. [2020-01-16 18:59:39,200 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1129 transitions. Word has length 19 [2020-01-16 18:59:39,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:39,200 INFO L478 AbstractCegarLoop]: Abstraction has 354 states and 1129 transitions. [2020-01-16 18:59:39,200 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:39,201 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1129 transitions. [2020-01-16 18:59:39,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:39,201 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:39,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:59:39,201 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:59:39,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:39,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1885031692, now seen corresponding path program 100 times [2020-01-16 18:59:39,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:39,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669887445] [2020-01-16 18:59:39,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:39,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669887445] [2020-01-16 18:59:39,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:39,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:39,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763231134] [2020-01-16 18:59:39,395 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:39,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:39,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:39,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:39,396 INFO L87 Difference]: Start difference. First operand 354 states and 1129 transitions. Second operand 8 states. [2020-01-16 18:59:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:39,514 INFO L93 Difference]: Finished difference Result 675 states and 1916 transitions. [2020-01-16 18:59:39,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:39,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:39,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:39,515 INFO L225 Difference]: With dead ends: 675 [2020-01-16 18:59:39,515 INFO L226 Difference]: Without dead ends: 633 [2020-01-16 18:59: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:59:39,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-01-16 18:59:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 345. [2020-01-16 18:59:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:59:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1103 transitions. [2020-01-16 18:59:39,522 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1103 transitions. Word has length 19 [2020-01-16 18:59:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:39,522 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1103 transitions. [2020-01-16 18:59:39,523 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:39,523 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1103 transitions. [2020-01-16 18:59:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:39,523 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:39,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:59:39,523 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:59:39,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:39,524 INFO L82 PathProgramCache]: Analyzing trace with hash 220037620, now seen corresponding path program 101 times [2020-01-16 18:59:39,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:39,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194289333] [2020-01-16 18:59:39,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:39,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:59:39,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194289333] [2020-01-16 18:59:39,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:39,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:39,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108757386] [2020-01-16 18:59:39,719 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:39,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:39,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:39,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:39,720 INFO L87 Difference]: Start difference. First operand 345 states and 1103 transitions. Second operand 8 states. [2020-01-16 18:59:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:39,802 INFO L93 Difference]: Finished difference Result 657 states and 1861 transitions. [2020-01-16 18:59:39,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:39,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:39,805 INFO L225 Difference]: With dead ends: 657 [2020-01-16 18:59:39,805 INFO L226 Difference]: Without dead ends: 627 [2020-01-16 18:59:39,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:59:39,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-01-16 18:59:39,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 349. [2020-01-16 18:59:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:59:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1111 transitions. [2020-01-16 18:59:39,812 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1111 transitions. Word has length 19 [2020-01-16 18:59:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:39,812 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1111 transitions. [2020-01-16 18:59:39,812 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1111 transitions. [2020-01-16 18:59:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:39,813 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:39,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:59:39,813 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:59:39,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:39,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1930650928, now seen corresponding path program 102 times [2020-01-16 18:59:39,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:39,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742488662] [2020-01-16 18:59:39,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:40,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:59:40,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742488662] [2020-01-16 18:59:40,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:40,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:40,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045670473] [2020-01-16 18:59:40,028 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:40,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:40,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:40,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:40,028 INFO L87 Difference]: Start difference. First operand 349 states and 1111 transitions. Second operand 8 states. [2020-01-16 18:59:40,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:40,117 INFO L93 Difference]: Finished difference Result 660 states and 1867 transitions. [2020-01-16 18:59:40,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:40,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:40,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:40,119 INFO L225 Difference]: With dead ends: 660 [2020-01-16 18:59:40,119 INFO L226 Difference]: Without dead ends: 619 [2020-01-16 18:59:40,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:59:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-01-16 18:59:40,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 341. [2020-01-16 18:59:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:59:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1091 transitions. [2020-01-16 18:59:40,127 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1091 transitions. Word has length 19 [2020-01-16 18:59:40,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:40,127 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1091 transitions. [2020-01-16 18:59:40,128 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:40,128 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1091 transitions. [2020-01-16 18:59:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:40,128 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:40,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:59:40,128 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:59:40,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:40,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1018198586, now seen corresponding path program 103 times [2020-01-16 18:59:40,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:40,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547632427] [2020-01-16 18:59:40,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:40,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547632427] [2020-01-16 18:59:40,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:40,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:40,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627868440] [2020-01-16 18:59:40,318 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:40,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:40,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:40,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:40,318 INFO L87 Difference]: Start difference. First operand 341 states and 1091 transitions. Second operand 8 states. [2020-01-16 18:59:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:40,413 INFO L93 Difference]: Finished difference Result 684 states and 1951 transitions. [2020-01-16 18:59:40,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:40,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:40,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:40,415 INFO L225 Difference]: With dead ends: 684 [2020-01-16 18:59:40,415 INFO L226 Difference]: Without dead ends: 644 [2020-01-16 18:59:40,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:59:40,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-01-16 18:59:40,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 352. [2020-01-16 18:59:40,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2020-01-16 18:59:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1123 transitions. [2020-01-16 18:59:40,423 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 1123 transitions. Word has length 19 [2020-01-16 18:59:40,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:40,423 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 1123 transitions. [2020-01-16 18:59:40,423 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 1123 transitions. [2020-01-16 18:59:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:40,424 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:40,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:59:40,424 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:59:40,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:40,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1892533912, now seen corresponding path program 104 times [2020-01-16 18:59:40,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:40,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038583213] [2020-01-16 18:59:40,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:40,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038583213] [2020-01-16 18:59:40,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:40,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:40,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216718024] [2020-01-16 18:59:40,638 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:40,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:40,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:40,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:40,639 INFO L87 Difference]: Start difference. First operand 352 states and 1123 transitions. Second operand 8 states. [2020-01-16 18:59:40,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:40,725 INFO L93 Difference]: Finished difference Result 674 states and 1914 transitions. [2020-01-16 18:59:40,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:40,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:40,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:40,726 INFO L225 Difference]: With dead ends: 674 [2020-01-16 18:59:40,727 INFO L226 Difference]: Without dead ends: 638 [2020-01-16 18:59:40,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:59:40,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-01-16 18:59:40,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 346. [2020-01-16 18:59:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-01-16 18:59:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1106 transitions. [2020-01-16 18:59:40,739 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1106 transitions. Word has length 19 [2020-01-16 18:59:40,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:40,740 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 1106 transitions. [2020-01-16 18:59:40,740 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1106 transitions. [2020-01-16 18:59:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:40,744 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:40,745 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:40,746 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:59:40,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:40,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1215908908, now seen corresponding path program 105 times [2020-01-16 18:59:40,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:40,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826733214] [2020-01-16 18:59:40,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:40,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:59:40,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826733214] [2020-01-16 18:59:40,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:40,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:40,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622153781] [2020-01-16 18:59:40,937 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:40,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:40,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:40,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:40,938 INFO L87 Difference]: Start difference. First operand 346 states and 1106 transitions. Second operand 8 states. [2020-01-16 18:59:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:41,029 INFO L93 Difference]: Finished difference Result 696 states and 1990 transitions. [2020-01-16 18:59:41,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:41,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:41,031 INFO L225 Difference]: With dead ends: 696 [2020-01-16 18:59:41,031 INFO L226 Difference]: Without dead ends: 656 [2020-01-16 18:59:41,031 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:59:41,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-01-16 18:59:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 358. [2020-01-16 18:59:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2020-01-16 18:59:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1137 transitions. [2020-01-16 18:59:41,041 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 1137 transitions. Word has length 19 [2020-01-16 18:59:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:41,041 INFO L478 AbstractCegarLoop]: Abstraction has 358 states and 1137 transitions. [2020-01-16 18:59:41,041 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 1137 transitions. [2020-01-16 18:59:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:41,042 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:41,042 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:41,043 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:59:41,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:41,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2110174348, now seen corresponding path program 106 times [2020-01-16 18:59:41,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:41,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769448162] [2020-01-16 18:59:41,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:41,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769448162] [2020-01-16 18:59:41,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:41,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:41,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963324262] [2020-01-16 18:59:41,241 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:41,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:41,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:41,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:41,241 INFO L87 Difference]: Start difference. First operand 358 states and 1137 transitions. Second operand 8 states. [2020-01-16 18:59:41,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:41,337 INFO L93 Difference]: Finished difference Result 692 states and 1966 transitions. [2020-01-16 18:59:41,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:41,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:41,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:41,339 INFO L225 Difference]: With dead ends: 692 [2020-01-16 18:59:41,339 INFO L226 Difference]: Without dead ends: 644 [2020-01-16 18:59:41,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-01-16 18:59:41,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 346. [2020-01-16 18:59:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-01-16 18:59:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1101 transitions. [2020-01-16 18:59:41,346 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1101 transitions. Word has length 19 [2020-01-16 18:59:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:41,346 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 1101 transitions. [2020-01-16 18:59:41,346 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:41,346 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1101 transitions. [2020-01-16 18:59:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:41,347 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:41,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:41,347 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:59:41,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:41,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1719286220, now seen corresponding path program 107 times [2020-01-16 18:59:41,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:41,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251355371] [2020-01-16 18:59:41,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:41,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:59:41,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251355371] [2020-01-16 18:59:41,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:41,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:41,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298914395] [2020-01-16 18:59:41,536 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:41,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:41,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:41,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:41,536 INFO L87 Difference]: Start difference. First operand 346 states and 1101 transitions. Second operand 8 states. [2020-01-16 18:59:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:41,619 INFO L93 Difference]: Finished difference Result 669 states and 1895 transitions. [2020-01-16 18:59:41,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:41,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:41,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:41,621 INFO L225 Difference]: With dead ends: 669 [2020-01-16 18:59:41,622 INFO L226 Difference]: Without dead ends: 639 [2020-01-16 18:59:41,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2020-01-16 18:59:41,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 351. [2020-01-16 18:59:41,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2020-01-16 18:59:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1111 transitions. [2020-01-16 18:59:41,629 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 1111 transitions. Word has length 19 [2020-01-16 18:59:41,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:41,629 INFO L478 AbstractCegarLoop]: Abstraction has 351 states and 1111 transitions. [2020-01-16 18:59:41,629 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 1111 transitions. [2020-01-16 18:59:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:41,630 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:41,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:59:41,630 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:59:41,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:41,630 INFO L82 PathProgramCache]: Analyzing trace with hash 846633742, now seen corresponding path program 108 times [2020-01-16 18:59:41,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:41,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381718424] [2020-01-16 18:59:41,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:41,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:59:41,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381718424] [2020-01-16 18:59:41,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:41,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:41,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876140396] [2020-01-16 18:59:41,840 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:41,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:41,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:41,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:41,840 INFO L87 Difference]: Start difference. First operand 351 states and 1111 transitions. Second operand 8 states. [2020-01-16 18:59:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:41,924 INFO L93 Difference]: Finished difference Result 675 states and 1909 transitions. [2020-01-16 18:59:41,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:41,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:41,926 INFO L225 Difference]: With dead ends: 675 [2020-01-16 18:59:41,926 INFO L226 Difference]: Without dead ends: 629 [2020-01-16 18:59:41,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:41,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-01-16 18:59:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 341. [2020-01-16 18:59:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:59:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1087 transitions. [2020-01-16 18:59:41,934 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1087 transitions. Word has length 19 [2020-01-16 18:59:41,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:41,934 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1087 transitions. [2020-01-16 18:59:41,934 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1087 transitions. [2020-01-16 18:59:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:41,935 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:41,935 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:41,935 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:59:41,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:41,935 INFO L82 PathProgramCache]: Analyzing trace with hash -601878970, now seen corresponding path program 109 times [2020-01-16 18:59:41,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:41,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86143522] [2020-01-16 18:59:41,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:42,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:42,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86143522] [2020-01-16 18:59:42,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:42,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:42,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61183359] [2020-01-16 18:59:42,139 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:42,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:42,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:42,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:42,140 INFO L87 Difference]: Start difference. First operand 341 states and 1087 transitions. Second operand 8 states. [2020-01-16 18:59:42,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:42,222 INFO L93 Difference]: Finished difference Result 702 states and 2022 transitions. [2020-01-16 18:59:42,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:42,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:42,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:42,224 INFO L225 Difference]: With dead ends: 702 [2020-01-16 18:59:42,224 INFO L226 Difference]: Without dead ends: 662 [2020-01-16 18:59:42,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:42,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-01-16 18:59:42,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 358. [2020-01-16 18:59:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2020-01-16 18:59:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1145 transitions. [2020-01-16 18:59:42,233 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 1145 transitions. Word has length 19 [2020-01-16 18:59:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:42,234 INFO L478 AbstractCegarLoop]: Abstraction has 358 states and 1145 transitions. [2020-01-16 18:59:42,234 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 1145 transitions. [2020-01-16 18:59:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:42,234 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:42,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:59:42,235 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:59:42,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:42,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1347176114, now seen corresponding path program 110 times [2020-01-16 18:59:42,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:42,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841568930] [2020-01-16 18:59:42,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:42,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841568930] [2020-01-16 18:59:42,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:42,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:42,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086691294] [2020-01-16 18:59:42,436 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:42,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:42,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:42,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:42,437 INFO L87 Difference]: Start difference. First operand 358 states and 1145 transitions. Second operand 8 states. [2020-01-16 18:59:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:42,522 INFO L93 Difference]: Finished difference Result 695 states and 1992 transitions. [2020-01-16 18:59:42,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:42,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:42,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:42,524 INFO L225 Difference]: With dead ends: 695 [2020-01-16 18:59:42,524 INFO L226 Difference]: Without dead ends: 653 [2020-01-16 18:59:42,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:59:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-01-16 18:59:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 349. [2020-01-16 18:59:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:59:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1115 transitions. [2020-01-16 18:59:42,532 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1115 transitions. Word has length 19 [2020-01-16 18:59:42,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:42,532 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1115 transitions. [2020-01-16 18:59:42,532 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1115 transitions. [2020-01-16 18:59:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:42,533 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:42,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:59:42,533 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:59:42,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:42,534 INFO L82 PathProgramCache]: Analyzing trace with hash 142823528, now seen corresponding path program 111 times [2020-01-16 18:59:42,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:42,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634126112] [2020-01-16 18:59:42,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:42,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:59:42,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634126112] [2020-01-16 18:59:42,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:42,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:42,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741502795] [2020-01-16 18:59:42,749 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:42,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:42,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:42,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:42,749 INFO L87 Difference]: Start difference. First operand 349 states and 1115 transitions. Second operand 8 states. [2020-01-16 18:59:42,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:42,837 INFO L93 Difference]: Finished difference Result 708 states and 2035 transitions. [2020-01-16 18:59:42,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:42,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:42,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:42,839 INFO L225 Difference]: With dead ends: 708 [2020-01-16 18:59:42,839 INFO L226 Difference]: Without dead ends: 668 [2020-01-16 18:59:42,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:59:42,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-01-16 18:59:42,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 361. [2020-01-16 18:59:42,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2020-01-16 18:59:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 1146 transitions. [2020-01-16 18:59:42,846 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 1146 transitions. Word has length 19 [2020-01-16 18:59:42,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:42,846 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 1146 transitions. [2020-01-16 18:59:42,847 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:42,847 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 1146 transitions. [2020-01-16 18:59:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:42,847 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:42,847 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:42,848 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:59:42,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:42,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1111707568, now seen corresponding path program 112 times [2020-01-16 18:59:42,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:42,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693356850] [2020-01-16 18:59:42,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:43,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:59:43,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693356850] [2020-01-16 18:59:43,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:43,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:43,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322804378] [2020-01-16 18:59:43,054 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:43,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:43,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:43,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:43,055 INFO L87 Difference]: Start difference. First operand 361 states and 1146 transitions. Second operand 8 states. [2020-01-16 18:59:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:43,146 INFO L93 Difference]: Finished difference Result 704 states and 2011 transitions. [2020-01-16 18:59:43,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:43,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:43,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:43,148 INFO L225 Difference]: With dead ends: 704 [2020-01-16 18:59:43,148 INFO L226 Difference]: Without dead ends: 656 [2020-01-16 18:59:43,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:59:43,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-01-16 18:59:43,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 349. [2020-01-16 18:59:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:59:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1107 transitions. [2020-01-16 18:59:43,156 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1107 transitions. Word has length 19 [2020-01-16 18:59:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:43,156 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1107 transitions. [2020-01-16 18:59:43,156 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1107 transitions. [2020-01-16 18:59:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:43,157 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:43,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:59:43,157 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:59:43,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:43,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1376541946, now seen corresponding path program 113 times [2020-01-16 18:59:43,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:43,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974396160] [2020-01-16 18:59:43,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:43,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974396160] [2020-01-16 18:59:43,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:43,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:43,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076178013] [2020-01-16 18:59:43,388 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:43,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:43,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:43,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:43,388 INFO L87 Difference]: Start difference. First operand 349 states and 1107 transitions. Second operand 8 states. [2020-01-16 18:59:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:43,474 INFO L93 Difference]: Finished difference Result 690 states and 1970 transitions. [2020-01-16 18:59:43,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:43,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:43,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:43,476 INFO L225 Difference]: With dead ends: 690 [2020-01-16 18:59:43,476 INFO L226 Difference]: Without dead ends: 657 [2020-01-16 18:59:43,476 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:43,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-01-16 18:59:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 357. [2020-01-16 18:59:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2020-01-16 18:59:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 1127 transitions. [2020-01-16 18:59:43,483 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 1127 transitions. Word has length 19 [2020-01-16 18:59:43,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:43,484 INFO L478 AbstractCegarLoop]: Abstraction has 357 states and 1127 transitions. [2020-01-16 18:59:43,484 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 1127 transitions. [2020-01-16 18:59:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:43,484 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:43,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:59:43,485 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:59:43,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:43,485 INFO L82 PathProgramCache]: Analyzing trace with hash -517667416, now seen corresponding path program 114 times [2020-01-16 18:59:43,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:43,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616185040] [2020-01-16 18:59:43,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:43,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:59:43,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616185040] [2020-01-16 18:59:43,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:43,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:43,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119108984] [2020-01-16 18:59:43,700 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:43,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:43,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:43,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:43,700 INFO L87 Difference]: Start difference. First operand 357 states and 1127 transitions. Second operand 8 states. [2020-01-16 18:59:43,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:43,788 INFO L93 Difference]: Finished difference Result 693 states and 1971 transitions. [2020-01-16 18:59:43,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:43,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:43,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:43,790 INFO L225 Difference]: With dead ends: 693 [2020-01-16 18:59:43,790 INFO L226 Difference]: Without dead ends: 641 [2020-01-16 18:59:43,790 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:43,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-01-16 18:59:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 341. [2020-01-16 18:59:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:59:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1083 transitions. [2020-01-16 18:59:43,798 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1083 transitions. Word has length 19 [2020-01-16 18:59:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:43,798 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1083 transitions. [2020-01-16 18:59:43,798 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1083 transitions. [2020-01-16 18:59:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:43,799 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:43,799 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:43,799 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:59:43,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:43,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1295748776, now seen corresponding path program 115 times [2020-01-16 18:59:43,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:43,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362018581] [2020-01-16 18:59:43,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:43,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:44,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362018581] [2020-01-16 18:59:44,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:44,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:44,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052573203] [2020-01-16 18:59:44,001 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:44,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:44,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:44,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:44,001 INFO L87 Difference]: Start difference. First operand 341 states and 1083 transitions. Second operand 8 states. [2020-01-16 18:59:44,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:44,085 INFO L93 Difference]: Finished difference Result 651 states and 1839 transitions. [2020-01-16 18:59:44,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:44,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:44,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:44,087 INFO L225 Difference]: With dead ends: 651 [2020-01-16 18:59:44,087 INFO L226 Difference]: Without dead ends: 621 [2020-01-16 18:59:44,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:44,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2020-01-16 18:59:44,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 349. [2020-01-16 18:59:44,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2020-01-16 18:59:44,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1107 transitions. [2020-01-16 18:59:44,095 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1107 transitions. Word has length 19 [2020-01-16 18:59:44,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:44,095 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 1107 transitions. [2020-01-16 18:59:44,095 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1107 transitions. [2020-01-16 18:59:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:44,096 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:44,096 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:44,096 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:59:44,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:44,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1288605212, now seen corresponding path program 116 times [2020-01-16 18:59:44,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:44,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925594675] [2020-01-16 18:59:44,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:44,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925594675] [2020-01-16 18:59:44,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:44,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:44,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733082945] [2020-01-16 18:59:44,337 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:44,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:44,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:44,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:44,337 INFO L87 Difference]: Start difference. First operand 349 states and 1107 transitions. Second operand 8 states. [2020-01-16 18:59:44,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:44,420 INFO L93 Difference]: Finished difference Result 654 states and 1845 transitions. [2020-01-16 18:59:44,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:44,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:44,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:44,422 INFO L225 Difference]: With dead ends: 654 [2020-01-16 18:59:44,422 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 18:59:44,423 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 18:59:44,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 345. [2020-01-16 18:59:44,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:59:44,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1095 transitions. [2020-01-16 18:59:44,429 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1095 transitions. Word has length 19 [2020-01-16 18:59:44,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:44,429 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1095 transitions. [2020-01-16 18:59:44,429 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1095 transitions. [2020-01-16 18:59:44,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:44,430 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:44,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:59:44,430 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:59:44,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:44,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2040451274, now seen corresponding path program 117 times [2020-01-16 18:59:44,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:44,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429638860] [2020-01-16 18:59:44,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:44,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429638860] [2020-01-16 18:59:44,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:44,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:44,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785972206] [2020-01-16 18:59:44,658 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:44,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:44,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:44,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:44,658 INFO L87 Difference]: Start difference. First operand 345 states and 1095 transitions. Second operand 8 states. [2020-01-16 18:59:44,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:44,745 INFO L93 Difference]: Finished difference Result 655 states and 1847 transitions. [2020-01-16 18:59:44,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:44,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:44,746 INFO L225 Difference]: With dead ends: 655 [2020-01-16 18:59:44,746 INFO L226 Difference]: Without dead ends: 625 [2020-01-16 18:59:44,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:59:44,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-01-16 18:59:44,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 350. [2020-01-16 18:59:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-01-16 18:59:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1105 transitions. [2020-01-16 18:59:44,754 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1105 transitions. Word has length 19 [2020-01-16 18:59:44,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:44,754 INFO L478 AbstractCegarLoop]: Abstraction has 350 states and 1105 transitions. [2020-01-16 18:59:44,754 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:44,754 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1105 transitions. [2020-01-16 18:59:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:44,755 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:44,755 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:44,755 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:59:44,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:44,755 INFO L82 PathProgramCache]: Analyzing trace with hash 311403940, now seen corresponding path program 118 times [2020-01-16 18:59:44,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:44,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087841074] [2020-01-16 18:59:44,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:44,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087841074] [2020-01-16 18:59:44,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:44,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:44,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275017480] [2020-01-16 18:59:44,956 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:44,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:44,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:44,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:44,957 INFO L87 Difference]: Start difference. First operand 350 states and 1105 transitions. Second operand 8 states. [2020-01-16 18:59:45,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:45,045 INFO L93 Difference]: Finished difference Result 661 states and 1861 transitions. [2020-01-16 18:59:45,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:45,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:45,047 INFO L225 Difference]: With dead ends: 661 [2020-01-16 18:59:45,047 INFO L226 Difference]: Without dead ends: 620 [2020-01-16 18:59:45,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-01-16 18:59:45,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 345. [2020-01-16 18:59:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:59:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1091 transitions. [2020-01-16 18:59:45,055 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1091 transitions. Word has length 19 [2020-01-16 18:59:45,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:45,055 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1091 transitions. [2020-01-16 18:59:45,055 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:45,055 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1091 transitions. [2020-01-16 18:59:45,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:45,055 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:45,055 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:45,056 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:59:45,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:45,056 INFO L82 PathProgramCache]: Analyzing trace with hash 945502282, now seen corresponding path program 119 times [2020-01-16 18:59:45,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:45,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289564420] [2020-01-16 18:59:45,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:45,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:45,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289564420] [2020-01-16 18:59:45,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:45,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:45,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263858066] [2020-01-16 18:59:45,277 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:45,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:45,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:45,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:45,278 INFO L87 Difference]: Start difference. First operand 345 states and 1091 transitions. Second operand 8 states. [2020-01-16 18:59:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:45,359 INFO L93 Difference]: Finished difference Result 664 states and 1876 transitions. [2020-01-16 18:59:45,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:45,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:45,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:45,360 INFO L225 Difference]: With dead ends: 664 [2020-01-16 18:59:45,361 INFO L226 Difference]: Without dead ends: 631 [2020-01-16 18:59:45,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-01-16 18:59:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 353. [2020-01-16 18:59:45,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2020-01-16 18:59:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 1111 transitions. [2020-01-16 18:59:45,368 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 1111 transitions. Word has length 19 [2020-01-16 18:59:45,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:45,368 INFO L478 AbstractCegarLoop]: Abstraction has 353 states and 1111 transitions. [2020-01-16 18:59:45,368 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:45,368 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 1111 transitions. [2020-01-16 18:59:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:45,369 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:45,369 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:45,369 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:59:45,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:45,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1800808936, now seen corresponding path program 120 times [2020-01-16 18:59:45,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:45,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985843019] [2020-01-16 18:59:45,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:45,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985843019] [2020-01-16 18:59:45,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:45,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:45,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421209390] [2020-01-16 18:59:45,588 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:45,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:45,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:45,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:45,589 INFO L87 Difference]: Start difference. First operand 353 states and 1111 transitions. Second operand 8 states. [2020-01-16 18:59:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:45,674 INFO L93 Difference]: Finished difference Result 667 states and 1877 transitions. [2020-01-16 18:59:45,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:45,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:45,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:45,676 INFO L225 Difference]: With dead ends: 667 [2020-01-16 18:59:45,676 INFO L226 Difference]: Without dead ends: 608 [2020-01-16 18:59:45,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:59:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-01-16 18:59:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 330. [2020-01-16 18:59:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-01-16 18:59:45,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1061 transitions. [2020-01-16 18:59:45,684 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1061 transitions. Word has length 19 [2020-01-16 18:59:45,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:45,684 INFO L478 AbstractCegarLoop]: Abstraction has 330 states and 1061 transitions. [2020-01-16 18:59:45,684 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1061 transitions. [2020-01-16 18:59:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:45,684 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:45,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:59:45,685 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:59:45,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:45,685 INFO L82 PathProgramCache]: Analyzing trace with hash 822861400, now seen corresponding path program 121 times [2020-01-16 18:59:45,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:45,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320398306] [2020-01-16 18:59:45,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:45,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:59:45,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320398306] [2020-01-16 18:59:45,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:45,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:45,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732045478] [2020-01-16 18:59:45,913 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:45,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:45,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:45,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:45,914 INFO L87 Difference]: Start difference. First operand 330 states and 1061 transitions. Second operand 8 states. [2020-01-16 18:59:45,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:45,989 INFO L93 Difference]: Finished difference Result 685 states and 1929 transitions. [2020-01-16 18:59:45,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:45,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:45,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:45,991 INFO L225 Difference]: With dead ends: 685 [2020-01-16 18:59:45,991 INFO L226 Difference]: Without dead ends: 654 [2020-01-16 18:59:45,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:45,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2020-01-16 18:59:45,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 346. [2020-01-16 18:59:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-01-16 18:59:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1101 transitions. [2020-01-16 18:59:45,999 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1101 transitions. Word has length 19 [2020-01-16 18:59:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:45,999 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 1101 transitions. [2020-01-16 18:59:45,999 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:45,999 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1101 transitions. [2020-01-16 18:59:46,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:46,000 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:46,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:46,000 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:59:46,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:46,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1197512586, now seen corresponding path program 122 times [2020-01-16 18:59:46,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:46,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150562310] [2020-01-16 18:59:46,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:46,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150562310] [2020-01-16 18:59:46,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:46,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:46,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539605270] [2020-01-16 18:59:46,215 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:46,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:46,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:46,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:46,216 INFO L87 Difference]: Start difference. First operand 346 states and 1101 transitions. Second operand 8 states. [2020-01-16 18:59:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:46,301 INFO L93 Difference]: Finished difference Result 694 states and 1952 transitions. [2020-01-16 18:59:46,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:46,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:46,303 INFO L225 Difference]: With dead ends: 694 [2020-01-16 18:59:46,303 INFO L226 Difference]: Without dead ends: 646 [2020-01-16 18:59:46,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:59:46,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-01-16 18:59:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 338. [2020-01-16 18:59:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-01-16 18:59:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1080 transitions. [2020-01-16 18:59:46,310 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1080 transitions. Word has length 19 [2020-01-16 18:59:46,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:46,310 INFO L478 AbstractCegarLoop]: Abstraction has 338 states and 1080 transitions. [2020-01-16 18:59:46,311 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:46,311 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1080 transitions. [2020-01-16 18:59:46,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:46,311 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:46,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:59:46,311 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:59:46,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:46,312 INFO L82 PathProgramCache]: Analyzing trace with hash 2004251154, now seen corresponding path program 123 times [2020-01-16 18:59:46,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:46,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980716348] [2020-01-16 18:59:46,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59: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:59:46,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980716348] [2020-01-16 18:59:46,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:46,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:46,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537473506] [2020-01-16 18:59:46,542 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:46,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:46,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:46,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:46,543 INFO L87 Difference]: Start difference. First operand 338 states and 1080 transitions. Second operand 8 states. [2020-01-16 18:59:46,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:46,612 INFO L93 Difference]: Finished difference Result 679 states and 1906 transitions. [2020-01-16 18:59:46,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:46,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:46,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:46,614 INFO L225 Difference]: With dead ends: 679 [2020-01-16 18:59:46,614 INFO L226 Difference]: Without dead ends: 648 [2020-01-16 18:59:46,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:59:46,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-01-16 18:59:46,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 344. [2020-01-16 18:59:46,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-01-16 18:59:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1091 transitions. [2020-01-16 18:59:46,621 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1091 transitions. Word has length 19 [2020-01-16 18:59:46,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:46,621 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 1091 transitions. [2020-01-16 18:59:46,621 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1091 transitions. [2020-01-16 18:59:46,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:46,622 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:46,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:59:46,622 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:59:46,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:46,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1028046404, now seen corresponding path program 124 times [2020-01-16 18:59:46,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:46,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022102121] [2020-01-16 18:59:46,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:46,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022102121] [2020-01-16 18:59:46,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:46,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:46,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404784830] [2020-01-16 18:59:46,862 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:46,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:46,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:46,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:46,863 INFO L87 Difference]: Start difference. First operand 344 states and 1091 transitions. Second operand 8 states. [2020-01-16 18:59:46,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:46,954 INFO L93 Difference]: Finished difference Result 684 states and 1918 transitions. [2020-01-16 18:59:46,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:46,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:46,956 INFO L225 Difference]: With dead ends: 684 [2020-01-16 18:59:46,956 INFO L226 Difference]: Without dead ends: 642 [2020-01-16 18:59:46,956 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:46,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2020-01-16 18:59:46,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 338. [2020-01-16 18:59:46,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-01-16 18:59:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1074 transitions. [2020-01-16 18:59:46,965 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1074 transitions. Word has length 19 [2020-01-16 18:59:46,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:46,965 INFO L478 AbstractCegarLoop]: Abstraction has 338 states and 1074 transitions. [2020-01-16 18:59:46,965 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:46,966 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1074 transitions. [2020-01-16 18:59:46,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:46,967 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:46,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:59:46,967 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:59:46,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:46,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1100948602, now seen corresponding path program 125 times [2020-01-16 18:59:46,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:46,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943415547] [2020-01-16 18:59:46,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:47,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:59:47,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943415547] [2020-01-16 18:59:47,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:47,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:47,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467031546] [2020-01-16 18:59:47,185 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:47,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:47,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:47,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:47,186 INFO L87 Difference]: Start difference. First operand 338 states and 1074 transitions. Second operand 8 states. [2020-01-16 18:59:47,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:47,276 INFO L93 Difference]: Finished difference Result 703 states and 1986 transitions. [2020-01-16 18:59:47,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:47,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:47,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:47,279 INFO L225 Difference]: With dead ends: 703 [2020-01-16 18:59:47,279 INFO L226 Difference]: Without dead ends: 663 [2020-01-16 18:59:47,279 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:47,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2020-01-16 18:59:47,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 350. [2020-01-16 18:59:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-01-16 18:59:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1105 transitions. [2020-01-16 18:59:47,287 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1105 transitions. Word has length 19 [2020-01-16 18:59:47,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:47,288 INFO L478 AbstractCegarLoop]: Abstraction has 350 states and 1105 transitions. [2020-01-16 18:59:47,288 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1105 transitions. [2020-01-16 18:59:47,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:47,289 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:47,289 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:47,289 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:59:47,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:47,289 INFO L82 PathProgramCache]: Analyzing trace with hash -242668718, now seen corresponding path program 126 times [2020-01-16 18:59:47,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:47,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699865243] [2020-01-16 18:59:47,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:47,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:59:47,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699865243] [2020-01-16 18:59:47,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:47,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:47,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879238193] [2020-01-16 18:59:47,514 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:47,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:47,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:47,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:47,515 INFO L87 Difference]: Start difference. First operand 350 states and 1105 transitions. Second operand 8 states. [2020-01-16 18:59:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:47,607 INFO L93 Difference]: Finished difference Result 699 states and 1962 transitions. [2020-01-16 18:59:47,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:47,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:47,609 INFO L225 Difference]: With dead ends: 699 [2020-01-16 18:59:47,609 INFO L226 Difference]: Without dead ends: 643 [2020-01-16 18:59:47,610 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-01-16 18:59:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 330. [2020-01-16 18:59:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-01-16 18:59:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1054 transitions. [2020-01-16 18:59:47,617 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1054 transitions. Word has length 19 [2020-01-16 18:59:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:47,617 INFO L478 AbstractCegarLoop]: Abstraction has 330 states and 1054 transitions. [2020-01-16 18:59:47,617 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1054 transitions. [2020-01-16 18:59:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:47,618 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:47,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:59:47,618 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:59:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:47,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1565948490, now seen corresponding path program 127 times [2020-01-16 18:59:47,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:47,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147161964] [2020-01-16 18:59:47,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:47,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:59:47,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147161964] [2020-01-16 18:59:47,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:47,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:47,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979770955] [2020-01-16 18:59:47,840 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:47,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:47,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:47,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:47,840 INFO L87 Difference]: Start difference. First operand 330 states and 1054 transitions. Second operand 8 states. [2020-01-16 18:59:47,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:47,906 INFO L93 Difference]: Finished difference Result 676 states and 1893 transitions. [2020-01-16 18:59:47,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:47,906 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:47,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:47,908 INFO L225 Difference]: With dead ends: 676 [2020-01-16 18:59:47,908 INFO L226 Difference]: Without dead ends: 645 [2020-01-16 18:59:47,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:59:47,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-01-16 18:59:47,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 344. [2020-01-16 18:59:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-01-16 18:59:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1089 transitions. [2020-01-16 18:59:47,915 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1089 transitions. Word has length 19 [2020-01-16 18:59:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:47,915 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 1089 transitions. [2020-01-16 18:59:47,915 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:47,915 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1089 transitions. [2020-01-16 18:59:47,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:47,916 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:47,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:59:47,916 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:59:47,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:47,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1940599676, now seen corresponding path program 128 times [2020-01-16 18:59:47,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:47,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113839634] [2020-01-16 18:59:47,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:48,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113839634] [2020-01-16 18:59:48,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:48,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:48,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539600157] [2020-01-16 18:59:48,149 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:48,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:48,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:48,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:48,150 INFO L87 Difference]: Start difference. First operand 344 states and 1089 transitions. Second operand 8 states. [2020-01-16 18:59:48,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:48,233 INFO L93 Difference]: Finished difference Result 685 states and 1916 transitions. [2020-01-16 18:59:48,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:48,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:48,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:48,235 INFO L225 Difference]: With dead ends: 685 [2020-01-16 18:59:48,236 INFO L226 Difference]: Without dead ends: 637 [2020-01-16 18:59:48,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:59:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-01-16 18:59:48,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 336. [2020-01-16 18:59:48,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-01-16 18:59:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1069 transitions. [2020-01-16 18:59:48,244 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1069 transitions. Word has length 19 [2020-01-16 18:59:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:48,244 INFO L478 AbstractCegarLoop]: Abstraction has 336 states and 1069 transitions. [2020-01-16 18:59:48,244 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1069 transitions. [2020-01-16 18:59:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:48,245 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:48,245 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:48,245 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:59:48,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:48,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1873225276, now seen corresponding path program 129 times [2020-01-16 18:59:48,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:48,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820339499] [2020-01-16 18:59:48,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:48,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820339499] [2020-01-16 18:59:48,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:48,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:48,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783454056] [2020-01-16 18:59:48,483 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:48,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:48,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:48,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:48,483 INFO L87 Difference]: Start difference. First operand 336 states and 1069 transitions. Second operand 8 states. [2020-01-16 18:59:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:48,548 INFO L93 Difference]: Finished difference Result 666 states and 1859 transitions. [2020-01-16 18:59:48,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:48,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:48,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:48,550 INFO L225 Difference]: With dead ends: 666 [2020-01-16 18:59:48,550 INFO L226 Difference]: Without dead ends: 635 [2020-01-16 18:59:48,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:59:48,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-01-16 18:59:48,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 341. [2020-01-16 18:59:48,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:59:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1078 transitions. [2020-01-16 18:59:48,557 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1078 transitions. Word has length 19 [2020-01-16 18:59:48,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:48,557 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1078 transitions. [2020-01-16 18:59:48,557 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1078 transitions. [2020-01-16 18:59:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:48,558 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:48,558 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:48,558 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:59:48,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:48,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1670679926, now seen corresponding path program 130 times [2020-01-16 18:59:48,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:48,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417801211] [2020-01-16 18:59:48,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:48,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417801211] [2020-01-16 18:59:48,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:48,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:48,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108515750] [2020-01-16 18:59:48,784 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:48,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:48,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:48,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:48,785 INFO L87 Difference]: Start difference. First operand 341 states and 1078 transitions. Second operand 8 states. [2020-01-16 18:59:48,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:48,870 INFO L93 Difference]: Finished difference Result 668 states and 1863 transitions. [2020-01-16 18:59:48,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:48,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:48,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:48,872 INFO L225 Difference]: With dead ends: 668 [2020-01-16 18:59:48,872 INFO L226 Difference]: Without dead ends: 630 [2020-01-16 18:59:48,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:59:48,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-01-16 18:59:48,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 336. [2020-01-16 18:59:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-01-16 18:59:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1064 transitions. [2020-01-16 18:59:48,880 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1064 transitions. Word has length 19 [2020-01-16 18:59:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:48,880 INFO L478 AbstractCegarLoop]: Abstraction has 336 states and 1064 transitions. [2020-01-16 18:59:48,880 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1064 transitions. [2020-01-16 18:59:48,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:48,881 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:48,881 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:48,881 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:59:48,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:48,881 INFO L82 PathProgramCache]: Analyzing trace with hash 400559450, now seen corresponding path program 131 times [2020-01-16 18:59:48,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:48,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214403443] [2020-01-16 18:59:48,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:49,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:59:49,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214403443] [2020-01-16 18:59:49,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:49,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:49,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830427504] [2020-01-16 18:59:49,092 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:49,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:49,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:49,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:49,093 INFO L87 Difference]: Start difference. First operand 336 states and 1064 transitions. Second operand 8 states. [2020-01-16 18:59:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:49,180 INFO L93 Difference]: Finished difference Result 688 states and 1931 transitions. [2020-01-16 18:59:49,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:49,181 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:49,182 INFO L225 Difference]: With dead ends: 688 [2020-01-16 18:59:49,182 INFO L226 Difference]: Without dead ends: 648 [2020-01-16 18:59:49,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:59:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2020-01-16 18:59:49,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 345. [2020-01-16 18:59:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2020-01-16 18:59:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1086 transitions. [2020-01-16 18:59:49,191 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 1086 transitions. Word has length 19 [2020-01-16 18:59:49,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:49,192 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 1086 transitions. [2020-01-16 18:59:49,192 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:49,192 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 1086 transitions. [2020-01-16 18:59:49,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:49,193 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:49,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:59:49,193 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:59:49,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:49,193 INFO L82 PathProgramCache]: Analyzing trace with hash 399964804, now seen corresponding path program 132 times [2020-01-16 18:59:49,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:49,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371752991] [2020-01-16 18:59:49,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:49,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:59:49,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371752991] [2020-01-16 18:59:49,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:49,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:49,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863560599] [2020-01-16 18:59:49,430 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:49,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:49,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:49,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:49,431 INFO L87 Difference]: Start difference. First operand 345 states and 1086 transitions. Second operand 8 states. [2020-01-16 18:59:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:49,517 INFO L93 Difference]: Finished difference Result 681 states and 1901 transitions. [2020-01-16 18:59:49,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:49,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:49,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:49,519 INFO L225 Difference]: With dead ends: 681 [2020-01-16 18:59:49,519 INFO L226 Difference]: Without dead ends: 633 [2020-01-16 18:59:49,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:59:49,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-01-16 18:59:49,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 330. [2020-01-16 18:59:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-01-16 18:59:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1048 transitions. [2020-01-16 18:59:49,527 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1048 transitions. Word has length 19 [2020-01-16 18:59:49,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:49,527 INFO L478 AbstractCegarLoop]: Abstraction has 330 states and 1048 transitions. [2020-01-16 18:59:49,527 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1048 transitions. [2020-01-16 18:59:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:49,528 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:49,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:59:49,528 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:59:49,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:49,528 INFO L82 PathProgramCache]: Analyzing trace with hash 390118730, now seen corresponding path program 133 times [2020-01-16 18:59:49,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:49,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941738593] [2020-01-16 18:59:49,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:49,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941738593] [2020-01-16 18:59:49,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:49,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:49,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655299135] [2020-01-16 18:59:49,783 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:49,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:49,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:49,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:49,784 INFO L87 Difference]: Start difference. First operand 330 states and 1048 transitions. Second operand 8 states. [2020-01-16 18:59:49,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:49,853 INFO L93 Difference]: Finished difference Result 658 states and 1838 transitions. [2020-01-16 18:59:49,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:49,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:49,855 INFO L225 Difference]: With dead ends: 658 [2020-01-16 18:59:49,856 INFO L226 Difference]: Without dead ends: 627 [2020-01-16 18:59:49,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:59:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2020-01-16 18:59:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 340. [2020-01-16 18:59:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-01-16 18:59:49,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1076 transitions. [2020-01-16 18:59:49,862 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1076 transitions. Word has length 19 [2020-01-16 18:59:49,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:49,862 INFO L478 AbstractCegarLoop]: Abstraction has 340 states and 1076 transitions. [2020-01-16 18:59:49,862 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:49,862 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1076 transitions. [2020-01-16 18:59:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:49,863 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:49,863 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:49,863 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:59:49,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:49,863 INFO L82 PathProgramCache]: Analyzing trace with hash -360943364, now seen corresponding path program 134 times [2020-01-16 18:59:49,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:49,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923743435] [2020-01-16 18:59:49,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:50,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:59:50,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923743435] [2020-01-16 18:59:50,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:50,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:50,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287592240] [2020-01-16 18:59:50,084 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:50,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:50,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:50,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:50,084 INFO L87 Difference]: Start difference. First operand 340 states and 1076 transitions. Second operand 8 states. [2020-01-16 18:59:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:50,173 INFO L93 Difference]: Finished difference Result 660 states and 1842 transitions. [2020-01-16 18:59:50,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:50,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:50,174 INFO L225 Difference]: With dead ends: 660 [2020-01-16 18:59:50,174 INFO L226 Difference]: Without dead ends: 622 [2020-01-16 18:59:50,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-01-16 18:59:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 335. [2020-01-16 18:59:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-01-16 18:59:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1062 transitions. [2020-01-16 18:59:50,181 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1062 transitions. Word has length 19 [2020-01-16 18:59:50,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:50,182 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 1062 transitions. [2020-01-16 18:59:50,182 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1062 transitions. [2020-01-16 18:59:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:50,182 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:50,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:59:50,183 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:59:50,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:50,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1210319124, now seen corresponding path program 135 times [2020-01-16 18:59:50,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:50,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253995835] [2020-01-16 18:59:50,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:50,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:59:50,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253995835] [2020-01-16 18:59:50,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:50,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:50,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444855312] [2020-01-16 18:59:50,404 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:50,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:50,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:50,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:50,404 INFO L87 Difference]: Start difference. First operand 335 states and 1062 transitions. Second operand 8 states. [2020-01-16 18:59:50,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:50,475 INFO L93 Difference]: Finished difference Result 662 states and 1845 transitions. [2020-01-16 18:59:50,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:50,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:50,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:50,477 INFO L225 Difference]: With dead ends: 662 [2020-01-16 18:59:50,477 INFO L226 Difference]: Without dead ends: 631 [2020-01-16 18:59:50,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:59:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2020-01-16 18:59:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 341. [2020-01-16 18:59:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:59:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1073 transitions. [2020-01-16 18:59:50,484 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1073 transitions. Word has length 19 [2020-01-16 18:59:50,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:50,484 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1073 transitions. [2020-01-16 18:59:50,484 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:50,484 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1073 transitions. [2020-01-16 18:59:50,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:50,485 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:50,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:59:50,485 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:59:50,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:50,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2108443422, now seen corresponding path program 136 times [2020-01-16 18:59:50,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:50,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135597821] [2020-01-16 18:59:50,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:50,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:59:50,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135597821] [2020-01-16 18:59:50,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:50,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:50,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063108746] [2020-01-16 18:59:50,705 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:50,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:50,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:50,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:50,705 INFO L87 Difference]: Start difference. First operand 341 states and 1073 transitions. Second operand 8 states. [2020-01-16 18:59:50,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:50,810 INFO L93 Difference]: Finished difference Result 667 states and 1857 transitions. [2020-01-16 18:59:50,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:50,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:50,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:50,812 INFO L225 Difference]: With dead ends: 667 [2020-01-16 18:59:50,813 INFO L226 Difference]: Without dead ends: 625 [2020-01-16 18:59:50,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:50,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-01-16 18:59:50,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 335. [2020-01-16 18:59:50,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-01-16 18:59:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1057 transitions. [2020-01-16 18:59:50,820 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1057 transitions. Word has length 19 [2020-01-16 18:59:50,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:50,820 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 1057 transitions. [2020-01-16 18:59:50,820 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1057 transitions. [2020-01-16 18:59:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:50,821 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:50,821 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:50,821 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:59:50,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:50,821 INFO L82 PathProgramCache]: Analyzing trace with hash -558519542, now seen corresponding path program 137 times [2020-01-16 18:59:50,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:50,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71988295] [2020-01-16 18:59:50,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:51,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:59:51,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71988295] [2020-01-16 18:59:51,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:51,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:51,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316712856] [2020-01-16 18:59:51,039 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:51,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:51,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:51,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:51,039 INFO L87 Difference]: Start difference. First operand 335 states and 1057 transitions. Second operand 8 states. [2020-01-16 18:59:51,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:51,143 INFO L93 Difference]: Finished difference Result 668 states and 1869 transitions. [2020-01-16 18:59:51,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:51,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:51,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:51,145 INFO L225 Difference]: With dead ends: 668 [2020-01-16 18:59:51,145 INFO L226 Difference]: Without dead ends: 635 [2020-01-16 18:59:51,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:51,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2020-01-16 18:59:51,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 343. [2020-01-16 18:59:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-01-16 18:59:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1077 transitions. [2020-01-16 18:59:51,152 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1077 transitions. Word has length 19 [2020-01-16 18:59:51,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:51,153 INFO L478 AbstractCegarLoop]: Abstraction has 343 states and 1077 transitions. [2020-01-16 18:59:51,153 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1077 transitions. [2020-01-16 18:59:51,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:51,153 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:51,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:51,153 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:59:51,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:51,154 INFO L82 PathProgramCache]: Analyzing trace with hash 300354988, now seen corresponding path program 138 times [2020-01-16 18:59:51,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:51,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525103174] [2020-01-16 18:59:51,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:51,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:51,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525103174] [2020-01-16 18:59:51,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:51,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:51,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392919833] [2020-01-16 18:59:51,370 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:51,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:51,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:51,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:51,370 INFO L87 Difference]: Start difference. First operand 343 states and 1077 transitions. Second operand 8 states. [2020-01-16 18:59:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:51,468 INFO L93 Difference]: Finished difference Result 671 states and 1870 transitions. [2020-01-16 18:59:51,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:51,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:51,470 INFO L225 Difference]: With dead ends: 671 [2020-01-16 18:59:51,470 INFO L226 Difference]: Without dead ends: 622 [2020-01-16 18:59:51,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:59:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-01-16 18:59:51,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 330. [2020-01-16 18:59:51,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-01-16 18:59:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1043 transitions. [2020-01-16 18:59:51,477 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1043 transitions. Word has length 19 [2020-01-16 18:59:51,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:51,477 INFO L478 AbstractCegarLoop]: Abstraction has 330 states and 1043 transitions. [2020-01-16 18:59:51,477 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1043 transitions. [2020-01-16 18:59:51,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:51,478 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:51,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:59:51,479 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:59:51,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:51,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2132260642, now seen corresponding path program 139 times [2020-01-16 18:59:51,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:51,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590806803] [2020-01-16 18:59:51,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:51,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:51,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590806803] [2020-01-16 18:59:51,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:51,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:51,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751552179] [2020-01-16 18:59:51,693 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:51,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:51,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:51,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:51,693 INFO L87 Difference]: Start difference. First operand 330 states and 1043 transitions. Second operand 8 states. [2020-01-16 18:59:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:51,782 INFO L93 Difference]: Finished difference Result 702 states and 2000 transitions. [2020-01-16 18:59:51,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:51,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:51,783 INFO L225 Difference]: With dead ends: 702 [2020-01-16 18:59:51,783 INFO L226 Difference]: Without dead ends: 662 [2020-01-16 18:59:51,784 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:51,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-01-16 18:59:51,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 347. [2020-01-16 18:59:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-01-16 18:59:51,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1101 transitions. [2020-01-16 18:59:51,791 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1101 transitions. Word has length 19 [2020-01-16 18:59:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:51,791 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 1101 transitions. [2020-01-16 18:59:51,791 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1101 transitions. [2020-01-16 18:59:51,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:51,792 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:51,792 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:51,792 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:59:51,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:51,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2132855288, now seen corresponding path program 140 times [2020-01-16 18:59:51,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:51,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93194350] [2020-01-16 18:59:51,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:52,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:59:52,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93194350] [2020-01-16 18:59:52,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:52,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:52,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126753848] [2020-01-16 18:59:52,021 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:52,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:52,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:52,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:52,022 INFO L87 Difference]: Start difference. First operand 347 states and 1101 transitions. Second operand 8 states. [2020-01-16 18:59:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:52,119 INFO L93 Difference]: Finished difference Result 695 states and 1970 transitions. [2020-01-16 18:59:52,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:52,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:52,121 INFO L225 Difference]: With dead ends: 695 [2020-01-16 18:59:52,121 INFO L226 Difference]: Without dead ends: 653 [2020-01-16 18:59:52,121 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:52,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2020-01-16 18:59:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 338. [2020-01-16 18:59:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-01-16 18:59:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1071 transitions. [2020-01-16 18:59:52,128 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1071 transitions. Word has length 19 [2020-01-16 18:59:52,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:52,128 INFO L478 AbstractCegarLoop]: Abstraction has 338 states and 1071 transitions. [2020-01-16 18:59:52,128 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:52,128 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1071 transitions. [2020-01-16 18:59:52,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:52,128 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:52,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:59:52,129 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:59:52,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:52,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1276953988, now seen corresponding path program 141 times [2020-01-16 18:59:52,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:52,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470285162] [2020-01-16 18:59:52,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:52,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470285162] [2020-01-16 18:59:52,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:52,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:52,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824253687] [2020-01-16 18:59:52,343 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:52,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:52,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:52,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:52,343 INFO L87 Difference]: Start difference. First operand 338 states and 1071 transitions. Second operand 8 states. [2020-01-16 18:59:52,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:52,437 INFO L93 Difference]: Finished difference Result 708 states and 2013 transitions. [2020-01-16 18:59:52,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:52,437 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:52,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:52,439 INFO L225 Difference]: With dead ends: 708 [2020-01-16 18:59:52,439 INFO L226 Difference]: Without dead ends: 668 [2020-01-16 18:59:52,439 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:52,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2020-01-16 18:59:52,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 350. [2020-01-16 18:59:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-01-16 18:59:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1102 transitions. [2020-01-16 18:59:52,446 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1102 transitions. Word has length 19 [2020-01-16 18:59:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:52,446 INFO L478 AbstractCegarLoop]: Abstraction has 350 states and 1102 transitions. [2020-01-16 18:59:52,446 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1102 transitions. [2020-01-16 18:59:52,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:52,447 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:52,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:59:52,447 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:59:52,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:52,447 INFO L82 PathProgramCache]: Analyzing trace with hash -418674104, now seen corresponding path program 142 times [2020-01-16 18:59:52,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:52,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249708100] [2020-01-16 18:59:52,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:52,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249708100] [2020-01-16 18:59:52,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:52,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:52,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363149568] [2020-01-16 18:59:52,660 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:52,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:52,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:52,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:52,660 INFO L87 Difference]: Start difference. First operand 350 states and 1102 transitions. Second operand 8 states. [2020-01-16 18:59:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:52,762 INFO L93 Difference]: Finished difference Result 704 states and 1989 transitions. [2020-01-16 18:59:52,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:52,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:52,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:52,764 INFO L225 Difference]: With dead ends: 704 [2020-01-16 18:59:52,764 INFO L226 Difference]: Without dead ends: 656 [2020-01-16 18:59:52,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:59:52,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2020-01-16 18:59:52,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 338. [2020-01-16 18:59:52,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-01-16 18:59:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1063 transitions. [2020-01-16 18:59:52,771 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 1063 transitions. Word has length 19 [2020-01-16 18:59:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:52,771 INFO L478 AbstractCegarLoop]: Abstraction has 338 states and 1063 transitions. [2020-01-16 18:59:52,771 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 1063 transitions. [2020-01-16 18:59:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:52,772 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:52,772 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:52,772 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:59:52,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:52,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1295982660, now seen corresponding path program 143 times [2020-01-16 18:59:52,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:52,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272637680] [2020-01-16 18:59:52,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:52,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:52,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272637680] [2020-01-16 18:59:52,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:52,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:52,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338199730] [2020-01-16 18:59:52,987 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:52,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:52,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:52,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:52,987 INFO L87 Difference]: Start difference. First operand 338 states and 1063 transitions. Second operand 8 states. [2020-01-16 18:59:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:53,079 INFO L93 Difference]: Finished difference Result 690 states and 1948 transitions. [2020-01-16 18:59:53,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:53,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:53,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:53,082 INFO L225 Difference]: With dead ends: 690 [2020-01-16 18:59:53,082 INFO L226 Difference]: Without dead ends: 657 [2020-01-16 18:59:53,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:59:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-01-16 18:59:53,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 346. [2020-01-16 18:59:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-01-16 18:59:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1083 transitions. [2020-01-16 18:59:53,089 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 1083 transitions. Word has length 19 [2020-01-16 18:59:53,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:53,090 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 1083 transitions. [2020-01-16 18:59:53,090 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 1083 transitions. [2020-01-16 18:59:53,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:53,090 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:53,090 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:53,091 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:59:53,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:53,091 INFO L82 PathProgramCache]: Analyzing trace with hash -437108130, now seen corresponding path program 144 times [2020-01-16 18:59:53,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:53,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358701861] [2020-01-16 18:59:53,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:53,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358701861] [2020-01-16 18:59:53,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:53,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:53,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437702091] [2020-01-16 18:59:53,305 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:53,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:53,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:53,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:53,305 INFO L87 Difference]: Start difference. First operand 346 states and 1083 transitions. Second operand 8 states. [2020-01-16 18:59:53,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:53,406 INFO L93 Difference]: Finished difference Result 693 states and 1949 transitions. [2020-01-16 18:59:53,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:53,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:53,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:53,408 INFO L225 Difference]: With dead ends: 693 [2020-01-16 18:59:53,408 INFO L226 Difference]: Without dead ends: 633 [2020-01-16 18:59:53,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-01-16 18:59:53,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 322. [2020-01-16 18:59:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-01-16 18:59:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 1025 transitions. [2020-01-16 18:59:53,421 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 1025 transitions. Word has length 19 [2020-01-16 18:59:53,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:53,421 INFO L478 AbstractCegarLoop]: Abstraction has 322 states and 1025 transitions. [2020-01-16 18:59:53,421 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 1025 transitions. [2020-01-16 18:59:53,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:53,422 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:53,422 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:53,422 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:59:53,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:53,422 INFO L82 PathProgramCache]: Analyzing trace with hash -570692880, now seen corresponding path program 145 times [2020-01-16 18:59:53,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:53,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563895452] [2020-01-16 18:59:53,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:53,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:59:53,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563895452] [2020-01-16 18:59:53,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:53,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:53,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9320582] [2020-01-16 18:59:53,657 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:53,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:53,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:53,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:53,657 INFO L87 Difference]: Start difference. First operand 322 states and 1025 transitions. Second operand 8 states. [2020-01-16 18:59:53,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:53,741 INFO L93 Difference]: Finished difference Result 656 states and 1808 transitions. [2020-01-16 18:59:53,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:53,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:53,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:53,742 INFO L225 Difference]: With dead ends: 656 [2020-01-16 18:59:53,743 INFO L226 Difference]: Without dead ends: 625 [2020-01-16 18:59:53,743 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:53,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-01-16 18:59:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 343. [2020-01-16 18:59:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-01-16 18:59:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 1083 transitions. [2020-01-16 18:59:53,752 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 1083 transitions. Word has length 19 [2020-01-16 18:59:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:53,752 INFO L478 AbstractCegarLoop]: Abstraction has 343 states and 1083 transitions. [2020-01-16 18:59:53,752 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 1083 transitions. [2020-01-16 18:59:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:53,753 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:53,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:59:53,754 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:59:53,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:53,754 INFO L82 PathProgramCache]: Analyzing trace with hash -196041694, now seen corresponding path program 146 times [2020-01-16 18:59:53,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:53,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686313615] [2020-01-16 18:59:53,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:53,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:59:53,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686313615] [2020-01-16 18:59:53,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:53,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:53,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604930026] [2020-01-16 18:59:53,995 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:53,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:53,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:53,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:53,996 INFO L87 Difference]: Start difference. First operand 343 states and 1083 transitions. Second operand 8 states. [2020-01-16 18:59:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:54,085 INFO L93 Difference]: Finished difference Result 665 states and 1831 transitions. [2020-01-16 18:59:54,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:54,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:54,087 INFO L225 Difference]: With dead ends: 665 [2020-01-16 18:59:54,087 INFO L226 Difference]: Without dead ends: 617 [2020-01-16 18:59: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:59:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2020-01-16 18:59:54,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 335. [2020-01-16 18:59:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-01-16 18:59:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1062 transitions. [2020-01-16 18:59:54,093 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1062 transitions. Word has length 19 [2020-01-16 18:59:54,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:54,093 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 1062 transitions. [2020-01-16 18:59:54,093 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1062 transitions. [2020-01-16 18:59:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:54,094 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:54,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:54,094 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:59:54,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:54,094 INFO L82 PathProgramCache]: Analyzing trace with hash 610696874, now seen corresponding path program 147 times [2020-01-16 18:59:54,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:54,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107017743] [2020-01-16 18:59:54,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:54,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:59:54,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107017743] [2020-01-16 18:59:54,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:54,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:54,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716087569] [2020-01-16 18:59:54,322 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:54,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:54,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:54,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:54,322 INFO L87 Difference]: Start difference. First operand 335 states and 1062 transitions. Second operand 8 states. [2020-01-16 18:59:54,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:54,399 INFO L93 Difference]: Finished difference Result 650 states and 1785 transitions. [2020-01-16 18:59:54,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:54,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:54,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:54,401 INFO L225 Difference]: With dead ends: 650 [2020-01-16 18:59:54,401 INFO L226 Difference]: Without dead ends: 619 [2020-01-16 18:59:54,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:59:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-01-16 18:59:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 341. [2020-01-16 18:59:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-01-16 18:59:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1073 transitions. [2020-01-16 18:59:54,408 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1073 transitions. Word has length 19 [2020-01-16 18:59:54,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:54,408 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 1073 transitions. [2020-01-16 18:59:54,408 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1073 transitions. [2020-01-16 18:59:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:54,409 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:54,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:59:54,409 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:59:54,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:54,409 INFO L82 PathProgramCache]: Analyzing trace with hash -365507876, now seen corresponding path program 148 times [2020-01-16 18:59:54,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:54,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013770347] [2020-01-16 18:59:54,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:54,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:59:54,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013770347] [2020-01-16 18:59:54,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:54,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:54,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913121604] [2020-01-16 18:59:54,621 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:54,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:54,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:54,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:54,622 INFO L87 Difference]: Start difference. First operand 341 states and 1073 transitions. Second operand 8 states. [2020-01-16 18:59:54,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:54,731 INFO L93 Difference]: Finished difference Result 655 states and 1797 transitions. [2020-01-16 18:59:54,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:54,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:54,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:54,733 INFO L225 Difference]: With dead ends: 655 [2020-01-16 18:59:54,733 INFO L226 Difference]: Without dead ends: 613 [2020-01-16 18:59:54,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:54,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-01-16 18:59:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 335. [2020-01-16 18:59:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2020-01-16 18:59:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1056 transitions. [2020-01-16 18:59:54,742 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 1056 transitions. Word has length 19 [2020-01-16 18:59:54,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:54,742 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 1056 transitions. [2020-01-16 18:59:54,742 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 1056 transitions. [2020-01-16 18:59:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:54,743 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:54,743 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:54,743 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:59:54,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:54,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1800464414, now seen corresponding path program 149 times [2020-01-16 18:59:54,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:54,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117170792] [2020-01-16 18:59:54,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:55,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117170792] [2020-01-16 18:59:55,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:55,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:55,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867498068] [2020-01-16 18:59:55,024 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:55,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:55,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:55,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:55,025 INFO L87 Difference]: Start difference. First operand 335 states and 1056 transitions. Second operand 8 states. [2020-01-16 18:59:55,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:55,160 INFO L93 Difference]: Finished difference Result 674 states and 1865 transitions. [2020-01-16 18:59:55,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:55,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:55,162 INFO L225 Difference]: With dead ends: 674 [2020-01-16 18:59:55,163 INFO L226 Difference]: Without dead ends: 634 [2020-01-16 18:59:55,163 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:59:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-01-16 18:59:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 347. [2020-01-16 18:59:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-01-16 18:59:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1087 transitions. [2020-01-16 18:59:55,177 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1087 transitions. Word has length 19 [2020-01-16 18:59:55,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:55,177 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 1087 transitions. [2020-01-16 18:59:55,177 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1087 transitions. [2020-01-16 18:59:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:55,178 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:55,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:59:55,179 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:59:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:55,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1636222998, now seen corresponding path program 150 times [2020-01-16 18:59:55,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:55,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405078201] [2020-01-16 18:59:55,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:55,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:59:55,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405078201] [2020-01-16 18:59:55,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:55,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:55,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152197689] [2020-01-16 18:59:55,399 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:55,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:55,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:55,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:55,400 INFO L87 Difference]: Start difference. First operand 347 states and 1087 transitions. Second operand 8 states. [2020-01-16 18:59:55,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:55,498 INFO L93 Difference]: Finished difference Result 670 states and 1841 transitions. [2020-01-16 18:59:55,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:55,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:55,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:55,500 INFO L225 Difference]: With dead ends: 670 [2020-01-16 18:59:55,500 INFO L226 Difference]: Without dead ends: 614 [2020-01-16 18:59:55,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-01-16 18:59:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 327. [2020-01-16 18:59:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2020-01-16 18:59:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 1038 transitions. [2020-01-16 18:59:55,506 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 1038 transitions. Word has length 19 [2020-01-16 18:59:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:55,506 INFO L478 AbstractCegarLoop]: Abstraction has 327 states and 1038 transitions. [2020-01-16 18:59:55,506 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 1038 transitions. [2020-01-16 18:59:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:55,507 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:55,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:59:55,507 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:59:55,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:55,508 INFO L82 PathProgramCache]: Analyzing trace with hash 807035554, now seen corresponding path program 151 times [2020-01-16 18:59:55,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:55,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099774833] [2020-01-16 18:59:55,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:55,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:59:55,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099774833] [2020-01-16 18:59:55,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:55,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:55,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856728616] [2020-01-16 18:59:55,718 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:55,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:55,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:55,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:55,718 INFO L87 Difference]: Start difference. First operand 327 states and 1038 transitions. Second operand 8 states. [2020-01-16 18:59:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:55,789 INFO L93 Difference]: Finished difference Result 629 states and 1714 transitions. [2020-01-16 18:59:55,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:55,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:55,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:55,791 INFO L225 Difference]: With dead ends: 629 [2020-01-16 18:59:55,792 INFO L226 Difference]: Without dead ends: 598 [2020-01-16 18:59:55,792 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:55,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-01-16 18:59:55,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 339. [2020-01-16 18:59:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2020-01-16 18:59:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 1064 transitions. [2020-01-16 18:59:55,798 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 1064 transitions. Word has length 19 [2020-01-16 18:59:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:55,798 INFO L478 AbstractCegarLoop]: Abstraction has 339 states and 1064 transitions. [2020-01-16 18:59:55,798 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 1064 transitions. [2020-01-16 18:59:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:55,799 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:55,799 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:55,799 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:59:55,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:55,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1181686740, now seen corresponding path program 152 times [2020-01-16 18:59:55,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:55,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030318853] [2020-01-16 18:59:55,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:56,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:59:56,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030318853] [2020-01-16 18:59:56,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:56,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:56,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088270033] [2020-01-16 18:59:56,051 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:56,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:56,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:56,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:56,052 INFO L87 Difference]: Start difference. First operand 339 states and 1064 transitions. Second operand 8 states. [2020-01-16 18:59:56,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:56,139 INFO L93 Difference]: Finished difference Result 638 states and 1737 transitions. [2020-01-16 18:59:56,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:56,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:56,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:56,141 INFO L225 Difference]: With dead ends: 638 [2020-01-16 18:59:56,141 INFO L226 Difference]: Without dead ends: 590 [2020-01-16 18:59:56,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-01-16 18:59:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 331. [2020-01-16 18:59:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-01-16 18:59:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 1046 transitions. [2020-01-16 18:59:56,148 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 1046 transitions. Word has length 19 [2020-01-16 18:59:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:56,149 INFO L478 AbstractCegarLoop]: Abstraction has 331 states and 1046 transitions. [2020-01-16 18:59:56,149 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 1046 transitions. [2020-01-16 18:59:56,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:56,149 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:56,149 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:56,150 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:59:56,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:56,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1337232860, now seen corresponding path program 153 times [2020-01-16 18:59:56,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:56,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770203071] [2020-01-16 18:59:56,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:56,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:59:56,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770203071] [2020-01-16 18:59:56,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:56,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:56,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848860805] [2020-01-16 18:59:56,350 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:56,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:56,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:56,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:56,350 INFO L87 Difference]: Start difference. First operand 331 states and 1046 transitions. Second operand 8 states. [2020-01-16 18:59:56,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:56,424 INFO L93 Difference]: Finished difference Result 606 states and 1650 transitions. [2020-01-16 18:59:56,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:56,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:56,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:56,426 INFO L225 Difference]: With dead ends: 606 [2020-01-16 18:59:56,426 INFO L226 Difference]: Without dead ends: 575 [2020-01-16 18:59:56,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:59:56,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2020-01-16 18:59:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 334. [2020-01-16 18:59:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-01-16 18:59:56,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1050 transitions. [2020-01-16 18:59:56,433 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1050 transitions. Word has length 19 [2020-01-16 18:59:56,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:56,434 INFO L478 AbstractCegarLoop]: Abstraction has 334 states and 1050 transitions. [2020-01-16 18:59:56,434 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:56,434 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1050 transitions. [2020-01-16 18:59:56,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:56,434 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:56,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:59:56,434 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:59:56,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:56,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1693132272, now seen corresponding path program 1 times [2020-01-16 18:59:56,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:56,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987177701] [2020-01-16 18:59:56,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59: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:59:56,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987177701] [2020-01-16 18:59:56,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:56,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 18:59:56,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351972088] [2020-01-16 18:59:56,440 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 18:59:56,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:56,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 18:59:56,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 18:59:56,441 INFO L87 Difference]: Start difference. First operand 334 states and 1050 transitions. Second operand 3 states. [2020-01-16 18:59:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:56,445 INFO L93 Difference]: Finished difference Result 220 states and 662 transitions. [2020-01-16 18:59:56,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 18:59:56,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-01-16 18:59:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:56,446 INFO L225 Difference]: With dead ends: 220 [2020-01-16 18:59:56,446 INFO L226 Difference]: Without dead ends: 220 [2020-01-16 18:59:56,446 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:59:56,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-01-16 18:59:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2020-01-16 18:59:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-01-16 18:59:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 662 transitions. [2020-01-16 18:59:56,451 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 662 transitions. Word has length 19 [2020-01-16 18:59:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:56,451 INFO L478 AbstractCegarLoop]: Abstraction has 220 states and 662 transitions. [2020-01-16 18:59:56,451 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 18:59:56,452 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 662 transitions. [2020-01-16 18:59:56,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:56,452 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:56,452 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:56,452 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:59:56,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:56,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1596291086, now seen corresponding path program 154 times [2020-01-16 18:59:56,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:56,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674417040] [2020-01-16 18:59:56,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:56,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:59:56,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674417040] [2020-01-16 18:59:56,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:56,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:56,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221724775] [2020-01-16 18:59:56,647 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:56,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:56,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:56,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:56,647 INFO L87 Difference]: Start difference. First operand 220 states and 662 transitions. Second operand 8 states. [2020-01-16 18:59:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:56,717 INFO L93 Difference]: Finished difference Result 336 states and 884 transitions. [2020-01-16 18:59:56,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:56,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:56,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:56,719 INFO L225 Difference]: With dead ends: 336 [2020-01-16 18:59:56,719 INFO L226 Difference]: Without dead ends: 323 [2020-01-16 18:59:56,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:59:56,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-01-16 18:59:56,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 217. [2020-01-16 18:59:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-01-16 18:59:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 655 transitions. [2020-01-16 18:59:56,724 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 655 transitions. Word has length 19 [2020-01-16 18:59:56,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:56,724 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 655 transitions. [2020-01-16 18:59:56,724 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:56,724 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 655 transitions. [2020-01-16 18:59:56,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:56,724 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:56,724 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:56,724 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:59:56,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:56,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1035428716, now seen corresponding path program 155 times [2020-01-16 18:59:56,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:56,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794308874] [2020-01-16 18:59:56,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:56,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794308874] [2020-01-16 18:59:56,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:56,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:56,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478623245] [2020-01-16 18:59:56,925 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:56,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:56,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:56,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:56,925 INFO L87 Difference]: Start difference. First operand 217 states and 655 transitions. Second operand 8 states. [2020-01-16 18:59:57,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:57,019 INFO L93 Difference]: Finished difference Result 348 states and 900 transitions. [2020-01-16 18:59:57,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:57,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:57,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:57,021 INFO L225 Difference]: With dead ends: 348 [2020-01-16 18:59:57,021 INFO L226 Difference]: Without dead ends: 334 [2020-01-16 18:59:57,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:59:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-01-16 18:59:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 219. [2020-01-16 18:59:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-01-16 18:59:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 658 transitions. [2020-01-16 18:59:57,026 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 658 transitions. Word has length 19 [2020-01-16 18:59:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:57,026 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 658 transitions. [2020-01-16 18:59:57,026 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 658 transitions. [2020-01-16 18:59:57,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:57,027 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:57,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:59:57,027 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:59:57,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:57,027 INFO L82 PathProgramCache]: Analyzing trace with hash 84701114, now seen corresponding path program 156 times [2020-01-16 18:59:57,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:57,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546450856] [2020-01-16 18:59:57,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:57,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546450856] [2020-01-16 18:59:57,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:57,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:57,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625306987] [2020-01-16 18:59:57,227 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:57,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:57,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:57,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:57,228 INFO L87 Difference]: Start difference. First operand 219 states and 658 transitions. Second operand 8 states. [2020-01-16 18:59:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:57,295 INFO L93 Difference]: Finished difference Result 335 states and 880 transitions. [2020-01-16 18:59:57,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:57,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:57,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:57,297 INFO L225 Difference]: With dead ends: 335 [2020-01-16 18:59:57,297 INFO L226 Difference]: Without dead ends: 319 [2020-01-16 18:59:57,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:59:57,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-01-16 18:59:57,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 213. [2020-01-16 18:59:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-01-16 18:59:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 646 transitions. [2020-01-16 18:59:57,302 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 646 transitions. Word has length 19 [2020-01-16 18:59:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:57,302 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 646 transitions. [2020-01-16 18:59:57,302 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 646 transitions. [2020-01-16 18:59:57,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:57,303 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:57,303 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:57,303 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:59:57,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:57,303 INFO L82 PathProgramCache]: Analyzing trace with hash -694390430, now seen corresponding path program 157 times [2020-01-16 18:59:57,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:57,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467930072] [2020-01-16 18:59:57,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:57,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:59:57,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467930072] [2020-01-16 18:59:57,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:57,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:57,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711889569] [2020-01-16 18:59:57,517 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:57,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:57,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:57,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:57,518 INFO L87 Difference]: Start difference. First operand 213 states and 646 transitions. Second operand 8 states. [2020-01-16 18:59:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:57,601 INFO L93 Difference]: Finished difference Result 363 states and 936 transitions. [2020-01-16 18:59:57,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:57,602 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:57,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:57,603 INFO L225 Difference]: With dead ends: 363 [2020-01-16 18:59:57,603 INFO L226 Difference]: Without dead ends: 347 [2020-01-16 18:59:57,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:57,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-01-16 18:59:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 219. [2020-01-16 18:59:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-01-16 18:59:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 660 transitions. [2020-01-16 18:59:57,608 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 660 transitions. Word has length 19 [2020-01-16 18:59:57,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:57,609 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 660 transitions. [2020-01-16 18:59:57,609 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 660 transitions. [2020-01-16 18:59:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:57,609 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:57,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:57,609 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:59:57,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:57,610 INFO L82 PathProgramCache]: Analyzing trace with hash -435332204, now seen corresponding path program 158 times [2020-01-16 18:59:57,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:57,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968503010] [2020-01-16 18:59:57,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:57,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:59:57,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968503010] [2020-01-16 18:59:57,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:57,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:57,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012880954] [2020-01-16 18:59:57,815 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:57,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:57,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:57,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:57,816 INFO L87 Difference]: Start difference. First operand 219 states and 660 transitions. Second operand 8 states. [2020-01-16 18:59:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:57,907 INFO L93 Difference]: Finished difference Result 357 states and 921 transitions. [2020-01-16 18:59:57,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:57,907 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:57,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:57,908 INFO L225 Difference]: With dead ends: 357 [2020-01-16 18:59:57,908 INFO L226 Difference]: Without dead ends: 344 [2020-01-16 18:59:57,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:59:57,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-01-16 18:59:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 216. [2020-01-16 18:59:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 18:59:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 653 transitions. [2020-01-16 18:59:57,914 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 653 transitions. Word has length 19 [2020-01-16 18:59:57,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:57,914 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 653 transitions. [2020-01-16 18:59:57,914 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 653 transitions. [2020-01-16 18:59:57,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:57,914 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:57,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:59:57,915 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:59:57,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:57,915 INFO L82 PathProgramCache]: Analyzing trace with hash 399701158, now seen corresponding path program 159 times [2020-01-16 18:59:57,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:57,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212543361] [2020-01-16 18:59:57,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:58,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:59:58,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212543361] [2020-01-16 18:59:58,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:58,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:58,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156993792] [2020-01-16 18:59:58,126 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:58,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:58,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:58,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:58,127 INFO L87 Difference]: Start difference. First operand 216 states and 653 transitions. Second operand 8 states. [2020-01-16 18:59:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:58,203 INFO L93 Difference]: Finished difference Result 363 states and 933 transitions. [2020-01-16 18:59:58,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:58,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:58,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:58,205 INFO L225 Difference]: With dead ends: 363 [2020-01-16 18:59:58,205 INFO L226 Difference]: Without dead ends: 347 [2020-01-16 18:59:58,205 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:58,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-01-16 18:59:58,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 222. [2020-01-16 18:59:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-01-16 18:59:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 664 transitions. [2020-01-16 18:59:58,211 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 664 transitions. Word has length 19 [2020-01-16 18:59:58,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:58,212 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 664 transitions. [2020-01-16 18:59:58,212 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 664 transitions. [2020-01-16 18:59:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:58,212 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:58,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:59:58,212 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:59:58,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:58,213 INFO L82 PathProgramCache]: Analyzing trace with hash -576503592, now seen corresponding path program 160 times [2020-01-16 18:59:58,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:58,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271559911] [2020-01-16 18:59:58,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:58,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:59:58,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271559911] [2020-01-16 18:59:58,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:58,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:58,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313827639] [2020-01-16 18:59:58,427 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:58,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:58,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:58,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:58,428 INFO L87 Difference]: Start difference. First operand 222 states and 664 transitions. Second operand 8 states. [2020-01-16 18:59:58,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:58,522 INFO L93 Difference]: Finished difference Result 360 states and 922 transitions. [2020-01-16 18:59:58,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:58,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:58,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:58,523 INFO L225 Difference]: With dead ends: 360 [2020-01-16 18:59:58,523 INFO L226 Difference]: Without dead ends: 341 [2020-01-16 18:59:58,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 18:59:58,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-01-16 18:59:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 216. [2020-01-16 18:59:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 18:59:58,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 650 transitions. [2020-01-16 18:59:58,529 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 650 transitions. Word has length 19 [2020-01-16 18:59:58,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:58,529 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 650 transitions. [2020-01-16 18:59:58,529 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 650 transitions. [2020-01-16 18:59:58,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:58,530 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:58,530 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:58,530 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:59:58,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:58,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1883903552, now seen corresponding path program 161 times [2020-01-16 18:59:58,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:58,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871071069] [2020-01-16 18:59:58,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:58,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871071069] [2020-01-16 18:59:58,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:58,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:58,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324836537] [2020-01-16 18:59:58,738 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:58,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:58,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:58,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:58,738 INFO L87 Difference]: Start difference. First operand 216 states and 650 transitions. Second operand 8 states. [2020-01-16 18:59:58,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:58,805 INFO L93 Difference]: Finished difference Result 347 states and 894 transitions. [2020-01-16 18:59:58,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:58,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:58,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:58,807 INFO L225 Difference]: With dead ends: 347 [2020-01-16 18:59:58,807 INFO L226 Difference]: Without dead ends: 337 [2020-01-16 18:59:58,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:59:58,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-01-16 18:59:58,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 218. [2020-01-16 18:59:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 18:59:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 653 transitions. [2020-01-16 18:59:58,812 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 653 transitions. Word has length 19 [2020-01-16 18:59:58,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:58,813 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 653 transitions. [2020-01-16 18:59:58,813 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:58,813 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 653 transitions. [2020-01-16 18:59:58,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:58,813 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:58,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:59:58,813 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:59:58,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:58,814 INFO L82 PathProgramCache]: Analyzing trace with hash -394498556, now seen corresponding path program 162 times [2020-01-16 18:59:58,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:58,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308075443] [2020-01-16 18:59:58,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:59,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:59,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308075443] [2020-01-16 18:59:59,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:59,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:59,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353473272] [2020-01-16 18:59:59,020 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:59,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:59,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:59,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:59,020 INFO L87 Difference]: Start difference. First operand 218 states and 653 transitions. Second operand 8 states. [2020-01-16 18:59:59,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:59,116 INFO L93 Difference]: Finished difference Result 345 states and 889 transitions. [2020-01-16 18:59:59,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:59,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:59,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:59,117 INFO L225 Difference]: With dead ends: 345 [2020-01-16 18:59:59,117 INFO L226 Difference]: Without dead ends: 327 [2020-01-16 18:59:59,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:59:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-01-16 18:59:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 213. [2020-01-16 18:59:59,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-01-16 18:59:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 643 transitions. [2020-01-16 18:59:59,122 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 643 transitions. Word has length 19 [2020-01-16 18:59:59,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:59,122 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 643 transitions. [2020-01-16 18:59:59,122 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 643 transitions. [2020-01-16 18:59:59,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:59,123 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:59,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:59:59,123 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:59:59,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:59,123 INFO L82 PathProgramCache]: Analyzing trace with hash 600573882, now seen corresponding path program 163 times [2020-01-16 18:59:59,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:59,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743125127] [2020-01-16 18:59:59,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:59,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:59:59,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743125127] [2020-01-16 18:59:59,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:59,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:59,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513570300] [2020-01-16 18:59:59,321 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:59,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:59,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:59,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:59,322 INFO L87 Difference]: Start difference. First operand 213 states and 643 transitions. Second operand 8 states. [2020-01-16 18:59:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:59,410 INFO L93 Difference]: Finished difference Result 353 states and 915 transitions. [2020-01-16 18:59:59,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:59,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:59,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:59,411 INFO L225 Difference]: With dead ends: 353 [2020-01-16 18:59:59,411 INFO L226 Difference]: Without dead ends: 339 [2020-01-16 18:59:59,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:59:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-01-16 18:59:59,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 217. [2020-01-16 18:59:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-01-16 18:59:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 653 transitions. [2020-01-16 18:59:59,417 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 653 transitions. Word has length 19 [2020-01-16 18:59:59,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:59,417 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 653 transitions. [2020-01-16 18:59:59,417 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 653 transitions. [2020-01-16 18:59:59,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:59,417 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:59,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:59:59,418 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:59:59,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:59,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1720703712, now seen corresponding path program 164 times [2020-01-16 18:59:59,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:59,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992586943] [2020-01-16 18:59:59,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:59,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:59:59,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992586943] [2020-01-16 18:59:59,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:59,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:59,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521056611] [2020-01-16 18:59:59,645 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:59,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:59,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:59,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:59,646 INFO L87 Difference]: Start difference. First operand 217 states and 653 transitions. Second operand 8 states. [2020-01-16 18:59:59,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:59:59,727 INFO L93 Difference]: Finished difference Result 349 states and 904 transitions. [2020-01-16 18:59:59,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 18:59:59,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 18:59:59,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:59:59,729 INFO L225 Difference]: With dead ends: 349 [2020-01-16 18:59:59,729 INFO L226 Difference]: Without dead ends: 337 [2020-01-16 18:59:59,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:59:59,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-01-16 18:59:59,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 215. [2020-01-16 18:59:59,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-01-16 18:59:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 648 transitions. [2020-01-16 18:59:59,735 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 648 transitions. Word has length 19 [2020-01-16 18:59:59,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:59:59,735 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 648 transitions. [2020-01-16 18:59:59,735 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 18:59:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 648 transitions. [2020-01-16 18:59:59,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 18:59:59,735 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:59:59,736 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:59:59,736 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:59:59,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:59:59,736 INFO L82 PathProgramCache]: Analyzing trace with hash -472511498, now seen corresponding path program 165 times [2020-01-16 18:59:59,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:59:59,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996463299] [2020-01-16 18:59:59,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:59:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:59:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:59:59,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996463299] [2020-01-16 18:59:59,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:59:59,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 18:59:59,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284628739] [2020-01-16 18:59:59,943 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 18:59:59,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:59:59,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 18:59:59,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 18:59:59,944 INFO L87 Difference]: Start difference. First operand 215 states and 648 transitions. Second operand 8 states. [2020-01-16 19:00:00,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:00,031 INFO L93 Difference]: Finished difference Result 354 states and 915 transitions. [2020-01-16 19:00:00,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:00,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:00,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:00,032 INFO L225 Difference]: With dead ends: 354 [2020-01-16 19:00:00,032 INFO L226 Difference]: Without dead ends: 340 [2020-01-16 19:00:00,033 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-01-16 19:00:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 220. [2020-01-16 19:00:00,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-01-16 19:00:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 658 transitions. [2020-01-16 19:00:00,037 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 658 transitions. Word has length 19 [2020-01-16 19:00:00,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:00,037 INFO L478 AbstractCegarLoop]: Abstraction has 220 states and 658 transitions. [2020-01-16 19:00:00,037 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 658 transitions. [2020-01-16 19:00:00,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:00,038 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:00,038 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:00,038 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 19:00:00,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:00,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1114568416, now seen corresponding path program 166 times [2020-01-16 19:00:00,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:00,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351408249] [2020-01-16 19:00:00,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:00,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351408249] [2020-01-16 19:00:00,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:00,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:00,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043615483] [2020-01-16 19:00:00,241 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:00,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:00,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:00,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:00,242 INFO L87 Difference]: Start difference. First operand 220 states and 658 transitions. Second operand 8 states. [2020-01-16 19:00:00,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:00,334 INFO L93 Difference]: Finished difference Result 353 states and 908 transitions. [2020-01-16 19:00:00,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:00,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:00,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:00,335 INFO L225 Difference]: With dead ends: 353 [2020-01-16 19:00:00,335 INFO L226 Difference]: Without dead ends: 335 [2020-01-16 19:00:00,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:00,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-01-16 19:00:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 215. [2020-01-16 19:00:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-01-16 19:00:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 646 transitions. [2020-01-16 19:00:00,341 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 646 transitions. Word has length 19 [2020-01-16 19:00:00,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:00,341 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 646 transitions. [2020-01-16 19:00:00,341 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 646 transitions. [2020-01-16 19:00:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:00,341 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:00,341 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:00,341 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 19:00:00,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:00,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1498552428, now seen corresponding path program 167 times [2020-01-16 19:00:00,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:00,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302752828] [2020-01-16 19:00:00,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:00,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302752828] [2020-01-16 19:00:00,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:00,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:00,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352636284] [2020-01-16 19:00:00,552 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:00,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:00,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:00,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:00,553 INFO L87 Difference]: Start difference. First operand 215 states and 646 transitions. Second operand 8 states. [2020-01-16 19:00:00,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:00,634 INFO L93 Difference]: Finished difference Result 343 states and 885 transitions. [2020-01-16 19:00:00,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:00,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:00,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:00,635 INFO L225 Difference]: With dead ends: 343 [2020-01-16 19:00:00,635 INFO L226 Difference]: Without dead ends: 333 [2020-01-16 19:00:00,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 19:00:00,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-01-16 19:00:00,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 217. [2020-01-16 19:00:00,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-01-16 19:00:00,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 649 transitions. [2020-01-16 19:00:00,641 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 649 transitions. Word has length 19 [2020-01-16 19:00:00,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:00,641 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 649 transitions. [2020-01-16 19:00:00,642 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:00,642 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 649 transitions. [2020-01-16 19:00:00,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:00,642 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:00,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 19:00:00,642 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 19:00:00,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:00,642 INFO L82 PathProgramCache]: Analyzing trace with hash -9147432, now seen corresponding path program 168 times [2020-01-16 19:00:00,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:00,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567158856] [2020-01-16 19:00:00,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:00,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 19:00:00,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567158856] [2020-01-16 19:00:00,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:00,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:00,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112016577] [2020-01-16 19:00:00,851 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:00,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:00,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:00,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:00,851 INFO L87 Difference]: Start difference. First operand 217 states and 649 transitions. Second operand 8 states. [2020-01-16 19:00:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:00,940 INFO L93 Difference]: Finished difference Result 341 states and 880 transitions. [2020-01-16 19:00:00,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:00,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:00,941 INFO L225 Difference]: With dead ends: 341 [2020-01-16 19:00:00,941 INFO L226 Difference]: Without dead ends: 319 [2020-01-16 19:00:00,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-01-16 19:00:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 208. [2020-01-16 19:00:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-01-16 19:00:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 632 transitions. [2020-01-16 19:00:00,946 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 632 transitions. Word has length 19 [2020-01-16 19:00:00,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:00,947 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 632 transitions. [2020-01-16 19:00:00,947 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 632 transitions. [2020-01-16 19:00:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:00,947 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:00,947 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:00,947 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 19:00:00,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:00,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1927068432, now seen corresponding path program 169 times [2020-01-16 19:00:00,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:00,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853870772] [2020-01-16 19:00:00,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:01,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 19:00:01,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853870772] [2020-01-16 19:00:01,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:01,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:01,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015720369] [2020-01-16 19:00:01,223 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:01,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:01,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:01,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:01,224 INFO L87 Difference]: Start difference. First operand 208 states and 632 transitions. Second operand 8 states. [2020-01-16 19:00:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:01,281 INFO L93 Difference]: Finished difference Result 378 states and 982 transitions. [2020-01-16 19:00:01,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:01,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:01,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:01,282 INFO L225 Difference]: With dead ends: 378 [2020-01-16 19:00:01,282 INFO L226 Difference]: Without dead ends: 362 [2020-01-16 19:00:01,283 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:01,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-01-16 19:00:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 224. [2020-01-16 19:00:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-01-16 19:00:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 674 transitions. [2020-01-16 19:00:01,288 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 674 transitions. Word has length 19 [2020-01-16 19:00:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:01,289 INFO L478 AbstractCegarLoop]: Abstraction has 224 states and 674 transitions. [2020-01-16 19:00:01,289 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 674 transitions. [2020-01-16 19:00:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:01,289 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:01,289 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:01,290 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 19:00:01,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:01,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1552417246, now seen corresponding path program 170 times [2020-01-16 19:00:01,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:01,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263045730] [2020-01-16 19:00:01,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00: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 19:00:01,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263045730] [2020-01-16 19:00:01,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:01,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:01,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117287889] [2020-01-16 19:00:01,511 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:01,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:01,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:01,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:01,512 INFO L87 Difference]: Start difference. First operand 224 states and 674 transitions. Second operand 8 states. [2020-01-16 19:00:01,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:01,600 INFO L93 Difference]: Finished difference Result 376 states and 972 transitions. [2020-01-16 19:00:01,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:01,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:01,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:01,601 INFO L225 Difference]: With dead ends: 376 [2020-01-16 19:00:01,602 INFO L226 Difference]: Without dead ends: 354 [2020-01-16 19:00:01,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 19:00:01,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-01-16 19:00:01,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 216. [2020-01-16 19:00:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 19:00:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 656 transitions. [2020-01-16 19:00:01,607 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 656 transitions. Word has length 19 [2020-01-16 19:00:01,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:01,608 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 656 transitions. [2020-01-16 19:00:01,608 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:01,608 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 656 transitions. [2020-01-16 19:00:01,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:01,608 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:01,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 19:00:01,608 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 19:00:01,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:01,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1396871126, now seen corresponding path program 171 times [2020-01-16 19:00:01,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:01,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559138832] [2020-01-16 19:00:01,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:01,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 19:00:01,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559138832] [2020-01-16 19:00:01,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:01,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:01,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608736515] [2020-01-16 19:00:01,824 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:01,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:01,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:01,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:01,824 INFO L87 Difference]: Start difference. First operand 216 states and 656 transitions. Second operand 8 states. [2020-01-16 19:00:01,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:01,896 INFO L93 Difference]: Finished difference Result 369 states and 955 transitions. [2020-01-16 19:00:01,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:01,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:01,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:01,897 INFO L225 Difference]: With dead ends: 369 [2020-01-16 19:00:01,897 INFO L226 Difference]: Without dead ends: 353 [2020-01-16 19:00:01,898 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:01,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-01-16 19:00:01,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 219. [2020-01-16 19:00:01,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-01-16 19:00:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 660 transitions. [2020-01-16 19:00:01,903 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 660 transitions. Word has length 19 [2020-01-16 19:00:01,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:01,903 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 660 transitions. [2020-01-16 19:00:01,903 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 660 transitions. [2020-01-16 19:00:01,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:01,904 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:01,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 19:00:01,904 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 19:00:01,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:01,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1137812900, now seen corresponding path program 172 times [2020-01-16 19:00:01,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:01,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093594641] [2020-01-16 19:00:01,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:02,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093594641] [2020-01-16 19:00:02,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:02,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:02,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85811230] [2020-01-16 19:00:02,209 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:02,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:02,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:02,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:02,210 INFO L87 Difference]: Start difference. First operand 219 states and 660 transitions. Second operand 8 states. [2020-01-16 19:00:02,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:02,305 INFO L93 Difference]: Finished difference Result 363 states and 940 transitions. [2020-01-16 19:00:02,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:02,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:02,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:02,307 INFO L225 Difference]: With dead ends: 363 [2020-01-16 19:00:02,308 INFO L226 Difference]: Without dead ends: 350 [2020-01-16 19:00:02,308 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 19:00:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-01-16 19:00:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 216. [2020-01-16 19:00:02,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 19:00:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 653 transitions. [2020-01-16 19:00:02,317 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 653 transitions. Word has length 19 [2020-01-16 19:00:02,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:02,318 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 653 transitions. [2020-01-16 19:00:02,318 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:02,318 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 653 transitions. [2020-01-16 19:00:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:02,319 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:02,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 19:00:02,319 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 19:00:02,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:02,320 INFO L82 PathProgramCache]: Analyzing trace with hash 525434594, now seen corresponding path program 173 times [2020-01-16 19:00:02,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:02,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52484239] [2020-01-16 19:00:02,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:02,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 19:00:02,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52484239] [2020-01-16 19:00:02,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:02,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:02,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254835148] [2020-01-16 19:00:02,604 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:02,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:02,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:02,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:02,605 INFO L87 Difference]: Start difference. First operand 216 states and 653 transitions. Second operand 8 states. [2020-01-16 19:00:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:02,736 INFO L93 Difference]: Finished difference Result 364 states and 944 transitions. [2020-01-16 19:00:02,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:02,737 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:02,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:02,738 INFO L225 Difference]: With dead ends: 364 [2020-01-16 19:00:02,738 INFO L226 Difference]: Without dead ends: 350 [2020-01-16 19:00:02,739 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 19:00:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-01-16 19:00:02,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 218. [2020-01-16 19:00:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 19:00:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 656 transitions. [2020-01-16 19:00:02,748 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 656 transitions. Word has length 19 [2020-01-16 19:00:02,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:02,748 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 656 transitions. [2020-01-16 19:00:02,749 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:02,749 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 656 transitions. [2020-01-16 19:00:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:02,750 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:02,750 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:02,751 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 19:00:02,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:02,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1645564424, now seen corresponding path program 174 times [2020-01-16 19:00:02,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:02,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136517941] [2020-01-16 19:00:02,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:02,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 19:00:02,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136517941] [2020-01-16 19:00:02,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:02,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:02,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728494661] [2020-01-16 19:00:02,973 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:02,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:02,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:02,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:02,974 INFO L87 Difference]: Start difference. First operand 218 states and 656 transitions. Second operand 8 states. [2020-01-16 19:00:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:03,039 INFO L93 Difference]: Finished difference Result 360 states and 933 transitions. [2020-01-16 19:00:03,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:03,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:03,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:03,040 INFO L225 Difference]: With dead ends: 360 [2020-01-16 19:00:03,041 INFO L226 Difference]: Without dead ends: 344 [2020-01-16 19:00:03,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 19:00:03,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-01-16 19:00:03,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 212. [2020-01-16 19:00:03,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 19:00:03,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 644 transitions. [2020-01-16 19:00:03,046 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 644 transitions. Word has length 19 [2020-01-16 19:00:03,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:03,046 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 644 transitions. [2020-01-16 19:00:03,046 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:03,047 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 644 transitions. [2020-01-16 19:00:03,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:03,047 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:03,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 19:00:03,047 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 19:00:03,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:03,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1945413138, now seen corresponding path program 175 times [2020-01-16 19:00:03,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:03,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957114905] [2020-01-16 19:00:03,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:03,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957114905] [2020-01-16 19:00:03,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:03,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:03,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779844338] [2020-01-16 19:00:03,263 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:03,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:03,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:03,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:03,264 INFO L87 Difference]: Start difference. First operand 212 states and 644 transitions. Second operand 8 states. [2020-01-16 19:00:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:03,331 INFO L93 Difference]: Finished difference Result 380 states and 985 transitions. [2020-01-16 19:00:03,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:03,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:03,332 INFO L225 Difference]: With dead ends: 380 [2020-01-16 19:00:03,332 INFO L226 Difference]: Without dead ends: 364 [2020-01-16 19:00:03,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 19:00:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-01-16 19:00:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 226. [2020-01-16 19:00:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-01-16 19:00:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 679 transitions. [2020-01-16 19:00:03,337 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 679 transitions. Word has length 19 [2020-01-16 19:00:03,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:03,337 INFO L478 AbstractCegarLoop]: Abstraction has 226 states and 679 transitions. [2020-01-16 19:00:03,337 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 679 transitions. [2020-01-16 19:00:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:03,339 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:03,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 19:00:03,339 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 19:00:03,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:03,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1974902972, now seen corresponding path program 176 times [2020-01-16 19:00:03,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:03,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505386482] [2020-01-16 19:00:03,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:03,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 19:00:03,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505386482] [2020-01-16 19:00:03,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:03,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:03,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62594488] [2020-01-16 19:00:03,557 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:03,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:03,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:03,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:03,558 INFO L87 Difference]: Start difference. First operand 226 states and 679 transitions. Second operand 8 states. [2020-01-16 19:00:03,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:03,660 INFO L93 Difference]: Finished difference Result 378 states and 975 transitions. [2020-01-16 19:00:03,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:03,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:03,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:03,662 INFO L225 Difference]: With dead ends: 378 [2020-01-16 19:00:03,662 INFO L226 Difference]: Without dead ends: 356 [2020-01-16 19:00:03,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:03,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2020-01-16 19:00:03,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 218. [2020-01-16 19:00:03,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 19:00:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 659 transitions. [2020-01-16 19:00:03,668 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 659 transitions. Word has length 19 [2020-01-16 19:00:03,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:03,668 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 659 transitions. [2020-01-16 19:00:03,668 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:03,669 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 659 transitions. [2020-01-16 19:00:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:03,669 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:03,669 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:03,669 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 19:00:03,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:03,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1493760628, now seen corresponding path program 177 times [2020-01-16 19:00:03,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:03,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430878275] [2020-01-16 19:00:03,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:03,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 19:00:03,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430878275] [2020-01-16 19:00:03,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:03,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:03,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534262747] [2020-01-16 19:00:03,879 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:03,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:03,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:03,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:03,879 INFO L87 Difference]: Start difference. First operand 218 states and 659 transitions. Second operand 8 states. [2020-01-16 19:00:03,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:03,955 INFO L93 Difference]: Finished difference Result 375 states and 968 transitions. [2020-01-16 19:00:03,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:03,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:03,956 INFO L225 Difference]: With dead ends: 375 [2020-01-16 19:00:03,956 INFO L226 Difference]: Without dead ends: 359 [2020-01-16 19:00:03,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:03,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-01-16 19:00:03,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 223. [2020-01-16 19:00:03,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-01-16 19:00:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 668 transitions. [2020-01-16 19:00:03,962 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 668 transitions. Word has length 19 [2020-01-16 19:00:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:03,962 INFO L478 AbstractCegarLoop]: Abstraction has 223 states and 668 transitions. [2020-01-16 19:00:03,962 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:03,962 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 668 transitions. [2020-01-16 19:00:03,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:03,962 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:03,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 19:00:03,963 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 19:00:03,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:03,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2050144574, now seen corresponding path program 178 times [2020-01-16 19:00:03,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:03,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256183495] [2020-01-16 19:00:03,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:04,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256183495] [2020-01-16 19:00:04,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:04,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:04,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004818737] [2020-01-16 19:00:04,166 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:04,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:04,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:04,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:04,166 INFO L87 Difference]: Start difference. First operand 223 states and 668 transitions. Second operand 8 states. [2020-01-16 19:00:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:04,256 INFO L93 Difference]: Finished difference Result 371 states and 956 transitions. [2020-01-16 19:00:04,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:04,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:04,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:04,257 INFO L225 Difference]: With dead ends: 371 [2020-01-16 19:00:04,258 INFO L226 Difference]: Without dead ends: 354 [2020-01-16 19:00:04,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 19:00:04,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-01-16 19:00:04,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 218. [2020-01-16 19:00:04,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 19:00:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 654 transitions. [2020-01-16 19:00:04,263 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 654 transitions. Word has length 19 [2020-01-16 19:00:04,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:04,264 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 654 transitions. [2020-01-16 19:00:04,264 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:04,264 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 654 transitions. [2020-01-16 19:00:04,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:04,264 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:04,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 19:00:04,264 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 19:00:04,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:04,265 INFO L82 PathProgramCache]: Analyzing trace with hash 780024098, now seen corresponding path program 179 times [2020-01-16 19:00:04,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:04,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181896329] [2020-01-16 19:00:04,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:04,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181896329] [2020-01-16 19:00:04,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:04,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:04,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095835395] [2020-01-16 19:00:04,461 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:04,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:04,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:04,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:04,462 INFO L87 Difference]: Start difference. First operand 218 states and 654 transitions. Second operand 8 states. [2020-01-16 19:00:04,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:04,557 INFO L93 Difference]: Finished difference Result 370 states and 955 transitions. [2020-01-16 19:00:04,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:04,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:04,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:04,558 INFO L225 Difference]: With dead ends: 370 [2020-01-16 19:00:04,558 INFO L226 Difference]: Without dead ends: 356 [2020-01-16 19:00:04,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:04,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2020-01-16 19:00:04,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 222. [2020-01-16 19:00:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-01-16 19:00:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 662 transitions. [2020-01-16 19:00:04,565 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 662 transitions. Word has length 19 [2020-01-16 19:00:04,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:04,565 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 662 transitions. [2020-01-16 19:00:04,565 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:04,565 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 662 transitions. [2020-01-16 19:00:04,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:04,565 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:04,565 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:04,566 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 19:00:04,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:04,566 INFO L82 PathProgramCache]: Analyzing trace with hash 779429452, now seen corresponding path program 180 times [2020-01-16 19:00:04,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:04,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129997845] [2020-01-16 19:00:04,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:04,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 19:00:04,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129997845] [2020-01-16 19:00:04,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:04,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:04,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31213779] [2020-01-16 19:00:04,767 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:04,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:04,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:04,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:04,767 INFO L87 Difference]: Start difference. First operand 222 states and 662 transitions. Second operand 8 states. [2020-01-16 19:00:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:04,863 INFO L93 Difference]: Finished difference Result 368 states and 947 transitions. [2020-01-16 19:00:04,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:04,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:04,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:04,864 INFO L225 Difference]: With dead ends: 368 [2020-01-16 19:00:04,864 INFO L226 Difference]: Without dead ends: 346 [2020-01-16 19:00:04,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-01-16 19:00:04,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 212. [2020-01-16 19:00:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 19:00:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 640 transitions. [2020-01-16 19:00:04,870 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 640 transitions. Word has length 19 [2020-01-16 19:00:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:04,870 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 640 transitions. [2020-01-16 19:00:04,870 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:04,870 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 640 transitions. [2020-01-16 19:00:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:04,870 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:04,871 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:04,871 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 19:00:04,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:04,871 INFO L82 PathProgramCache]: Analyzing trace with hash -637075472, now seen corresponding path program 181 times [2020-01-16 19:00:04,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:04,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914304282] [2020-01-16 19:00:04,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:05,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914304282] [2020-01-16 19:00:05,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:05,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:05,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676172061] [2020-01-16 19:00:05,069 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:05,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:05,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:05,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:05,070 INFO L87 Difference]: Start difference. First operand 212 states and 640 transitions. Second operand 8 states. [2020-01-16 19:00:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:05,150 INFO L93 Difference]: Finished difference Result 357 states and 917 transitions. [2020-01-16 19:00:05,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:05,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:05,151 INFO L225 Difference]: With dead ends: 357 [2020-01-16 19:00:05,151 INFO L226 Difference]: Without dead ends: 341 [2020-01-16 19:00:05,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:05,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-01-16 19:00:05,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 218. [2020-01-16 19:00:05,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 19:00:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 654 transitions. [2020-01-16 19:00:05,156 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 654 transitions. Word has length 19 [2020-01-16 19:00:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:05,156 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 654 transitions. [2020-01-16 19:00:05,156 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 654 transitions. [2020-01-16 19:00:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:05,157 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:05,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 19:00:05,157 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 19:00:05,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:05,157 INFO L82 PathProgramCache]: Analyzing trace with hash -378017246, now seen corresponding path program 182 times [2020-01-16 19:00:05,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:05,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234335984] [2020-01-16 19:00:05,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:05,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 19:00:05,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234335984] [2020-01-16 19:00:05,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:05,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:05,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661892429] [2020-01-16 19:00:05,352 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:05,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:05,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:05,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:05,352 INFO L87 Difference]: Start difference. First operand 218 states and 654 transitions. Second operand 8 states. [2020-01-16 19:00:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:05,425 INFO L93 Difference]: Finished difference Result 351 states and 902 transitions. [2020-01-16 19:00:05,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:05,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:05,426 INFO L225 Difference]: With dead ends: 351 [2020-01-16 19:00:05,426 INFO L226 Difference]: Without dead ends: 338 [2020-01-16 19:00:05,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 19:00:05,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-01-16 19:00:05,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 215. [2020-01-16 19:00:05,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-01-16 19:00:05,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 647 transitions. [2020-01-16 19:00:05,432 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 647 transitions. Word has length 19 [2020-01-16 19:00:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:05,432 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 647 transitions. [2020-01-16 19:00:05,432 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 647 transitions. [2020-01-16 19:00:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:05,433 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:05,433 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:05,433 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 19:00:05,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:05,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2057453970, now seen corresponding path program 183 times [2020-01-16 19:00:05,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:05,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928743563] [2020-01-16 19:00:05,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:05,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928743563] [2020-01-16 19:00:05,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:05,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:05,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635147178] [2020-01-16 19:00:05,658 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:05,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:05,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:05,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:05,658 INFO L87 Difference]: Start difference. First operand 215 states and 647 transitions. Second operand 8 states. [2020-01-16 19:00:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:05,730 INFO L93 Difference]: Finished difference Result 356 states and 912 transitions. [2020-01-16 19:00:05,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:05,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:05,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:05,731 INFO L225 Difference]: With dead ends: 356 [2020-01-16 19:00:05,731 INFO L226 Difference]: Without dead ends: 340 [2020-01-16 19:00:05,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 19:00:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-01-16 19:00:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 220. [2020-01-16 19:00:05,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-01-16 19:00:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 656 transitions. [2020-01-16 19:00:05,736 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 656 transitions. Word has length 19 [2020-01-16 19:00:05,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:05,736 INFO L478 AbstractCegarLoop]: Abstraction has 220 states and 656 transitions. [2020-01-16 19:00:05,736 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:05,736 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 656 transitions. [2020-01-16 19:00:05,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:05,737 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:05,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 19:00:05,737 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 19:00:05,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:05,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1306391876, now seen corresponding path program 184 times [2020-01-16 19:00:05,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:05,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622639219] [2020-01-16 19:00:05,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:05,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:05,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622639219] [2020-01-16 19:00:05,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:05,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:05,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061887780] [2020-01-16 19:00:05,944 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:05,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:05,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:05,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:05,944 INFO L87 Difference]: Start difference. First operand 220 states and 656 transitions. Second operand 8 states. [2020-01-16 19:00:06,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:06,049 INFO L93 Difference]: Finished difference Result 352 states and 900 transitions. [2020-01-16 19:00:06,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:06,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:06,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:06,050 INFO L225 Difference]: With dead ends: 352 [2020-01-16 19:00:06,050 INFO L226 Difference]: Without dead ends: 335 [2020-01-16 19:00:06,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-01-16 19:00:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 215. [2020-01-16 19:00:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-01-16 19:00:06,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 644 transitions. [2020-01-16 19:00:06,056 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 644 transitions. Word has length 19 [2020-01-16 19:00:06,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:06,056 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 644 transitions. [2020-01-16 19:00:06,056 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 644 transitions. [2020-01-16 19:00:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:06,057 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:06,057 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:06,057 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 19:00:06,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:06,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1837091698, now seen corresponding path program 185 times [2020-01-16 19:00:06,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:06,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771941254] [2020-01-16 19:00:06,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:06,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 19:00:06,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771941254] [2020-01-16 19:00:06,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:06,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:06,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800479325] [2020-01-16 19:00:06,283 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:06,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:06,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:06,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:06,283 INFO L87 Difference]: Start difference. First operand 215 states and 644 transitions. Second operand 8 states. [2020-01-16 19:00:06,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:06,346 INFO L93 Difference]: Finished difference Result 341 states and 876 transitions. [2020-01-16 19:00:06,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:06,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:06,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:06,348 INFO L225 Difference]: With dead ends: 341 [2020-01-16 19:00:06,348 INFO L226 Difference]: Without dead ends: 331 [2020-01-16 19:00:06,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 19:00:06,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-01-16 19:00:06,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 217. [2020-01-16 19:00:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-01-16 19:00:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 647 transitions. [2020-01-16 19:00:06,352 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 647 transitions. Word has length 19 [2020-01-16 19:00:06,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:06,352 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 647 transitions. [2020-01-16 19:00:06,353 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 647 transitions. [2020-01-16 19:00:06,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:06,353 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:06,353 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:06,353 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 19:00:06,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:06,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1602568944, now seen corresponding path program 186 times [2020-01-16 19:00:06,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:06,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220447096] [2020-01-16 19:00:06,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:06,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 19:00:06,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220447096] [2020-01-16 19:00:06,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:06,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:06,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897626949] [2020-01-16 19:00:06,590 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:06,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:06,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:06,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:06,590 INFO L87 Difference]: Start difference. First operand 217 states and 647 transitions. Second operand 8 states. [2020-01-16 19:00:06,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:06,697 INFO L93 Difference]: Finished difference Result 339 states and 871 transitions. [2020-01-16 19:00:06,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:06,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:06,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:06,698 INFO L225 Difference]: With dead ends: 339 [2020-01-16 19:00:06,698 INFO L226 Difference]: Without dead ends: 322 [2020-01-16 19:00:06,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 19:00:06,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-01-16 19:00:06,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 212. [2020-01-16 19:00:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 19:00:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 637 transitions. [2020-01-16 19:00:06,705 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 637 transitions. Word has length 19 [2020-01-16 19:00:06,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:06,705 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 637 transitions. [2020-01-16 19:00:06,705 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 637 transitions. [2020-01-16 19:00:06,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:06,706 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:06,706 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:06,706 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 19:00:06,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:06,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2036640602, now seen corresponding path program 187 times [2020-01-16 19:00:06,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:06,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348424368] [2020-01-16 19:00:06,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:06,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 19:00:06,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348424368] [2020-01-16 19:00:06,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:06,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:06,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128892418] [2020-01-16 19:00:06,941 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:06,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:06,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:06,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:06,942 INFO L87 Difference]: Start difference. First operand 212 states and 637 transitions. Second operand 8 states. [2020-01-16 19:00:07,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:07,027 INFO L93 Difference]: Finished difference Result 347 states and 896 transitions. [2020-01-16 19:00:07,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:07,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:07,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:07,028 INFO L225 Difference]: With dead ends: 347 [2020-01-16 19:00:07,028 INFO L226 Difference]: Without dead ends: 333 [2020-01-16 19:00:07,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 19:00:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-01-16 19:00:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 216. [2020-01-16 19:00:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 19:00:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 647 transitions. [2020-01-16 19:00:07,034 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 647 transitions. Word has length 19 [2020-01-16 19:00:07,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:07,034 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 647 transitions. [2020-01-16 19:00:07,034 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 647 transitions. [2020-01-16 19:00:07,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:07,035 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:07,035 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:07,037 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 19:00:07,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:07,038 INFO L82 PathProgramCache]: Analyzing trace with hash -916510772, now seen corresponding path program 188 times [2020-01-16 19:00:07,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:07,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193761168] [2020-01-16 19:00:07,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:07,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193761168] [2020-01-16 19:00:07,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:07,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:07,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31626949] [2020-01-16 19:00:07,234 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:07,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:07,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:07,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:07,235 INFO L87 Difference]: Start difference. First operand 216 states and 647 transitions. Second operand 8 states. [2020-01-16 19:00:07,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:07,300 INFO L93 Difference]: Finished difference Result 343 states and 885 transitions. [2020-01-16 19:00:07,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:07,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:07,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:07,301 INFO L225 Difference]: With dead ends: 343 [2020-01-16 19:00:07,301 INFO L226 Difference]: Without dead ends: 331 [2020-01-16 19:00:07,302 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 19:00:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-01-16 19:00:07,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 214. [2020-01-16 19:00:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 19:00:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-01-16 19:00:07,307 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-01-16 19:00:07,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:07,308 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-01-16 19:00:07,308 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-01-16 19:00:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:07,308 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:07,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 19:00:07,309 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 19:00:07,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:07,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1513624196, now seen corresponding path program 189 times [2020-01-16 19:00:07,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:07,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594580658] [2020-01-16 19:00:07,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:07,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 19:00:07,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594580658] [2020-01-16 19:00:07,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:07,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:07,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463555449] [2020-01-16 19:00:07,491 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:07,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:07,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:07,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:07,491 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-01-16 19:00:07,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:07,590 INFO L93 Difference]: Finished difference Result 347 states and 894 transitions. [2020-01-16 19:00:07,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:07,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:07,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:07,592 INFO L225 Difference]: With dead ends: 347 [2020-01-16 19:00:07,592 INFO L226 Difference]: Without dead ends: 333 [2020-01-16 19:00:07,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:07,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-01-16 19:00:07,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 218. [2020-01-16 19:00:07,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 19:00:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 650 transitions. [2020-01-16 19:00:07,598 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 650 transitions. Word has length 19 [2020-01-16 19:00:07,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:07,599 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 650 transitions. [2020-01-16 19:00:07,599 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:07,599 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 650 transitions. [2020-01-16 19:00:07,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:07,599 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:07,600 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:07,600 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 19:00:07,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:07,600 INFO L82 PathProgramCache]: Analyzing trace with hash 768327052, now seen corresponding path program 190 times [2020-01-16 19:00:07,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:07,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009378350] [2020-01-16 19:00:07,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:07,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 19:00:07,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009378350] [2020-01-16 19:00:07,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:07,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:07,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771747082] [2020-01-16 19:00:07,813 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:07,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:07,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:07,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:07,814 INFO L87 Difference]: Start difference. First operand 218 states and 650 transitions. Second operand 8 states. [2020-01-16 19:00:07,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:07,901 INFO L93 Difference]: Finished difference Result 345 states and 886 transitions. [2020-01-16 19:00:07,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:07,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:07,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:07,902 INFO L225 Difference]: With dead ends: 345 [2020-01-16 19:00:07,902 INFO L226 Difference]: Without dead ends: 329 [2020-01-16 19:00:07,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 19:00:07,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-01-16 19:00:07,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 214. [2020-01-16 19:00:07,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 19:00:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 640 transitions. [2020-01-16 19:00:07,908 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 640 transitions. Word has length 19 [2020-01-16 19:00:07,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:07,908 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 640 transitions. [2020-01-16 19:00:07,908 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 640 transitions. [2020-01-16 19:00:07,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:07,909 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:07,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 19:00:07,909 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 19:00:07,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:07,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1451740574, now seen corresponding path program 191 times [2020-01-16 19:00:07,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:07,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698817418] [2020-01-16 19:00:07,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:08,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 19:00:08,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698817418] [2020-01-16 19:00:08,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:08,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:08,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631357894] [2020-01-16 19:00:08,103 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:08,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:08,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:08,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:08,104 INFO L87 Difference]: Start difference. First operand 214 states and 640 transitions. Second operand 8 states. [2020-01-16 19:00:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:08,168 INFO L93 Difference]: Finished difference Result 337 states and 867 transitions. [2020-01-16 19:00:08,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:08,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:08,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:08,169 INFO L225 Difference]: With dead ends: 337 [2020-01-16 19:00:08,169 INFO L226 Difference]: Without dead ends: 327 [2020-01-16 19:00:08,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-01-16 19:00:08,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 216. [2020-01-16 19:00:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 19:00:08,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 643 transitions. [2020-01-16 19:00:08,174 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 643 transitions. Word has length 19 [2020-01-16 19:00:08,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:08,174 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 643 transitions. [2020-01-16 19:00:08,174 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:08,174 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 643 transitions. [2020-01-16 19:00:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:08,175 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:08,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 19:00:08,175 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 19:00:08,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:08,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1987920068, now seen corresponding path program 192 times [2020-01-16 19:00:08,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:08,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399589821] [2020-01-16 19:00:08,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:08,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399589821] [2020-01-16 19:00:08,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:08,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:08,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910835010] [2020-01-16 19:00:08,374 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:08,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:08,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:08,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:08,374 INFO L87 Difference]: Start difference. First operand 216 states and 643 transitions. Second operand 8 states. [2020-01-16 19:00:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:08,464 INFO L93 Difference]: Finished difference Result 335 states and 862 transitions. [2020-01-16 19:00:08,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:08,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:08,466 INFO L225 Difference]: With dead ends: 335 [2020-01-16 19:00:08,466 INFO L226 Difference]: Without dead ends: 315 [2020-01-16 19:00:08,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 19:00:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-01-16 19:00:08,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 208. [2020-01-16 19:00:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-01-16 19:00:08,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 628 transitions. [2020-01-16 19:00:08,472 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 628 transitions. Word has length 19 [2020-01-16 19:00:08,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:08,472 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 628 transitions. [2020-01-16 19:00:08,472 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 628 transitions. [2020-01-16 19:00:08,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:08,473 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:08,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 19:00:08,473 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 19:00:08,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:08,473 INFO L82 PathProgramCache]: Analyzing trace with hash 807111978, now seen corresponding path program 193 times [2020-01-16 19:00:08,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:08,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064990200] [2020-01-16 19:00:08,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:08,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 19:00:08,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064990200] [2020-01-16 19:00:08,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:08,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:08,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97918805] [2020-01-16 19:00:08,713 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:08,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:08,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:08,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:08,714 INFO L87 Difference]: Start difference. First operand 208 states and 628 transitions. Second operand 8 states. [2020-01-16 19:00:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:08,783 INFO L93 Difference]: Finished difference Result 357 states and 929 transitions. [2020-01-16 19:00:08,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:08,784 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:08,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:08,784 INFO L225 Difference]: With dead ends: 357 [2020-01-16 19:00:08,785 INFO L226 Difference]: Without dead ends: 341 [2020-01-16 19:00:08,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 19:00:08,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-01-16 19:00:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 217. [2020-01-16 19:00:08,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-01-16 19:00:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 655 transitions. [2020-01-16 19:00:08,789 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 655 transitions. Word has length 19 [2020-01-16 19:00:08,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:08,790 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 655 transitions. [2020-01-16 19:00:08,790 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:08,790 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 655 transitions. [2020-01-16 19:00:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:08,790 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:08,791 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:08,791 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 19:00:08,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:08,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1066170204, now seen corresponding path program 194 times [2020-01-16 19:00:08,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:08,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126253006] [2020-01-16 19:00:08,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:08,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126253006] [2020-01-16 19:00:08,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:08,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:08,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188839738] [2020-01-16 19:00:08,999 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:08,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:09,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:09,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:09,000 INFO L87 Difference]: Start difference. First operand 217 states and 655 transitions. Second operand 8 states. [2020-01-16 19:00:09,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:09,069 INFO L93 Difference]: Finished difference Result 351 states and 914 transitions. [2020-01-16 19:00:09,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:09,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:09,071 INFO L225 Difference]: With dead ends: 351 [2020-01-16 19:00:09,071 INFO L226 Difference]: Without dead ends: 338 [2020-01-16 19:00:09,071 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:09,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-01-16 19:00:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 214. [2020-01-16 19:00:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 19:00:09,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 648 transitions. [2020-01-16 19:00:09,076 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 648 transitions. Word has length 19 [2020-01-16 19:00:09,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:09,077 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 648 transitions. [2020-01-16 19:00:09,077 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:09,077 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 648 transitions. [2020-01-16 19:00:09,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:09,077 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:09,077 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:09,077 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 19:00:09,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:09,078 INFO L82 PathProgramCache]: Analyzing trace with hash -793325876, now seen corresponding path program 195 times [2020-01-16 19:00:09,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:09,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223213848] [2020-01-16 19:00:09,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:09,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223213848] [2020-01-16 19:00:09,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:09,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:09,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861325241] [2020-01-16 19:00:09,290 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:09,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:09,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:09,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:09,291 INFO L87 Difference]: Start difference. First operand 214 states and 648 transitions. Second operand 8 states. [2020-01-16 19:00:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:09,374 INFO L93 Difference]: Finished difference Result 361 states and 938 transitions. [2020-01-16 19:00:09,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:09,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:09,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:09,376 INFO L225 Difference]: With dead ends: 361 [2020-01-16 19:00:09,376 INFO L226 Difference]: Without dead ends: 345 [2020-01-16 19:00:09,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 19:00:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2020-01-16 19:00:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 219. [2020-01-16 19:00:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-01-16 19:00:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 657 transitions. [2020-01-16 19:00:09,382 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 657 transitions. Word has length 19 [2020-01-16 19:00:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:09,382 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 657 transitions. [2020-01-16 19:00:09,382 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 657 transitions. [2020-01-16 19:00:09,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:09,382 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:09,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 19:00:09,382 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 19:00:09,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:09,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1544387970, now seen corresponding path program 196 times [2020-01-16 19:00:09,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:09,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781243295] [2020-01-16 19:00:09,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:09,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 19:00:09,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781243295] [2020-01-16 19:00:09,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:09,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:09,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408185885] [2020-01-16 19:00:09,625 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:09,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:09,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:09,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:09,626 INFO L87 Difference]: Start difference. First operand 219 states and 657 transitions. Second operand 8 states. [2020-01-16 19:00:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:09,719 INFO L93 Difference]: Finished difference Result 357 states and 926 transitions. [2020-01-16 19:00:09,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:09,719 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:09,720 INFO L225 Difference]: With dead ends: 357 [2020-01-16 19:00:09,721 INFO L226 Difference]: Without dead ends: 340 [2020-01-16 19:00:09,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:09,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-01-16 19:00:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 214. [2020-01-16 19:00:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 19:00:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 645 transitions. [2020-01-16 19:00:09,726 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 645 transitions. Word has length 19 [2020-01-16 19:00:09,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:09,727 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 645 transitions. [2020-01-16 19:00:09,727 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:09,727 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 645 transitions. [2020-01-16 19:00:09,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:09,727 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:09,727 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:09,728 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 19:00:09,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:09,728 INFO L82 PathProgramCache]: Analyzing trace with hash -392904248, now seen corresponding path program 197 times [2020-01-16 19:00:09,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:09,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326501970] [2020-01-16 19:00:09,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:09,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 19:00:09,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326501970] [2020-01-16 19:00:09,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:09,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:09,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238169528] [2020-01-16 19:00:09,970 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:09,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:09,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:09,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:09,971 INFO L87 Difference]: Start difference. First operand 214 states and 645 transitions. Second operand 8 states. [2020-01-16 19:00:10,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:10,049 INFO L93 Difference]: Finished difference Result 346 states and 902 transitions. [2020-01-16 19:00:10,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:10,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:10,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:10,051 INFO L225 Difference]: With dead ends: 346 [2020-01-16 19:00:10,051 INFO L226 Difference]: Without dead ends: 336 [2020-01-16 19:00:10,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:10,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-01-16 19:00:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 216. [2020-01-16 19:00:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 19:00:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 648 transitions. [2020-01-16 19:00:10,056 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 648 transitions. Word has length 19 [2020-01-16 19:00:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:10,056 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 648 transitions. [2020-01-16 19:00:10,056 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 648 transitions. [2020-01-16 19:00:10,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:10,057 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:10,057 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:10,057 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 19:00:10,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:10,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1248210902, now seen corresponding path program 198 times [2020-01-16 19:00:10,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:10,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128630523] [2020-01-16 19:00:10,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:10,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128630523] [2020-01-16 19:00:10,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:10,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:10,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289504833] [2020-01-16 19:00:10,264 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:10,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:10,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:10,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:10,265 INFO L87 Difference]: Start difference. First operand 216 states and 648 transitions. Second operand 8 states. [2020-01-16 19:00:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:10,363 INFO L93 Difference]: Finished difference Result 348 states and 905 transitions. [2020-01-16 19:00:10,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:10,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:10,364 INFO L225 Difference]: With dead ends: 348 [2020-01-16 19:00:10,364 INFO L226 Difference]: Without dead ends: 331 [2020-01-16 19:00:10,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:10,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-01-16 19:00:10,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 211. [2020-01-16 19:00:10,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-01-16 19:00:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 638 transitions. [2020-01-16 19:00:10,371 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 638 transitions. Word has length 19 [2020-01-16 19:00:10,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:10,371 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 638 transitions. [2020-01-16 19:00:10,371 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:10,371 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 638 transitions. [2020-01-16 19:00:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:10,372 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:10,372 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:10,372 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 19:00:10,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:10,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1561821240, now seen corresponding path program 199 times [2020-01-16 19:00:10,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:10,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392646868] [2020-01-16 19:00:10,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:10,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 19:00:10,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392646868] [2020-01-16 19:00:10,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:10,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:10,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88792834] [2020-01-16 19:00:10,572 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:10,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:10,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:10,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:10,572 INFO L87 Difference]: Start difference. First operand 211 states and 638 transitions. Second operand 8 states. [2020-01-16 19:00:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:10,634 INFO L93 Difference]: Finished difference Result 359 states and 931 transitions. [2020-01-16 19:00:10,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:10,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:10,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:10,635 INFO L225 Difference]: With dead ends: 359 [2020-01-16 19:00:10,636 INFO L226 Difference]: Without dead ends: 343 [2020-01-16 19:00:10,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 19:00:10,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-01-16 19:00:10,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 217. [2020-01-16 19:00:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-01-16 19:00:10,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 652 transitions. [2020-01-16 19:00:10,641 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 652 transitions. Word has length 19 [2020-01-16 19:00:10,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:10,641 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 652 transitions. [2020-01-16 19:00:10,641 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:10,641 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 652 transitions. [2020-01-16 19:00:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:10,641 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:10,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 19:00:10,642 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 19:00:10,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:10,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1302763014, now seen corresponding path program 200 times [2020-01-16 19:00:10,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:10,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675400354] [2020-01-16 19:00:10,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:10,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:10,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675400354] [2020-01-16 19:00:10,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:10,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:10,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302991920] [2020-01-16 19:00:10,868 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:10,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:10,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:10,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:10,868 INFO L87 Difference]: Start difference. First operand 217 states and 652 transitions. Second operand 8 states. [2020-01-16 19:00:10,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:10,929 INFO L93 Difference]: Finished difference Result 353 states and 916 transitions. [2020-01-16 19:00:10,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:10,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:10,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:10,930 INFO L225 Difference]: With dead ends: 353 [2020-01-16 19:00:10,930 INFO L226 Difference]: Without dead ends: 340 [2020-01-16 19:00:10,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:10,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-01-16 19:00:10,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 214. [2020-01-16 19:00:10,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 19:00:10,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 645 transitions. [2020-01-16 19:00:10,935 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 645 transitions. Word has length 19 [2020-01-16 19:00:10,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:10,935 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 645 transitions. [2020-01-16 19:00:10,935 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:10,935 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 645 transitions. [2020-01-16 19:00:10,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:10,936 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:10,936 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:10,936 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 19:00:10,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:10,936 INFO L82 PathProgramCache]: Analyzing trace with hash -467729652, now seen corresponding path program 201 times [2020-01-16 19:00:10,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:10,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780855313] [2020-01-16 19:00:10,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:11,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780855313] [2020-01-16 19:00:11,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:11,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:11,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942728086] [2020-01-16 19:00:11,173 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:11,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:11,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:11,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:11,174 INFO L87 Difference]: Start difference. First operand 214 states and 645 transitions. Second operand 8 states. [2020-01-16 19:00:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:11,241 INFO L93 Difference]: Finished difference Result 365 states and 945 transitions. [2020-01-16 19:00:11,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:11,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:11,242 INFO L225 Difference]: With dead ends: 365 [2020-01-16 19:00:11,243 INFO L226 Difference]: Without dead ends: 349 [2020-01-16 19:00:11,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 19:00:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-01-16 19:00:11,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 220. [2020-01-16 19:00:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-01-16 19:00:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 656 transitions. [2020-01-16 19:00:11,248 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 656 transitions. Word has length 19 [2020-01-16 19:00:11,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:11,248 INFO L478 AbstractCegarLoop]: Abstraction has 220 states and 656 transitions. [2020-01-16 19:00:11,248 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 656 transitions. [2020-01-16 19:00:11,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:11,249 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:11,249 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:11,249 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 19:00:11,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:11,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1443934402, now seen corresponding path program 202 times [2020-01-16 19:00:11,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:11,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407291912] [2020-01-16 19:00:11,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:11,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 19:00:11,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407291912] [2020-01-16 19:00:11,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:11,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:11,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925022568] [2020-01-16 19:00:11,450 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:11,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:11,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:11,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:11,451 INFO L87 Difference]: Start difference. First operand 220 states and 656 transitions. Second operand 8 states. [2020-01-16 19:00:11,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:11,547 INFO L93 Difference]: Finished difference Result 362 states and 934 transitions. [2020-01-16 19:00:11,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:11,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:11,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:11,549 INFO L225 Difference]: With dead ends: 362 [2020-01-16 19:00:11,549 INFO L226 Difference]: Without dead ends: 343 [2020-01-16 19:00:11,549 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:11,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-01-16 19:00:11,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 214. [2020-01-16 19:00:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 19:00:11,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-01-16 19:00:11,554 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-01-16 19:00:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:11,554 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-01-16 19:00:11,555 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-01-16 19:00:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:11,555 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:11,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 19:00:11,555 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 19:00:11,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:11,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1543632934, now seen corresponding path program 203 times [2020-01-16 19:00:11,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:11,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320207711] [2020-01-16 19:00:11,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:11,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320207711] [2020-01-16 19:00:11,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:11,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:11,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466799938] [2020-01-16 19:00:11,758 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:11,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:11,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:11,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:11,758 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-01-16 19:00:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:11,830 INFO L93 Difference]: Finished difference Result 349 states and 906 transitions. [2020-01-16 19:00:11,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:11,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:11,831 INFO L225 Difference]: With dead ends: 349 [2020-01-16 19:00:11,831 INFO L226 Difference]: Without dead ends: 339 [2020-01-16 19:00:11,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 19:00:11,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2020-01-16 19:00:11,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 216. [2020-01-16 19:00:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 19:00:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 645 transitions. [2020-01-16 19:00:11,837 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 645 transitions. Word has length 19 [2020-01-16 19:00:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:11,837 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 645 transitions. [2020-01-16 19:00:11,837 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 645 transitions. [2020-01-16 19:00:11,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:11,838 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:11,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 19:00:11,838 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 19:00:11,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:11,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1261929366, now seen corresponding path program 204 times [2020-01-16 19:00:11,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:11,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200791784] [2020-01-16 19:00:11,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:12,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:12,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200791784] [2020-01-16 19:00:12,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:12,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:12,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256991531] [2020-01-16 19:00:12,030 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:12,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:12,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:12,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:12,031 INFO L87 Difference]: Start difference. First operand 216 states and 645 transitions. Second operand 8 states. [2020-01-16 19:00:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:12,115 INFO L93 Difference]: Finished difference Result 352 states and 911 transitions. [2020-01-16 19:00:12,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:12,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:12,116 INFO L225 Difference]: With dead ends: 352 [2020-01-16 19:00:12,117 INFO L226 Difference]: Without dead ends: 334 [2020-01-16 19:00:12,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 19:00:12,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-01-16 19:00:12,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 211. [2020-01-16 19:00:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-01-16 19:00:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 635 transitions. [2020-01-16 19:00:12,122 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 635 transitions. Word has length 19 [2020-01-16 19:00:12,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:12,122 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 635 transitions. [2020-01-16 19:00:12,122 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:12,122 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 635 transitions. [2020-01-16 19:00:12,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:12,122 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:12,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 19:00:12,123 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 19:00:12,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:12,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1236225016, now seen corresponding path program 205 times [2020-01-16 19:00:12,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:12,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166691121] [2020-01-16 19:00:12,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:12,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166691121] [2020-01-16 19:00:12,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:12,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:12,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491204542] [2020-01-16 19:00:12,335 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:12,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:12,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:12,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:12,335 INFO L87 Difference]: Start difference. First operand 211 states and 635 transitions. Second operand 8 states. [2020-01-16 19:00:12,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:12,395 INFO L93 Difference]: Finished difference Result 366 states and 949 transitions. [2020-01-16 19:00:12,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:12,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:12,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:12,397 INFO L225 Difference]: With dead ends: 366 [2020-01-16 19:00:12,397 INFO L226 Difference]: Without dead ends: 350 [2020-01-16 19:00:12,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:12,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-01-16 19:00:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 221. [2020-01-16 19:00:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-01-16 19:00:12,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 663 transitions. [2020-01-16 19:00:12,403 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 663 transitions. Word has length 19 [2020-01-16 19:00:12,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:12,403 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 663 transitions. [2020-01-16 19:00:12,403 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:12,403 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 663 transitions. [2020-01-16 19:00:12,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:12,403 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:12,403 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:12,404 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 19:00:12,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:12,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1987287110, now seen corresponding path program 206 times [2020-01-16 19:00:12,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:12,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216931754] [2020-01-16 19:00:12,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:12,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216931754] [2020-01-16 19:00:12,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:12,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:12,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663658193] [2020-01-16 19:00:12,609 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:12,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:12,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:12,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:12,609 INFO L87 Difference]: Start difference. First operand 221 states and 663 transitions. Second operand 8 states. [2020-01-16 19:00:12,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:12,692 INFO L93 Difference]: Finished difference Result 362 states and 937 transitions. [2020-01-16 19:00:12,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:12,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:12,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:12,694 INFO L225 Difference]: With dead ends: 362 [2020-01-16 19:00:12,694 INFO L226 Difference]: Without dead ends: 345 [2020-01-16 19:00:12,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:12,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2020-01-16 19:00:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 216. [2020-01-16 19:00:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 19:00:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 649 transitions. [2020-01-16 19:00:12,699 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 649 transitions. Word has length 19 [2020-01-16 19:00:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:12,699 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 649 transitions. [2020-01-16 19:00:12,699 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 649 transitions. [2020-01-16 19:00:12,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:12,699 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:12,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 19:00:12,700 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 19:00:12,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:12,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1458304426, now seen corresponding path program 207 times [2020-01-16 19:00:12,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:12,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560168109] [2020-01-16 19:00:12,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:12,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560168109] [2020-01-16 19:00:12,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:12,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:12,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710401755] [2020-01-16 19:00:12,911 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:12,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:12,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:12,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:12,912 INFO L87 Difference]: Start difference. First operand 216 states and 649 transitions. Second operand 8 states. [2020-01-16 19:00:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:12,979 INFO L93 Difference]: Finished difference Result 368 states and 949 transitions. [2020-01-16 19:00:12,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:12,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:12,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:12,981 INFO L225 Difference]: With dead ends: 368 [2020-01-16 19:00:12,981 INFO L226 Difference]: Without dead ends: 352 [2020-01-16 19:00:12,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 19:00:12,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2020-01-16 19:00:12,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 222. [2020-01-16 19:00:12,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-01-16 19:00:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 660 transitions. [2020-01-16 19:00:12,987 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 660 transitions. Word has length 19 [2020-01-16 19:00:12,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:12,987 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 660 transitions. [2020-01-16 19:00:12,987 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 660 transitions. [2020-01-16 19:00:12,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:12,987 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:12,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 19:00:12,988 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 19:00:12,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:12,988 INFO L82 PathProgramCache]: Analyzing trace with hash 482099676, now seen corresponding path program 208 times [2020-01-16 19:00:12,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:12,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642506210] [2020-01-16 19:00:12,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:13,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 19:00:13,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642506210] [2020-01-16 19:00:13,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:13,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:13,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277511494] [2020-01-16 19:00:13,186 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:13,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:13,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:13,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:13,186 INFO L87 Difference]: Start difference. First operand 222 states and 660 transitions. Second operand 8 states. [2020-01-16 19:00:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:13,268 INFO L93 Difference]: Finished difference Result 365 states and 938 transitions. [2020-01-16 19:00:13,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:13,269 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:13,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:13,270 INFO L225 Difference]: With dead ends: 365 [2020-01-16 19:00:13,270 INFO L226 Difference]: Without dead ends: 346 [2020-01-16 19:00:13,270 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-01-16 19:00:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 216. [2020-01-16 19:00:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 19:00:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 644 transitions. [2020-01-16 19:00:13,275 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 644 transitions. Word has length 19 [2020-01-16 19:00:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:13,275 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 644 transitions. [2020-01-16 19:00:13,275 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 644 transitions. [2020-01-16 19:00:13,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:13,276 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:13,276 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:13,276 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 19:00:13,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:13,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2110104008, now seen corresponding path program 209 times [2020-01-16 19:00:13,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:13,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943644560] [2020-01-16 19:00:13,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:13,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943644560] [2020-01-16 19:00:13,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:13,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:13,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933843635] [2020-01-16 19:00:13,485 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:13,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:13,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:13,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:13,486 INFO L87 Difference]: Start difference. First operand 216 states and 644 transitions. Second operand 8 states. [2020-01-16 19:00:13,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:13,567 INFO L93 Difference]: Finished difference Result 358 states and 925 transitions. [2020-01-16 19:00:13,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:13,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:13,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:13,569 INFO L225 Difference]: With dead ends: 358 [2020-01-16 19:00:13,569 INFO L226 Difference]: Without dead ends: 346 [2020-01-16 19:00:13,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 19:00:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-01-16 19:00:13,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 220. [2020-01-16 19:00:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-01-16 19:00:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 652 transitions. [2020-01-16 19:00:13,574 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 652 transitions. Word has length 19 [2020-01-16 19:00:13,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:13,575 INFO L478 AbstractCegarLoop]: Abstraction has 220 states and 652 transitions. [2020-01-16 19:00:13,575 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:13,575 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 652 transitions. [2020-01-16 19:00:13,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:13,575 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:13,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 19:00:13,575 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 19:00:13,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:13,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1325988758, now seen corresponding path program 210 times [2020-01-16 19:00:13,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:13,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369073322] [2020-01-16 19:00:13,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:13,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 19:00:13,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369073322] [2020-01-16 19:00:13,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:13,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:13,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083971033] [2020-01-16 19:00:13,778 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:13,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:13,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:13,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:13,778 INFO L87 Difference]: Start difference. First operand 220 states and 652 transitions. Second operand 8 states. [2020-01-16 19:00:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:13,863 INFO L93 Difference]: Finished difference Result 359 states and 923 transitions. [2020-01-16 19:00:13,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:13,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:13,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:13,864 INFO L225 Difference]: With dead ends: 359 [2020-01-16 19:00:13,865 INFO L226 Difference]: Without dead ends: 337 [2020-01-16 19:00:13,865 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:13,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-01-16 19:00:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 211. [2020-01-16 19:00:13,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-01-16 19:00:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 632 transitions. [2020-01-16 19:00:13,870 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 632 transitions. Word has length 19 [2020-01-16 19:00:13,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:13,871 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 632 transitions. [2020-01-16 19:00:13,871 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 632 transitions. [2020-01-16 19:00:13,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:13,871 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:13,871 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:13,871 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 19:00:13,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:13,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1946024220, now seen corresponding path program 211 times [2020-01-16 19:00:13,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:13,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692365462] [2020-01-16 19:00:13,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:14,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 19:00:14,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692365462] [2020-01-16 19:00:14,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:14,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:14,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939217420] [2020-01-16 19:00:14,093 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:14,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:14,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:14,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:14,094 INFO L87 Difference]: Start difference. First operand 211 states and 632 transitions. Second operand 8 states. [2020-01-16 19:00:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:14,156 INFO L93 Difference]: Finished difference Result 335 states and 868 transitions. [2020-01-16 19:00:14,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:14,157 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:14,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:14,158 INFO L225 Difference]: With dead ends: 335 [2020-01-16 19:00:14,158 INFO L226 Difference]: Without dead ends: 325 [2020-01-16 19:00:14,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 19:00:14,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-01-16 19:00:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 215. [2020-01-16 19:00:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-01-16 19:00:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 642 transitions. [2020-01-16 19:00:14,163 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 642 transitions. Word has length 19 [2020-01-16 19:00:14,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:14,164 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 642 transitions. [2020-01-16 19:00:14,164 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:14,164 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 642 transitions. [2020-01-16 19:00:14,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:14,164 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:14,164 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:14,164 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 19:00:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:14,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1090717566, now seen corresponding path program 212 times [2020-01-16 19:00:14,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:14,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89044181] [2020-01-16 19:00:14,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:14,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:14,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89044181] [2020-01-16 19:00:14,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:14,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:14,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168236843] [2020-01-16 19:00:14,368 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:14,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:14,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:14,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:14,369 INFO L87 Difference]: Start difference. First operand 215 states and 642 transitions. Second operand 8 states. [2020-01-16 19:00:14,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:14,463 INFO L93 Difference]: Finished difference Result 337 states and 871 transitions. [2020-01-16 19:00:14,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:14,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:14,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:14,465 INFO L225 Difference]: With dead ends: 337 [2020-01-16 19:00:14,465 INFO L226 Difference]: Without dead ends: 323 [2020-01-16 19:00:14,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:14,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-01-16 19:00:14,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 213. [2020-01-16 19:00:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-01-16 19:00:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 637 transitions. [2020-01-16 19:00:14,471 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 637 transitions. Word has length 19 [2020-01-16 19:00:14,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:14,471 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 637 transitions. [2020-01-16 19:00:14,471 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 637 transitions. [2020-01-16 19:00:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:14,472 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:14,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 19:00:14,472 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 19:00:14,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:14,472 INFO L82 PathProgramCache]: Analyzing trace with hash -738002118, now seen corresponding path program 213 times [2020-01-16 19:00:14,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:14,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97328415] [2020-01-16 19:00:14,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:14,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97328415] [2020-01-16 19:00:14,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:14,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:14,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609600074] [2020-01-16 19:00:14,675 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:14,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:14,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:14,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:14,676 INFO L87 Difference]: Start difference. First operand 213 states and 637 transitions. Second operand 8 states. [2020-01-16 19:00:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:14,742 INFO L93 Difference]: Finished difference Result 336 states and 868 transitions. [2020-01-16 19:00:14,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:14,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:14,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:14,744 INFO L225 Difference]: With dead ends: 336 [2020-01-16 19:00:14,744 INFO L226 Difference]: Without dead ends: 326 [2020-01-16 19:00:14,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:14,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-01-16 19:00:14,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 215. [2020-01-16 19:00:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-01-16 19:00:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 640 transitions. [2020-01-16 19:00:14,750 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 640 transitions. Word has length 19 [2020-01-16 19:00:14,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:14,750 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 640 transitions. [2020-01-16 19:00:14,750 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:14,750 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 640 transitions. [2020-01-16 19:00:14,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:14,751 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:14,751 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:14,751 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 19:00:14,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:14,752 INFO L82 PathProgramCache]: Analyzing trace with hash 751402878, now seen corresponding path program 214 times [2020-01-16 19:00:14,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:14,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573797190] [2020-01-16 19:00:14,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:14,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 19:00:14,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573797190] [2020-01-16 19:00:14,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:14,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:14,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169938948] [2020-01-16 19:00:14,973 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:14,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:14,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:14,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:14,973 INFO L87 Difference]: Start difference. First operand 215 states and 640 transitions. Second operand 8 states. [2020-01-16 19:00:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:15,066 INFO L93 Difference]: Finished difference Result 339 states and 873 transitions. [2020-01-16 19:00:15,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:15,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:15,067 INFO L225 Difference]: With dead ends: 339 [2020-01-16 19:00:15,067 INFO L226 Difference]: Without dead ends: 324 [2020-01-16 19:00:15,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 19:00:15,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-01-16 19:00:15,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 213. [2020-01-16 19:00:15,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-01-16 19:00:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 635 transitions. [2020-01-16 19:00:15,073 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 635 transitions. Word has length 19 [2020-01-16 19:00:15,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:15,073 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 635 transitions. [2020-01-16 19:00:15,073 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:15,073 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 635 transitions. [2020-01-16 19:00:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:15,074 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:15,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 19:00:15,074 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 19:00:15,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:15,074 INFO L82 PathProgramCache]: Analyzing trace with hash 17632186, now seen corresponding path program 215 times [2020-01-16 19:00:15,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:15,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771144221] [2020-01-16 19:00:15,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:15,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 19:00:15,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771144221] [2020-01-16 19:00:15,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:15,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:15,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826113184] [2020-01-16 19:00:15,276 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:15,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:15,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:15,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:15,276 INFO L87 Difference]: Start difference. First operand 213 states and 635 transitions. Second operand 8 states. [2020-01-16 19:00:15,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:15,367 INFO L93 Difference]: Finished difference Result 338 states and 871 transitions. [2020-01-16 19:00:15,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:15,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:15,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:15,369 INFO L225 Difference]: With dead ends: 338 [2020-01-16 19:00:15,369 INFO L226 Difference]: Without dead ends: 326 [2020-01-16 19:00:15,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 19:00:15,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-01-16 19:00:15,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 217. [2020-01-16 19:00:15,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-01-16 19:00:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 643 transitions. [2020-01-16 19:00:15,374 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 643 transitions. Word has length 19 [2020-01-16 19:00:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:15,374 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 643 transitions. [2020-01-16 19:00:15,374 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 643 transitions. [2020-01-16 19:00:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:15,375 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:15,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 19:00:15,375 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 19:00:15,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:15,376 INFO L82 PathProgramCache]: Analyzing trace with hash -738002118, now seen corresponding path program 216 times [2020-01-16 19:00:15,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:15,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906665142] [2020-01-16 19:00:15,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:15,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 19:00:15,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906665142] [2020-01-16 19:00:15,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:15,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:15,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759909550] [2020-01-16 19:00:15,584 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:15,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:15,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:15,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:15,584 INFO L87 Difference]: Start difference. First operand 217 states and 643 transitions. Second operand 8 states. [2020-01-16 19:00:15,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:15,674 INFO L93 Difference]: Finished difference Result 339 states and 869 transitions. [2020-01-16 19:00:15,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:15,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:15,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:15,676 INFO L225 Difference]: With dead ends: 339 [2020-01-16 19:00:15,676 INFO L226 Difference]: Without dead ends: 317 [2020-01-16 19:00:15,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 19:00:15,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-01-16 19:00:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 208. [2020-01-16 19:00:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-01-16 19:00:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 625 transitions. [2020-01-16 19:00:15,681 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 625 transitions. Word has length 19 [2020-01-16 19:00:15,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:15,682 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 625 transitions. [2020-01-16 19:00:15,682 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:15,682 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 625 transitions. [2020-01-16 19:00:15,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:15,682 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:15,682 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:15,682 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 19:00:15,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:15,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1434799680, now seen corresponding path program 217 times [2020-01-16 19:00:15,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:15,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558475637] [2020-01-16 19:00:15,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:15,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558475637] [2020-01-16 19:00:15,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:15,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:15,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807196131] [2020-01-16 19:00:15,867 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:15,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:15,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:15,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:15,867 INFO L87 Difference]: Start difference. First operand 208 states and 625 transitions. Second operand 8 states. [2020-01-16 19:00:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:15,949 INFO L93 Difference]: Finished difference Result 338 states and 886 transitions. [2020-01-16 19:00:15,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:15,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:15,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:15,951 INFO L225 Difference]: With dead ends: 338 [2020-01-16 19:00:15,951 INFO L226 Difference]: Without dead ends: 324 [2020-01-16 19:00:15,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:15,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-01-16 19:00:15,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 214. [2020-01-16 19:00:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 19:00:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 644 transitions. [2020-01-16 19:00:15,956 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 644 transitions. Word has length 19 [2020-01-16 19:00:15,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:15,956 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 644 transitions. [2020-01-16 19:00:15,956 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 644 transitions. [2020-01-16 19:00:15,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:15,957 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:15,957 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:15,957 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 19:00:15,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:15,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1740037786, now seen corresponding path program 218 times [2020-01-16 19:00:15,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:15,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839154242] [2020-01-16 19:00:15,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:16,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 19:00:16,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839154242] [2020-01-16 19:00:16,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:16,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:16,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059442187] [2020-01-16 19:00:16,141 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:16,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:16,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:16,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:16,142 INFO L87 Difference]: Start difference. First operand 214 states and 644 transitions. Second operand 8 states. [2020-01-16 19:00:16,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:16,201 INFO L93 Difference]: Finished difference Result 334 states and 875 transitions. [2020-01-16 19:00:16,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:16,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:16,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:16,202 INFO L225 Difference]: With dead ends: 334 [2020-01-16 19:00:16,202 INFO L226 Difference]: Without dead ends: 322 [2020-01-16 19:00:16,203 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 19:00:16,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-01-16 19:00:16,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 212. [2020-01-16 19:00:16,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 19:00:16,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 639 transitions. [2020-01-16 19:00:16,207 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 639 transitions. Word has length 19 [2020-01-16 19:00:16,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:16,207 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 639 transitions. [2020-01-16 19:00:16,207 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 639 transitions. [2020-01-16 19:00:16,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:16,208 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:16,208 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:16,208 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 19:00:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:16,208 INFO L82 PathProgramCache]: Analyzing trace with hash 690097182, now seen corresponding path program 219 times [2020-01-16 19:00:16,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:16,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370930063] [2020-01-16 19:00:16,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:16,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 19:00:16,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370930063] [2020-01-16 19:00:16,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:16,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:16,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414101201] [2020-01-16 19:00:16,389 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:16,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:16,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:16,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:16,390 INFO L87 Difference]: Start difference. First operand 212 states and 639 transitions. Second operand 8 states. [2020-01-16 19:00:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:16,470 INFO L93 Difference]: Finished difference Result 342 states and 896 transitions. [2020-01-16 19:00:16,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:16,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:16,472 INFO L225 Difference]: With dead ends: 342 [2020-01-16 19:00:16,472 INFO L226 Difference]: Without dead ends: 328 [2020-01-16 19:00:16,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:16,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-01-16 19:00:16,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 216. [2020-01-16 19:00:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 19:00:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 647 transitions. [2020-01-16 19:00:16,477 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 647 transitions. Word has length 19 [2020-01-16 19:00:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:16,477 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 647 transitions. [2020-01-16 19:00:16,477 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 647 transitions. [2020-01-16 19:00:16,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:16,477 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:16,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:16,477 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 19:00:16,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:16,478 INFO L82 PathProgramCache]: Analyzing trace with hash -55199962, now seen corresponding path program 220 times [2020-01-16 19:00:16,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:16,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721165541] [2020-01-16 19:00:16,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:16,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721165541] [2020-01-16 19:00:16,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:16,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:16,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695666145] [2020-01-16 19:00:16,662 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:16,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:16,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:16,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:16,663 INFO L87 Difference]: Start difference. First operand 216 states and 647 transitions. Second operand 8 states. [2020-01-16 19:00:16,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:16,744 INFO L93 Difference]: Finished difference Result 340 states and 888 transitions. [2020-01-16 19:00:16,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:16,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:16,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:16,746 INFO L225 Difference]: With dead ends: 340 [2020-01-16 19:00:16,746 INFO L226 Difference]: Without dead ends: 324 [2020-01-16 19:00:16,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:16,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-01-16 19:00:16,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 212. [2020-01-16 19:00:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 19:00:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 637 transitions. [2020-01-16 19:00:16,752 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 637 transitions. Word has length 19 [2020-01-16 19:00:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:16,752 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 637 transitions. [2020-01-16 19:00:16,752 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 637 transitions. [2020-01-16 19:00:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:16,753 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:16,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 19:00:16,753 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 19:00:16,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:16,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2019699708, now seen corresponding path program 221 times [2020-01-16 19:00:16,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:16,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134793494] [2020-01-16 19:00:16,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:16,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134793494] [2020-01-16 19:00:16,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:16,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:16,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904093971] [2020-01-16 19:00:16,947 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:16,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:16,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:16,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:16,947 INFO L87 Difference]: Start difference. First operand 212 states and 637 transitions. Second operand 8 states. [2020-01-16 19:00:17,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:17,012 INFO L93 Difference]: Finished difference Result 332 states and 869 transitions. [2020-01-16 19:00:17,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:17,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:17,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:17,014 INFO L225 Difference]: With dead ends: 332 [2020-01-16 19:00:17,014 INFO L226 Difference]: Without dead ends: 322 [2020-01-16 19:00:17,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:17,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-01-16 19:00:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 214. [2020-01-16 19:00:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 19:00:17,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 640 transitions. [2020-01-16 19:00:17,019 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 640 transitions. Word has length 19 [2020-01-16 19:00:17,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:17,019 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 640 transitions. [2020-01-16 19:00:17,020 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:17,020 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 640 transitions. [2020-01-16 19:00:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:17,020 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:17,020 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:17,020 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 19:00:17,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:17,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1164393054, now seen corresponding path program 222 times [2020-01-16 19:00:17,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:17,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570068828] [2020-01-16 19:00:17,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:17,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570068828] [2020-01-16 19:00:17,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:17,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:17,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654622650] [2020-01-16 19:00:17,207 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:17,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:17,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:17,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:17,208 INFO L87 Difference]: Start difference. First operand 214 states and 640 transitions. Second operand 8 states. [2020-01-16 19:00:17,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:17,289 INFO L93 Difference]: Finished difference Result 334 states and 872 transitions. [2020-01-16 19:00:17,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:17,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:17,290 INFO L225 Difference]: With dead ends: 334 [2020-01-16 19:00:17,290 INFO L226 Difference]: Without dead ends: 318 [2020-01-16 19:00:17,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-01-16 19:00:17,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 210. [2020-01-16 19:00:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-01-16 19:00:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 632 transitions. [2020-01-16 19:00:17,295 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 632 transitions. Word has length 19 [2020-01-16 19:00:17,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:17,295 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 632 transitions. [2020-01-16 19:00:17,295 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:17,295 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 632 transitions. [2020-01-16 19:00:17,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:17,296 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:17,296 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:17,296 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 19:00:17,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:17,296 INFO L82 PathProgramCache]: Analyzing trace with hash -165638174, now seen corresponding path program 223 times [2020-01-16 19:00:17,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:17,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996654300] [2020-01-16 19:00:17,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:17,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 19:00:17,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996654300] [2020-01-16 19:00:17,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:17,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:17,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360516869] [2020-01-16 19:00:17,484 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:17,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:17,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:17,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:17,484 INFO L87 Difference]: Start difference. First operand 210 states and 632 transitions. Second operand 8 states. [2020-01-16 19:00:17,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:17,564 INFO L93 Difference]: Finished difference Result 340 states and 889 transitions. [2020-01-16 19:00:17,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:17,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:17,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:17,565 INFO L225 Difference]: With dead ends: 340 [2020-01-16 19:00:17,565 INFO L226 Difference]: Without dead ends: 326 [2020-01-16 19:00:17,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 19:00:17,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-01-16 19:00:17,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 214. [2020-01-16 19:00:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 19:00:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-01-16 19:00:17,570 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-01-16 19:00:17,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:17,570 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-01-16 19:00:17,570 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:17,570 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-01-16 19:00:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:17,571 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:17,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 19:00:17,571 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 19:00:17,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:17,571 INFO L82 PathProgramCache]: Analyzing trace with hash 954491656, now seen corresponding path program 224 times [2020-01-16 19:00:17,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:17,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701716517] [2020-01-16 19:00:17,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:17,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 19:00:17,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701716517] [2020-01-16 19:00:17,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:17,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:17,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195577920] [2020-01-16 19:00:17,777 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:17,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:17,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:17,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:17,778 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-01-16 19:00:17,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:17,846 INFO L93 Difference]: Finished difference Result 336 states and 878 transitions. [2020-01-16 19:00:17,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:17,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:17,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:17,847 INFO L225 Difference]: With dead ends: 336 [2020-01-16 19:00:17,847 INFO L226 Difference]: Without dead ends: 324 [2020-01-16 19:00:17,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-01-16 19:00:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 212. [2020-01-16 19:00:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 19:00:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 637 transitions. [2020-01-16 19:00:17,852 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 637 transitions. Word has length 19 [2020-01-16 19:00:17,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:17,853 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 637 transitions. [2020-01-16 19:00:17,853 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 637 transitions. [2020-01-16 19:00:17,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:17,853 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:17,853 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:17,853 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 19:00:17,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:17,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1238723554, now seen corresponding path program 225 times [2020-01-16 19:00:17,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:17,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583811398] [2020-01-16 19:00:17,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:18,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 19:00:18,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583811398] [2020-01-16 19:00:18,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:18,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:18,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591569666] [2020-01-16 19:00:18,051 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:18,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:18,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:18,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:18,052 INFO L87 Difference]: Start difference. First operand 212 states and 637 transitions. Second operand 8 states. [2020-01-16 19:00:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:18,139 INFO L93 Difference]: Finished difference Result 346 states and 904 transitions. [2020-01-16 19:00:18,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:18,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:18,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:18,141 INFO L225 Difference]: With dead ends: 346 [2020-01-16 19:00:18,141 INFO L226 Difference]: Without dead ends: 332 [2020-01-16 19:00:18,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:18,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-01-16 19:00:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 217. [2020-01-16 19:00:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-01-16 19:00:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 647 transitions. [2020-01-16 19:00:18,147 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 647 transitions. Word has length 19 [2020-01-16 19:00:18,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:18,147 INFO L478 AbstractCegarLoop]: Abstraction has 217 states and 647 transitions. [2020-01-16 19:00:18,147 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 647 transitions. [2020-01-16 19:00:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:18,148 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:18,148 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:18,148 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 19:00:18,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:18,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1880780472, now seen corresponding path program 226 times [2020-01-16 19:00:18,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:18,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653515756] [2020-01-16 19:00:18,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00: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 19:00:18,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653515756] [2020-01-16 19:00:18,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:18,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:18,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409575728] [2020-01-16 19:00:18,342 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:18,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:18,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:18,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:18,342 INFO L87 Difference]: Start difference. First operand 217 states and 647 transitions. Second operand 8 states. [2020-01-16 19:00:18,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:18,432 INFO L93 Difference]: Finished difference Result 345 states and 897 transitions. [2020-01-16 19:00:18,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:18,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:18,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:18,433 INFO L225 Difference]: With dead ends: 345 [2020-01-16 19:00:18,433 INFO L226 Difference]: Without dead ends: 327 [2020-01-16 19:00:18,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 19:00:18,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-01-16 19:00:18,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 212. [2020-01-16 19:00:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 19:00:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 635 transitions. [2020-01-16 19:00:18,439 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 635 transitions. Word has length 19 [2020-01-16 19:00:18,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:18,439 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 635 transitions. [2020-01-16 19:00:18,439 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:18,439 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 635 transitions. [2020-01-16 19:00:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:18,439 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:18,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 19:00:18,439 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 19:00:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:18,440 INFO L82 PathProgramCache]: Analyzing trace with hash 2030202812, now seen corresponding path program 227 times [2020-01-16 19:00:18,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:18,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044668945] [2020-01-16 19:00:18,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:18,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:18,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044668945] [2020-01-16 19:00:18,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:18,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:18,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765052255] [2020-01-16 19:00:18,640 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:18,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:18,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:18,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:18,640 INFO L87 Difference]: Start difference. First operand 212 states and 635 transitions. Second operand 8 states. [2020-01-16 19:00:18,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:18,700 INFO L93 Difference]: Finished difference Result 335 states and 874 transitions. [2020-01-16 19:00:18,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:18,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:18,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:18,701 INFO L225 Difference]: With dead ends: 335 [2020-01-16 19:00:18,701 INFO L226 Difference]: Without dead ends: 325 [2020-01-16 19:00:18,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 19:00:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-01-16 19:00:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 214. [2020-01-16 19:00:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 19:00:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 638 transitions. [2020-01-16 19:00:18,706 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 638 transitions. Word has length 19 [2020-01-16 19:00:18,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:18,706 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 638 transitions. [2020-01-16 19:00:18,706 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:18,706 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 638 transitions. [2020-01-16 19:00:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:18,707 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:18,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 19:00:18,707 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 19:00:18,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:18,707 INFO L82 PathProgramCache]: Analyzing trace with hash -775359488, now seen corresponding path program 228 times [2020-01-16 19:00:18,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:18,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217540802] [2020-01-16 19:00:18,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:18,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217540802] [2020-01-16 19:00:18,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:18,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:18,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179309098] [2020-01-16 19:00:18,899 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:18,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:18,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:18,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:18,900 INFO L87 Difference]: Start difference. First operand 214 states and 638 transitions. Second operand 8 states. [2020-01-16 19:00:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:18,989 INFO L93 Difference]: Finished difference Result 338 states and 879 transitions. [2020-01-16 19:00:18,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:18,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:18,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:18,990 INFO L225 Difference]: With dead ends: 338 [2020-01-16 19:00:18,991 INFO L226 Difference]: Without dead ends: 321 [2020-01-16 19:00:18,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-01-16 19:00:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 210. [2020-01-16 19:00:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-01-16 19:00:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 630 transitions. [2020-01-16 19:00:18,997 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 630 transitions. Word has length 19 [2020-01-16 19:00:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:18,997 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 630 transitions. [2020-01-16 19:00:18,997 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 630 transitions. [2020-01-16 19:00:18,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:18,998 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:18,998 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:18,998 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 19:00:18,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:18,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1784188770, now seen corresponding path program 229 times [2020-01-16 19:00:18,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:18,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558655770] [2020-01-16 19:00:18,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:19,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558655770] [2020-01-16 19:00:19,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:19,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:19,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732640574] [2020-01-16 19:00:19,203 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:19,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:19,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:19,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:19,204 INFO L87 Difference]: Start difference. First operand 210 states and 630 transitions. Second operand 8 states. [2020-01-16 19:00:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:19,285 INFO L93 Difference]: Finished difference Result 348 states and 911 transitions. [2020-01-16 19:00:19,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:19,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:19,286 INFO L225 Difference]: With dead ends: 348 [2020-01-16 19:00:19,287 INFO L226 Difference]: Without dead ends: 334 [2020-01-16 19:00:19,287 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:19,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-01-16 19:00:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 218. [2020-01-16 19:00:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 19:00:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 654 transitions. [2020-01-16 19:00:19,293 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 654 transitions. Word has length 19 [2020-01-16 19:00:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:19,293 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 654 transitions. [2020-01-16 19:00:19,293 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 654 transitions. [2020-01-16 19:00:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:19,293 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:19,294 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:19,294 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 19:00:19,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:19,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1038891626, now seen corresponding path program 230 times [2020-01-16 19:00:19,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:19,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425831511] [2020-01-16 19:00:19,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:19,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425831511] [2020-01-16 19:00:19,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:19,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:19,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358575925] [2020-01-16 19:00:19,492 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:19,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:19,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:19,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:19,493 INFO L87 Difference]: Start difference. First operand 218 states and 654 transitions. Second operand 8 states. [2020-01-16 19:00:19,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:19,571 INFO L93 Difference]: Finished difference Result 346 states and 903 transitions. [2020-01-16 19:00:19,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:19,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:19,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:19,572 INFO L225 Difference]: With dead ends: 346 [2020-01-16 19:00:19,573 INFO L226 Difference]: Without dead ends: 330 [2020-01-16 19:00:19,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:19,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-01-16 19:00:19,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 214. [2020-01-16 19:00:19,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 19:00:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 642 transitions. [2020-01-16 19:00:19,577 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 642 transitions. Word has length 19 [2020-01-16 19:00:19,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:19,578 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 642 transitions. [2020-01-16 19:00:19,578 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 642 transitions. [2020-01-16 19:00:19,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:19,578 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00: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 19:00:19,578 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 19:00:19,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:19,579 INFO L82 PathProgramCache]: Analyzing trace with hash -165638174, now seen corresponding path program 231 times [2020-01-16 19:00:19,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:19,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804183151] [2020-01-16 19:00:19,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:19,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804183151] [2020-01-16 19:00:19,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:19,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:19,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345912871] [2020-01-16 19:00:19,779 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:19,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:19,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:19,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:19,780 INFO L87 Difference]: Start difference. First operand 214 states and 642 transitions. Second operand 8 states. [2020-01-16 19:00:19,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:19,860 INFO L93 Difference]: Finished difference Result 350 states and 912 transitions. [2020-01-16 19:00:19,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:19,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:19,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:19,861 INFO L225 Difference]: With dead ends: 350 [2020-01-16 19:00:19,861 INFO L226 Difference]: Without dead ends: 336 [2020-01-16 19:00:19,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:19,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-01-16 19:00:19,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 219. [2020-01-16 19:00:19,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-01-16 19:00:19,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 652 transitions. [2020-01-16 19:00:19,866 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 652 transitions. Word has length 19 [2020-01-16 19:00:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:19,866 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 652 transitions. [2020-01-16 19:00:19,866 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 652 transitions. [2020-01-16 19:00:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:19,867 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:19,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 19:00:19,867 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 19:00:19,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:19,867 INFO L82 PathProgramCache]: Analyzing trace with hash 803245866, now seen corresponding path program 232 times [2020-01-16 19:00:19,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:19,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680580437] [2020-01-16 19:00:19,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:20,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680580437] [2020-01-16 19:00:20,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:20,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:20,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743021196] [2020-01-16 19:00:20,076 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:20,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:20,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:20,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:20,076 INFO L87 Difference]: Start difference. First operand 219 states and 652 transitions. Second operand 8 states. [2020-01-16 19:00:20,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:20,169 INFO L93 Difference]: Finished difference Result 349 states and 905 transitions. [2020-01-16 19:00:20,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:20,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:20,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:20,170 INFO L225 Difference]: With dead ends: 349 [2020-01-16 19:00:20,170 INFO L226 Difference]: Without dead ends: 331 [2020-01-16 19:00:20,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 19:00:20,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-01-16 19:00:20,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 214. [2020-01-16 19:00:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 19:00:20,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 638 transitions. [2020-01-16 19:00:20,176 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 638 transitions. Word has length 19 [2020-01-16 19:00:20,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:20,176 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 638 transitions. [2020-01-16 19:00:20,176 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:20,176 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 638 transitions. [2020-01-16 19:00:20,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:20,176 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:20,176 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:20,177 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 19:00:20,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:20,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1685003648, now seen corresponding path program 233 times [2020-01-16 19:00:20,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:20,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693750628] [2020-01-16 19:00:20,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:20,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 19:00:20,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693750628] [2020-01-16 19:00:20,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:20,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:20,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317945976] [2020-01-16 19:00:20,381 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:20,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:20,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:20,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:20,382 INFO L87 Difference]: Start difference. First operand 214 states and 638 transitions. Second operand 8 states. [2020-01-16 19:00:20,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:20,462 INFO L93 Difference]: Finished difference Result 345 states and 897 transitions. [2020-01-16 19:00:20,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:20,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:20,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:20,463 INFO L225 Difference]: With dead ends: 345 [2020-01-16 19:00:20,463 INFO L226 Difference]: Without dead ends: 333 [2020-01-16 19:00:20,464 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:20,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-01-16 19:00:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 218. [2020-01-16 19:00:20,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 19:00:20,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 646 transitions. [2020-01-16 19:00:20,467 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 646 transitions. Word has length 19 [2020-01-16 19:00:20,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:20,467 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 646 transitions. [2020-01-16 19:00:20,467 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:20,468 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 646 transitions. [2020-01-16 19:00:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:20,468 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:20,468 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:20,468 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 19:00:20,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:20,468 INFO L82 PathProgramCache]: Analyzing trace with hash -826129118, now seen corresponding path program 234 times [2020-01-16 19:00:20,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:20,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867397782] [2020-01-16 19:00:20,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:20,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 19:00:20,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867397782] [2020-01-16 19:00:20,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:20,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:20,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086585998] [2020-01-16 19:00:20,669 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:20,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:20,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:20,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:20,669 INFO L87 Difference]: Start difference. First operand 218 states and 646 transitions. Second operand 8 states. [2020-01-16 19:00:20,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:20,755 INFO L93 Difference]: Finished difference Result 346 states and 895 transitions. [2020-01-16 19:00:20,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:20,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:20,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:20,756 INFO L225 Difference]: With dead ends: 346 [2020-01-16 19:00:20,756 INFO L226 Difference]: Without dead ends: 325 [2020-01-16 19:00:20,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 19:00:20,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-01-16 19:00:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2020-01-16 19:00:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-01-16 19:00:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 628 transitions. [2020-01-16 19:00:20,762 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 628 transitions. Word has length 19 [2020-01-16 19:00:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:20,762 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 628 transitions. [2020-01-16 19:00:20,762 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 628 transitions. [2020-01-16 19:00:20,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:20,762 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:20,762 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:20,763 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 19:00:20,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:20,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1007007176, now seen corresponding path program 235 times [2020-01-16 19:00:20,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:20,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020768104] [2020-01-16 19:00:20,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:20,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020768104] [2020-01-16 19:00:20,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:20,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:20,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601932902] [2020-01-16 19:00:20,969 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:20,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:20,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:20,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:20,970 INFO L87 Difference]: Start difference. First operand 210 states and 628 transitions. Second operand 8 states. [2020-01-16 19:00:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:21,029 INFO L93 Difference]: Finished difference Result 327 states and 849 transitions. [2020-01-16 19:00:21,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:21,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:21,030 INFO L225 Difference]: With dead ends: 327 [2020-01-16 19:00:21,030 INFO L226 Difference]: Without dead ends: 317 [2020-01-16 19:00:21,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 19:00:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-01-16 19:00:21,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 214. [2020-01-16 19:00:21,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 19:00:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 638 transitions. [2020-01-16 19:00:21,036 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 638 transitions. Word has length 19 [2020-01-16 19:00:21,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:21,036 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 638 transitions. [2020-01-16 19:00:21,036 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:21,036 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 638 transitions. [2020-01-16 19:00:21,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:21,036 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:21,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 19:00:21,037 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 19:00:21,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:21,037 INFO L82 PathProgramCache]: Analyzing trace with hash 151700522, now seen corresponding path program 236 times [2020-01-16 19:00:21,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:21,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211413866] [2020-01-16 19:00:21,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:21,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 19:00:21,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211413866] [2020-01-16 19:00:21,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:21,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:21,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082813468] [2020-01-16 19:00:21,284 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:21,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:21,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:21,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:21,285 INFO L87 Difference]: Start difference. First operand 214 states and 638 transitions. Second operand 8 states. [2020-01-16 19:00:21,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:21,391 INFO L93 Difference]: Finished difference Result 329 states and 852 transitions. [2020-01-16 19:00:21,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:21,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:21,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:21,393 INFO L225 Difference]: With dead ends: 329 [2020-01-16 19:00:21,393 INFO L226 Difference]: Without dead ends: 315 [2020-01-16 19:00:21,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 19:00:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-01-16 19:00:21,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 212. [2020-01-16 19:00:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 19:00:21,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 633 transitions. [2020-01-16 19:00:21,402 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 633 transitions. Word has length 19 [2020-01-16 19:00:21,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:21,402 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 633 transitions. [2020-01-16 19:00:21,402 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:21,402 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 633 transitions. [2020-01-16 19:00:21,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:21,403 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:21,403 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:21,404 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 19:00:21,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:21,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1677019162, now seen corresponding path program 237 times [2020-01-16 19:00:21,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:21,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468801482] [2020-01-16 19:00:21,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:21,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468801482] [2020-01-16 19:00:21,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:21,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:21,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918858175] [2020-01-16 19:00:21,634 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:21,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:21,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:21,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:21,634 INFO L87 Difference]: Start difference. First operand 212 states and 633 transitions. Second operand 8 states. [2020-01-16 19:00:21,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:21,688 INFO L93 Difference]: Finished difference Result 328 states and 849 transitions. [2020-01-16 19:00:21,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:21,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:21,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:21,690 INFO L225 Difference]: With dead ends: 328 [2020-01-16 19:00:21,690 INFO L226 Difference]: Without dead ends: 318 [2020-01-16 19:00:21,690 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:21,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-01-16 19:00:21,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 214. [2020-01-16 19:00:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 19:00:21,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 636 transitions. [2020-01-16 19:00:21,695 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 636 transitions. Word has length 19 [2020-01-16 19:00:21,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:21,695 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 636 transitions. [2020-01-16 19:00:21,695 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 636 transitions. [2020-01-16 19:00:21,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:21,696 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:21,696 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:21,696 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 19:00:21,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:21,697 INFO L82 PathProgramCache]: Analyzing trace with hash -187614166, now seen corresponding path program 238 times [2020-01-16 19:00:21,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:21,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051813760] [2020-01-16 19:00:21,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:21,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 19:00:21,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051813760] [2020-01-16 19:00:21,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:21,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:21,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564644130] [2020-01-16 19:00:21,902 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:21,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:21,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:21,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:21,903 INFO L87 Difference]: Start difference. First operand 214 states and 636 transitions. Second operand 8 states. [2020-01-16 19:00:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:21,989 INFO L93 Difference]: Finished difference Result 331 states and 854 transitions. [2020-01-16 19:00:21,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:21,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:21,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:21,990 INFO L225 Difference]: With dead ends: 331 [2020-01-16 19:00:21,991 INFO L226 Difference]: Without dead ends: 316 [2020-01-16 19:00:21,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:21,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-01-16 19:00:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 212. [2020-01-16 19:00:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-01-16 19:00:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 631 transitions. [2020-01-16 19:00:21,996 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 631 transitions. Word has length 19 [2020-01-16 19:00:21,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:21,996 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 631 transitions. [2020-01-16 19:00:21,997 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 631 transitions. [2020-01-16 19:00:21,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:21,997 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:21,997 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:21,997 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 19:00:21,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:21,998 INFO L82 PathProgramCache]: Analyzing trace with hash -921384858, now seen corresponding path program 239 times [2020-01-16 19:00:21,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:21,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602389903] [2020-01-16 19:00:21,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:22,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 19:00:22,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602389903] [2020-01-16 19:00:22,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:22,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:22,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882114446] [2020-01-16 19:00:22,205 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:22,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:22,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:22,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:22,205 INFO L87 Difference]: Start difference. First operand 212 states and 631 transitions. Second operand 8 states. [2020-01-16 19:00:22,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:22,281 INFO L93 Difference]: Finished difference Result 330 states and 852 transitions. [2020-01-16 19:00:22,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:22,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:22,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:22,283 INFO L225 Difference]: With dead ends: 330 [2020-01-16 19:00:22,283 INFO L226 Difference]: Without dead ends: 318 [2020-01-16 19:00:22,283 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:22,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-01-16 19:00:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 216. [2020-01-16 19:00:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 19:00:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 639 transitions. [2020-01-16 19:00:22,287 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 639 transitions. Word has length 19 [2020-01-16 19:00:22,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:22,288 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 639 transitions. [2020-01-16 19:00:22,288 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 639 transitions. [2020-01-16 19:00:22,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:22,288 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:22,288 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:22,288 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 19:00:22,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:22,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1677019162, now seen corresponding path program 240 times [2020-01-16 19:00:22,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:22,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071566151] [2020-01-16 19:00:22,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:22,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071566151] [2020-01-16 19:00:22,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:22,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:22,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578359994] [2020-01-16 19:00:22,492 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:22,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:22,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:22,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:22,492 INFO L87 Difference]: Start difference. First operand 216 states and 639 transitions. Second operand 8 states. [2020-01-16 19:00:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:22,577 INFO L93 Difference]: Finished difference Result 331 states and 850 transitions. [2020-01-16 19:00:22,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:22,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:22,578 INFO L225 Difference]: With dead ends: 331 [2020-01-16 19:00:22,578 INFO L226 Difference]: Without dead ends: 304 [2020-01-16 19:00:22,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-01-16 19:00:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 202. [2020-01-16 19:00:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-01-16 19:00:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 613 transitions. [2020-01-16 19:00:22,583 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 613 transitions. Word has length 19 [2020-01-16 19:00:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:22,583 INFO L478 AbstractCegarLoop]: Abstraction has 202 states and 613 transitions. [2020-01-16 19:00:22,583 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:22,583 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 613 transitions. [2020-01-16 19:00:22,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:22,584 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:22,584 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:22,584 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 19:00:22,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:22,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1614896374, now seen corresponding path program 241 times [2020-01-16 19:00:22,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:22,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813679860] [2020-01-16 19:00:22,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:22,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 19:00:22,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813679860] [2020-01-16 19:00:22,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:22,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:22,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522139893] [2020-01-16 19:00:22,799 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:22,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:22,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:22,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:22,799 INFO L87 Difference]: Start difference. First operand 202 states and 613 transitions. Second operand 8 states. [2020-01-16 19:00:22,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:22,861 INFO L93 Difference]: Finished difference Result 378 states and 975 transitions. [2020-01-16 19:00:22,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:22,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:22,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:22,863 INFO L225 Difference]: With dead ends: 378 [2020-01-16 19:00:22,863 INFO L226 Difference]: Without dead ends: 362 [2020-01-16 19:00:22,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-01-16 19:00:22,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 218. [2020-01-16 19:00:22,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-01-16 19:00:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 653 transitions. [2020-01-16 19:00:22,869 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 653 transitions. Word has length 19 [2020-01-16 19:00:22,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:22,869 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 653 transitions. [2020-01-16 19:00:22,869 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 653 transitions. [2020-01-16 19:00:22,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:22,870 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:22,870 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:22,870 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 19:00:22,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:22,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1989547560, now seen corresponding path program 242 times [2020-01-16 19:00:22,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:22,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373733949] [2020-01-16 19:00:22,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:23,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 19:00:23,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373733949] [2020-01-16 19:00:23,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:23,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:23,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528523475] [2020-01-16 19:00:23,085 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:23,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:23,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:23,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:23,085 INFO L87 Difference]: Start difference. First operand 218 states and 653 transitions. Second operand 8 states. [2020-01-16 19:00:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:23,168 INFO L93 Difference]: Finished difference Result 376 states and 965 transitions. [2020-01-16 19:00:23,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:23,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:23,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:23,170 INFO L225 Difference]: With dead ends: 376 [2020-01-16 19:00:23,170 INFO L226 Difference]: Without dead ends: 354 [2020-01-16 19:00:23,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 19:00:23,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-01-16 19:00:23,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 210. [2020-01-16 19:00:23,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-01-16 19:00:23,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 632 transitions. [2020-01-16 19:00:23,175 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 632 transitions. Word has length 19 [2020-01-16 19:00:23,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:23,175 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 632 transitions. [2020-01-16 19:00:23,175 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 632 transitions. [2020-01-16 19:00:23,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:23,176 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:23,176 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:23,176 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 19:00:23,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:23,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1498681168, now seen corresponding path program 243 times [2020-01-16 19:00:23,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:23,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953297707] [2020-01-16 19:00:23,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:23,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 19:00:23,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953297707] [2020-01-16 19:00:23,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:23,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:23,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291260876] [2020-01-16 19:00:23,392 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:23,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:23,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:23,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:23,392 INFO L87 Difference]: Start difference. First operand 210 states and 632 transitions. Second operand 8 states. [2020-01-16 19:00:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:23,467 INFO L93 Difference]: Finished difference Result 375 states and 962 transitions. [2020-01-16 19:00:23,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:23,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:23,468 INFO L225 Difference]: With dead ends: 375 [2020-01-16 19:00:23,468 INFO L226 Difference]: Without dead ends: 359 [2020-01-16 19:00:23,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-01-16 19:00:23,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 216. [2020-01-16 19:00:23,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-01-16 19:00:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 643 transitions. [2020-01-16 19:00:23,473 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 643 transitions. Word has length 19 [2020-01-16 19:00:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:23,473 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 643 transitions. [2020-01-16 19:00:23,473 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 643 transitions. [2020-01-16 19:00:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:23,474 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:23,474 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:23,474 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 19:00:23,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:23,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1820081378, now seen corresponding path program 244 times [2020-01-16 19:00:23,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:23,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735864049] [2020-01-16 19:00:23,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:23,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 19:00:23,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735864049] [2020-01-16 19:00:23,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:23,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:23,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476718834] [2020-01-16 19:00:23,706 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:23,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:23,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:23,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:23,707 INFO L87 Difference]: Start difference. First operand 216 states and 643 transitions. Second operand 8 states. [2020-01-16 19:00:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:23,788 INFO L93 Difference]: Finished difference Result 372 states and 951 transitions. [2020-01-16 19:00:23,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:23,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:23,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:23,789 INFO L225 Difference]: With dead ends: 372 [2020-01-16 19:00:23,789 INFO L226 Difference]: Without dead ends: 353 [2020-01-16 19:00:23,790 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-01-16 19:00:23,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 210. [2020-01-16 19:00:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-01-16 19:00:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 626 transitions. [2020-01-16 19:00:23,794 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 626 transitions. Word has length 19 [2020-01-16 19:00:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:23,794 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 626 transitions. [2020-01-16 19:00:23,794 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:23,794 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 626 transitions. [2020-01-16 19:00:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:23,794 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:23,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 19:00:23,795 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 19:00:23,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:23,795 INFO L82 PathProgramCache]: Analyzing trace with hash -308913628, now seen corresponding path program 245 times [2020-01-16 19:00:23,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:23,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962073627] [2020-01-16 19:00:23,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:24,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:24,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962073627] [2020-01-16 19:00:24,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:24,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:24,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827026946] [2020-01-16 19:00:24,005 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:24,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:24,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:24,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:24,006 INFO L87 Difference]: Start difference. First operand 210 states and 626 transitions. Second operand 8 states. [2020-01-16 19:00:24,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:24,086 INFO L93 Difference]: Finished difference Result 370 states and 948 transitions. [2020-01-16 19:00:24,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:24,087 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:24,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:24,088 INFO L225 Difference]: With dead ends: 370 [2020-01-16 19:00:24,088 INFO L226 Difference]: Without dead ends: 356 [2020-01-16 19:00:24,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:24,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2020-01-16 19:00:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 215. [2020-01-16 19:00:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-01-16 19:00:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 636 transitions. [2020-01-16 19:00:24,094 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 636 transitions. Word has length 19 [2020-01-16 19:00:24,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:24,094 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 636 transitions. [2020-01-16 19:00:24,094 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 636 transitions. [2020-01-16 19:00:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:24,094 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:24,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:24,095 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 19:00:24,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:24,095 INFO L82 PathProgramCache]: Analyzing trace with hash 549366256, now seen corresponding path program 246 times [2020-01-16 19:00:24,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:24,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504786761] [2020-01-16 19:00:24,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:24,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504786761] [2020-01-16 19:00:24,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:24,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:24,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056479080] [2020-01-16 19:00:24,306 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:24,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:24,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:24,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:24,306 INFO L87 Difference]: Start difference. First operand 215 states and 636 transitions. Second operand 8 states. [2020-01-16 19:00:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:24,388 INFO L93 Difference]: Finished difference Result 369 states and 941 transitions. [2020-01-16 19:00:24,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:24,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:24,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:24,390 INFO L225 Difference]: With dead ends: 369 [2020-01-16 19:00:24,390 INFO L226 Difference]: Without dead ends: 343 [2020-01-16 19:00:24,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 19:00:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-01-16 19:00:24,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 202. [2020-01-16 19:00:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-01-16 19:00:24,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 608 transitions. [2020-01-16 19:00:24,395 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 608 transitions. Word has length 19 [2020-01-16 19:00:24,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:24,395 INFO L478 AbstractCegarLoop]: Abstraction has 202 states and 608 transitions. [2020-01-16 19:00:24,395 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:24,396 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 608 transitions. [2020-01-16 19:00:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:24,396 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:24,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 19:00:24,396 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 19:00:24,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:24,396 INFO L82 PathProgramCache]: Analyzing trace with hash -667701144, now seen corresponding path program 247 times [2020-01-16 19:00:24,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:24,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127254932] [2020-01-16 19:00:24,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:24,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 19:00:24,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127254932] [2020-01-16 19:00:24,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:24,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:24,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450251396] [2020-01-16 19:00:24,613 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:24,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:24,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:24,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:24,613 INFO L87 Difference]: Start difference. First operand 202 states and 608 transitions. Second operand 8 states. [2020-01-16 19:00:24,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:24,678 INFO L93 Difference]: Finished difference Result 365 states and 929 transitions. [2020-01-16 19:00:24,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:24,678 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:24,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:24,679 INFO L225 Difference]: With dead ends: 365 [2020-01-16 19:00:24,679 INFO L226 Difference]: Without dead ends: 349 [2020-01-16 19:00:24,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:24,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-01-16 19:00:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 214. [2020-01-16 19:00:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-01-16 19:00:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 634 transitions. [2020-01-16 19:00:24,685 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 634 transitions. Word has length 19 [2020-01-16 19:00:24,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:24,685 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 634 transitions. [2020-01-16 19:00:24,685 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 634 transitions. [2020-01-16 19:00:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:24,686 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:24,686 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:24,686 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 19:00:24,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:24,686 INFO L82 PathProgramCache]: Analyzing trace with hash -293049958, now seen corresponding path program 248 times [2020-01-16 19:00:24,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:24,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374265216] [2020-01-16 19:00:24,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:24,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 19:00:24,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374265216] [2020-01-16 19:00:24,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:24,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:24,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641256769] [2020-01-16 19:00:24,897 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:24,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:24,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:24,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:24,898 INFO L87 Difference]: Start difference. First operand 214 states and 634 transitions. Second operand 8 states. [2020-01-16 19:00:24,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:24,982 INFO L93 Difference]: Finished difference Result 363 states and 919 transitions. [2020-01-16 19:00:24,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:24,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:24,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:24,983 INFO L225 Difference]: With dead ends: 363 [2020-01-16 19:00:24,984 INFO L226 Difference]: Without dead ends: 341 [2020-01-16 19:00:24,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 19:00:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-01-16 19:00:24,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 206. [2020-01-16 19:00:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-01-16 19:00:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 616 transitions. [2020-01-16 19:00:24,989 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 616 transitions. Word has length 19 [2020-01-16 19:00:24,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:24,989 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 616 transitions. [2020-01-16 19:00:24,989 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:24,989 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 616 transitions. [2020-01-16 19:00:24,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:24,990 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:24,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 19:00:24,990 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 19:00:24,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:24,990 INFO L82 PathProgramCache]: Analyzing trace with hash -463100062, now seen corresponding path program 249 times [2020-01-16 19:00:24,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:24,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699972927] [2020-01-16 19:00:24,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:25,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699972927] [2020-01-16 19:00:25,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:25,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:25,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992648446] [2020-01-16 19:00:25,184 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:25,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:25,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:25,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:25,184 INFO L87 Difference]: Start difference. First operand 206 states and 616 transitions. Second operand 8 states. [2020-01-16 19:00:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:25,250 INFO L93 Difference]: Finished difference Result 356 states and 902 transitions. [2020-01-16 19:00:25,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:25,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:25,252 INFO L225 Difference]: With dead ends: 356 [2020-01-16 19:00:25,252 INFO L226 Difference]: Without dead ends: 340 [2020-01-16 19:00:25,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 19:00:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-01-16 19:00:25,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 209. [2020-01-16 19:00:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-01-16 19:00:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 620 transitions. [2020-01-16 19:00:25,258 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 620 transitions. Word has length 19 [2020-01-16 19:00:25,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:25,258 INFO L478 AbstractCegarLoop]: Abstraction has 209 states and 620 transitions. [2020-01-16 19:00:25,258 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:25,258 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 620 transitions. [2020-01-16 19:00:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:25,258 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:25,258 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:25,258 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 19:00:25,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:25,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1680140688, now seen corresponding path program 250 times [2020-01-16 19:00:25,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:25,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338708690] [2020-01-16 19:00:25,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:25,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 19:00:25,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338708690] [2020-01-16 19:00:25,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:25,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:25,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974797815] [2020-01-16 19:00:25,468 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:25,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:25,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:25,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:25,469 INFO L87 Difference]: Start difference. First operand 209 states and 620 transitions. Second operand 8 states. [2020-01-16 19:00:25,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:25,554 INFO L93 Difference]: Finished difference Result 350 states and 887 transitions. [2020-01-16 19:00:25,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:25,554 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:25,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:25,555 INFO L225 Difference]: With dead ends: 350 [2020-01-16 19:00:25,555 INFO L226 Difference]: Without dead ends: 337 [2020-01-16 19:00:25,555 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:25,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-01-16 19:00:25,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 206. [2020-01-16 19:00:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-01-16 19:00:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 613 transitions. [2020-01-16 19:00:25,562 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 613 transitions. Word has length 19 [2020-01-16 19:00:25,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:25,562 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 613 transitions. [2020-01-16 19:00:25,562 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 613 transitions. [2020-01-16 19:00:25,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:25,562 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:25,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 19:00:25,563 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 19:00:25,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:25,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1861116096, now seen corresponding path program 251 times [2020-01-16 19:00:25,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:25,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451030193] [2020-01-16 19:00:25,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:25,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 19:00:25,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451030193] [2020-01-16 19:00:25,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:25,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:25,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784949151] [2020-01-16 19:00:25,753 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:25,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:25,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:25,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:25,753 INFO L87 Difference]: Start difference. First operand 206 states and 613 transitions. Second operand 8 states. [2020-01-16 19:00:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:25,832 INFO L93 Difference]: Finished difference Result 351 states and 891 transitions. [2020-01-16 19:00:25,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:25,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:25,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:25,834 INFO L225 Difference]: With dead ends: 351 [2020-01-16 19:00:25,834 INFO L226 Difference]: Without dead ends: 337 [2020-01-16 19:00:25,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 19:00:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-01-16 19:00:25,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 208. [2020-01-16 19:00:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-01-16 19:00:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 616 transitions. [2020-01-16 19:00:25,838 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 616 transitions. Word has length 19 [2020-01-16 19:00:25,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:25,838 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 616 transitions. [2020-01-16 19:00:25,838 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 616 transitions. [2020-01-16 19:00:25,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:25,839 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:25,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 19:00:25,839 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 19:00:25,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:25,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1559515874, now seen corresponding path program 252 times [2020-01-16 19:00:25,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:25,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777794187] [2020-01-16 19:00:25,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:26,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 19:00:26,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777794187] [2020-01-16 19:00:26,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:26,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:26,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450756401] [2020-01-16 19:00:26,029 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:26,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:26,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:26,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:26,030 INFO L87 Difference]: Start difference. First operand 208 states and 616 transitions. Second operand 8 states. [2020-01-16 19:00:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:26,114 INFO L93 Difference]: Finished difference Result 347 states and 880 transitions. [2020-01-16 19:00:26,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:26,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:26,117 INFO L225 Difference]: With dead ends: 347 [2020-01-16 19:00:26,117 INFO L226 Difference]: Without dead ends: 331 [2020-01-16 19:00:26,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:26,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-01-16 19:00:26,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 202. [2020-01-16 19:00:26,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-01-16 19:00:26,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 604 transitions. [2020-01-16 19:00:26,123 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 604 transitions. Word has length 19 [2020-01-16 19:00:26,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:26,123 INFO L478 AbstractCegarLoop]: Abstraction has 202 states and 604 transitions. [2020-01-16 19:00:26,123 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 604 transitions. [2020-01-16 19:00:26,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:26,124 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:26,124 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:26,124 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 19:00:26,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:26,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1800243944, now seen corresponding path program 253 times [2020-01-16 19:00:26,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:26,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589393702] [2020-01-16 19:00:26,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:26,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589393702] [2020-01-16 19:00:26,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:26,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:26,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102618302] [2020-01-16 19:00:26,317 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:26,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:26,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:26,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:26,318 INFO L87 Difference]: Start difference. First operand 202 states and 604 transitions. Second operand 8 states. [2020-01-16 19:00:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:26,378 INFO L93 Difference]: Finished difference Result 352 states and 894 transitions. [2020-01-16 19:00:26,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:26,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:26,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:26,379 INFO L225 Difference]: With dead ends: 352 [2020-01-16 19:00:26,379 INFO L226 Difference]: Without dead ends: 336 [2020-01-16 19:00:26,380 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:26,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-01-16 19:00:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 208. [2020-01-16 19:00:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-01-16 19:00:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 618 transitions. [2020-01-16 19:00:26,385 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 618 transitions. Word has length 19 [2020-01-16 19:00:26,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:26,385 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 618 transitions. [2020-01-16 19:00:26,385 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 618 transitions. [2020-01-16 19:00:26,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:26,386 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:26,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 19:00:26,386 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 19:00:26,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:26,387 INFO L82 PathProgramCache]: Analyzing trace with hash -351482602, now seen corresponding path program 254 times [2020-01-16 19:00:26,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:26,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179556896] [2020-01-16 19:00:26,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:26,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 19:00:26,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179556896] [2020-01-16 19:00:26,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:26,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:26,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101270700] [2020-01-16 19:00:26,585 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:26,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:26,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:26,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:26,585 INFO L87 Difference]: Start difference. First operand 208 states and 618 transitions. Second operand 8 states. [2020-01-16 19:00:26,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:26,673 INFO L93 Difference]: Finished difference Result 346 states and 879 transitions. [2020-01-16 19:00:26,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:26,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:26,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:26,675 INFO L225 Difference]: With dead ends: 346 [2020-01-16 19:00:26,675 INFO L226 Difference]: Without dead ends: 333 [2020-01-16 19:00:26,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 19:00:26,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-01-16 19:00:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 205. [2020-01-16 19:00:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-01-16 19:00:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 611 transitions. [2020-01-16 19:00:26,680 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 611 transitions. Word has length 19 [2020-01-16 19:00:26,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:26,680 INFO L478 AbstractCegarLoop]: Abstraction has 205 states and 611 transitions. [2020-01-16 19:00:26,680 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 611 transitions. [2020-01-16 19:00:26,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:26,680 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:26,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 19:00:26,680 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 19:00:26,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:26,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1293897678, now seen corresponding path program 255 times [2020-01-16 19:00:26,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:26,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992005250] [2020-01-16 19:00:26,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:26,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992005250] [2020-01-16 19:00:26,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:26,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:26,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392259307] [2020-01-16 19:00:26,879 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:26,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:26,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:26,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:26,879 INFO L87 Difference]: Start difference. First operand 205 states and 611 transitions. Second operand 8 states. [2020-01-16 19:00:26,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:26,944 INFO L93 Difference]: Finished difference Result 358 states and 908 transitions. [2020-01-16 19:00:26,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:26,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:26,946 INFO L225 Difference]: With dead ends: 358 [2020-01-16 19:00:26,946 INFO L226 Difference]: Without dead ends: 342 [2020-01-16 19:00:26,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2020-01-16 19:00:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 211. [2020-01-16 19:00:26,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-01-16 19:00:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 622 transitions. [2020-01-16 19:00:26,951 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 622 transitions. Word has length 19 [2020-01-16 19:00:26,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:26,951 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 622 transitions. [2020-01-16 19:00:26,951 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 622 transitions. [2020-01-16 19:00:26,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:26,951 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:26,951 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:26,951 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 19:00:26,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:26,952 INFO L82 PathProgramCache]: Analyzing trace with hash 317692928, now seen corresponding path program 256 times [2020-01-16 19:00:26,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:26,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599569301] [2020-01-16 19:00:26,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:27,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 19:00:27,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599569301] [2020-01-16 19:00:27,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:27,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:27,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138444247] [2020-01-16 19:00:27,137 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:27,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:27,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:27,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:27,138 INFO L87 Difference]: Start difference. First operand 211 states and 622 transitions. Second operand 8 states. [2020-01-16 19:00:27,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:27,221 INFO L93 Difference]: Finished difference Result 355 states and 897 transitions. [2020-01-16 19:00:27,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:27,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:27,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:27,222 INFO L225 Difference]: With dead ends: 355 [2020-01-16 19:00:27,223 INFO L226 Difference]: Without dead ends: 336 [2020-01-16 19:00:27,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 19:00:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-01-16 19:00:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 205. [2020-01-16 19:00:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-01-16 19:00:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 608 transitions. [2020-01-16 19:00:27,228 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 608 transitions. Word has length 19 [2020-01-16 19:00:27,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:27,228 INFO L478 AbstractCegarLoop]: Abstraction has 205 states and 608 transitions. [2020-01-16 19:00:27,229 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 608 transitions. [2020-01-16 19:00:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:27,229 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:27,229 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:27,229 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 19:00:27,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:27,229 INFO L82 PathProgramCache]: Analyzing trace with hash -235841100, now seen corresponding path program 257 times [2020-01-16 19:00:27,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:27,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873574252] [2020-01-16 19:00:27,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:27,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873574252] [2020-01-16 19:00:27,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:27,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:27,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488089908] [2020-01-16 19:00:27,417 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:27,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:27,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:27,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:27,418 INFO L87 Difference]: Start difference. First operand 205 states and 608 transitions. Second operand 8 states. [2020-01-16 19:00:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:27,509 INFO L93 Difference]: Finished difference Result 342 states and 869 transitions. [2020-01-16 19:00:27,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:27,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:27,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:27,510 INFO L225 Difference]: With dead ends: 342 [2020-01-16 19:00:27,510 INFO L226 Difference]: Without dead ends: 332 [2020-01-16 19:00:27,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 19:00:27,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-01-16 19:00:27,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 207. [2020-01-16 19:00:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-01-16 19:00:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 611 transitions. [2020-01-16 19:00:27,515 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 611 transitions. Word has length 19 [2020-01-16 19:00:27,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:27,515 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 611 transitions. [2020-01-16 19:00:27,515 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:27,515 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 611 transitions. [2020-01-16 19:00:27,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:27,515 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:27,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 19:00:27,515 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 19:00:27,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:27,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1964888434, now seen corresponding path program 258 times [2020-01-16 19:00:27,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:27,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362910207] [2020-01-16 19:00:27,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:27,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 19:00:27,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362910207] [2020-01-16 19:00:27,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:27,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:27,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297995695] [2020-01-16 19:00:27,696 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:27,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:27,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:27,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:27,696 INFO L87 Difference]: Start difference. First operand 207 states and 611 transitions. Second operand 8 states. [2020-01-16 19:00:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:27,781 INFO L93 Difference]: Finished difference Result 345 states and 874 transitions. [2020-01-16 19:00:27,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:27,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:27,782 INFO L225 Difference]: With dead ends: 345 [2020-01-16 19:00:27,782 INFO L226 Difference]: Without dead ends: 327 [2020-01-16 19:00:27,782 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:27,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-01-16 19:00:27,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 202. [2020-01-16 19:00:27,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-01-16 19:00:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 601 transitions. [2020-01-16 19:00:27,787 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 601 transitions. Word has length 19 [2020-01-16 19:00:27,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:27,787 INFO L478 AbstractCegarLoop]: Abstraction has 202 states and 601 transitions. [2020-01-16 19:00:27,788 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 601 transitions. [2020-01-16 19:00:27,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:27,788 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:27,788 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:27,788 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 19:00:27,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:27,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1020844596, now seen corresponding path program 259 times [2020-01-16 19:00:27,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:27,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295238993] [2020-01-16 19:00:27,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:27,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 19:00:27,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295238993] [2020-01-16 19:00:27,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:27,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:27,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388655577] [2020-01-16 19:00:27,968 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:27,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:27,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:27,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:27,968 INFO L87 Difference]: Start difference. First operand 202 states and 601 transitions. Second operand 8 states. [2020-01-16 19:00:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:28,054 INFO L93 Difference]: Finished difference Result 342 states and 873 transitions. [2020-01-16 19:00:28,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:28,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:28,056 INFO L225 Difference]: With dead ends: 342 [2020-01-16 19:00:28,056 INFO L226 Difference]: Without dead ends: 328 [2020-01-16 19:00:28,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-01-16 19:00:28,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 206. [2020-01-16 19:00:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-01-16 19:00:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 611 transitions. [2020-01-16 19:00:28,061 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 611 transitions. Word has length 19 [2020-01-16 19:00:28,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:28,061 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 611 transitions. [2020-01-16 19:00:28,061 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:28,061 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 611 transitions. [2020-01-16 19:00:28,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:28,062 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:28,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 19:00:28,062 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 19:00:28,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:28,062 INFO L82 PathProgramCache]: Analyzing trace with hash 146509270, now seen corresponding path program 260 times [2020-01-16 19:00:28,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:28,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907594444] [2020-01-16 19:00:28,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:28,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907594444] [2020-01-16 19:00:28,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:28,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:28,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676997774] [2020-01-16 19:00:28,247 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:28,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:28,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:28,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:28,247 INFO L87 Difference]: Start difference. First operand 206 states and 611 transitions. Second operand 8 states. [2020-01-16 19:00:28,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:28,331 INFO L93 Difference]: Finished difference Result 338 states and 862 transitions. [2020-01-16 19:00:28,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:28,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:28,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:28,332 INFO L225 Difference]: With dead ends: 338 [2020-01-16 19:00:28,333 INFO L226 Difference]: Without dead ends: 326 [2020-01-16 19:00:28,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 19:00:28,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-01-16 19:00:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 204. [2020-01-16 19:00:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-01-16 19:00:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 606 transitions. [2020-01-16 19:00:28,338 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 606 transitions. Word has length 19 [2020-01-16 19:00:28,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:28,338 INFO L478 AbstractCegarLoop]: Abstraction has 204 states and 606 transitions. [2020-01-16 19:00:28,338 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:28,339 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 606 transitions. [2020-01-16 19:00:28,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:28,339 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:28,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:28,339 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 19:00:28,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:28,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1040015206, now seen corresponding path program 261 times [2020-01-16 19:00:28,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:28,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162732643] [2020-01-16 19:00:28,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:28,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162732643] [2020-01-16 19:00:28,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:28,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:28,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960751888] [2020-01-16 19:00:28,526 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:28,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:28,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:28,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:28,526 INFO L87 Difference]: Start difference. First operand 204 states and 606 transitions. Second operand 8 states. [2020-01-16 19:00:28,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:28,607 INFO L93 Difference]: Finished difference Result 348 states and 888 transitions. [2020-01-16 19:00:28,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:28,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:28,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:28,609 INFO L225 Difference]: With dead ends: 348 [2020-01-16 19:00:28,609 INFO L226 Difference]: Without dead ends: 334 [2020-01-16 19:00:28,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-01-16 19:00:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 209. [2020-01-16 19:00:28,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-01-16 19:00:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 616 transitions. [2020-01-16 19:00:28,613 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 616 transitions. Word has length 19 [2020-01-16 19:00:28,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:28,614 INFO L478 AbstractCegarLoop]: Abstraction has 209 states and 616 transitions. [2020-01-16 19:00:28,614 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:28,614 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 616 transitions. [2020-01-16 19:00:28,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:28,614 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:28,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 19:00:28,614 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 19:00:28,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:28,615 INFO L82 PathProgramCache]: Analyzing trace with hash -71131166, now seen corresponding path program 262 times [2020-01-16 19:00:28,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:28,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225593171] [2020-01-16 19:00:28,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:28,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225593171] [2020-01-16 19:00:28,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:28,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:28,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589281038] [2020-01-16 19:00:28,803 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:28,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:28,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:28,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:28,803 INFO L87 Difference]: Start difference. First operand 209 states and 616 transitions. Second operand 8 states. [2020-01-16 19:00:28,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:28,891 INFO L93 Difference]: Finished difference Result 347 states and 881 transitions. [2020-01-16 19:00:28,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:28,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:28,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:28,892 INFO L225 Difference]: With dead ends: 347 [2020-01-16 19:00:28,892 INFO L226 Difference]: Without dead ends: 329 [2020-01-16 19:00:28,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-01-16 19:00:28,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 204. [2020-01-16 19:00:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-01-16 19:00:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 604 transitions. [2020-01-16 19:00:28,898 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 604 transitions. Word has length 19 [2020-01-16 19:00:28,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:28,898 INFO L478 AbstractCegarLoop]: Abstraction has 204 states and 604 transitions. [2020-01-16 19:00:28,899 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 604 transitions. [2020-01-16 19:00:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:28,899 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:28,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 19:00:28,900 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 19:00:28,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:28,900 INFO L82 PathProgramCache]: Analyzing trace with hash 319756962, now seen corresponding path program 263 times [2020-01-16 19:00:28,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:28,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031430524] [2020-01-16 19:00:28,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:29,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031430524] [2020-01-16 19:00:29,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:29,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:29,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431845713] [2020-01-16 19:00:29,111 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:29,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:29,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:29,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:29,112 INFO L87 Difference]: Start difference. First operand 204 states and 604 transitions. Second operand 8 states. [2020-01-16 19:00:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:29,187 INFO L93 Difference]: Finished difference Result 337 states and 858 transitions. [2020-01-16 19:00:29,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:29,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:29,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:29,188 INFO L225 Difference]: With dead ends: 337 [2020-01-16 19:00:29,188 INFO L226 Difference]: Without dead ends: 327 [2020-01-16 19:00:29,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 19:00:29,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-01-16 19:00:29,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 206. [2020-01-16 19:00:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-01-16 19:00:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 607 transitions. [2020-01-16 19:00:29,196 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 607 transitions. Word has length 19 [2020-01-16 19:00:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:29,196 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 607 transitions. [2020-01-16 19:00:29,196 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 607 transitions. [2020-01-16 19:00:29,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:29,197 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:29,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:29,197 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 19:00:29,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:29,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1409290372, now seen corresponding path program 264 times [2020-01-16 19:00:29,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:29,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694573566] [2020-01-16 19:00:29,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:29,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 19:00:29,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694573566] [2020-01-16 19:00:29,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:29,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:29,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426237420] [2020-01-16 19:00:29,382 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:29,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:29,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:29,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:29,383 INFO L87 Difference]: Start difference. First operand 206 states and 607 transitions. Second operand 8 states. [2020-01-16 19:00:29,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:29,469 INFO L93 Difference]: Finished difference Result 340 states and 863 transitions. [2020-01-16 19:00:29,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:29,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:29,470 INFO L225 Difference]: With dead ends: 340 [2020-01-16 19:00:29,470 INFO L226 Difference]: Without dead ends: 318 [2020-01-16 19:00:29,471 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:29,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-01-16 19:00:29,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 197. [2020-01-16 19:00:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-01-16 19:00:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 591 transitions. [2020-01-16 19:00:29,476 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 591 transitions. Word has length 19 [2020-01-16 19:00:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:29,476 INFO L478 AbstractCegarLoop]: Abstraction has 197 states and 591 transitions. [2020-01-16 19:00:29,476 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:29,476 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 591 transitions. [2020-01-16 19:00:29,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:29,476 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:29,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:29,477 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 19:00:29,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:29,477 INFO L82 PathProgramCache]: Analyzing trace with hash -666960488, now seen corresponding path program 265 times [2020-01-16 19:00:29,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:29,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685758761] [2020-01-16 19:00:29,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:29,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 19:00:29,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685758761] [2020-01-16 19:00:29,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:29,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:29,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166146859] [2020-01-16 19:00:29,708 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:29,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:29,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:29,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:29,709 INFO L87 Difference]: Start difference. First operand 197 states and 591 transitions. Second operand 8 states. [2020-01-16 19:00:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:29,768 INFO L93 Difference]: Finished difference Result 365 states and 927 transitions. [2020-01-16 19:00:29,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:29,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:29,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:29,770 INFO L225 Difference]: With dead ends: 365 [2020-01-16 19:00:29,770 INFO L226 Difference]: Without dead ends: 349 [2020-01-16 19:00:29,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 19:00:29,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-01-16 19:00:29,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 205. [2020-01-16 19:00:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-01-16 19:00:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 605 transitions. [2020-01-16 19:00:29,775 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 605 transitions. Word has length 19 [2020-01-16 19:00:29,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:29,775 INFO L478 AbstractCegarLoop]: Abstraction has 205 states and 605 transitions. [2020-01-16 19:00:29,775 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 605 transitions. [2020-01-16 19:00:29,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:29,775 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:29,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 19:00:29,775 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 19:00:29,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:29,776 INFO L82 PathProgramCache]: Analyzing trace with hash -292309302, now seen corresponding path program 266 times [2020-01-16 19:00:29,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:29,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399413077] [2020-01-16 19:00:29,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:30,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399413077] [2020-01-16 19:00:30,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:30,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:30,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098266391] [2020-01-16 19:00:30,013 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:30,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:30,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:30,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:30,013 INFO L87 Difference]: Start difference. First operand 205 states and 605 transitions. Second operand 8 states. [2020-01-16 19:00:30,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:30,086 INFO L93 Difference]: Finished difference Result 363 states and 917 transitions. [2020-01-16 19:00:30,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:30,087 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:30,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:30,088 INFO L225 Difference]: With dead ends: 363 [2020-01-16 19:00:30,088 INFO L226 Difference]: Without dead ends: 341 [2020-01-16 19:00:30,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:30,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-01-16 19:00:30,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 197. [2020-01-16 19:00:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-01-16 19:00:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 584 transitions. [2020-01-16 19:00:30,093 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 584 transitions. Word has length 19 [2020-01-16 19:00:30,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:30,093 INFO L478 AbstractCegarLoop]: Abstraction has 197 states and 584 transitions. [2020-01-16 19:00:30,093 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 584 transitions. [2020-01-16 19:00:30,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:30,094 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:30,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:30,094 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 19:00:30,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:30,094 INFO L82 PathProgramCache]: Analyzing trace with hash 514429266, now seen corresponding path program 267 times [2020-01-16 19:00:30,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:30,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147029486] [2020-01-16 19:00:30,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:30,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147029486] [2020-01-16 19:00:30,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:30,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:30,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512722153] [2020-01-16 19:00:30,312 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:30,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:30,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:30,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:30,313 INFO L87 Difference]: Start difference. First operand 197 states and 584 transitions. Second operand 8 states. [2020-01-16 19:00:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:30,371 INFO L93 Difference]: Finished difference Result 362 states and 914 transitions. [2020-01-16 19:00:30,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:30,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:30,373 INFO L225 Difference]: With dead ends: 362 [2020-01-16 19:00:30,373 INFO L226 Difference]: Without dead ends: 346 [2020-01-16 19:00:30,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 19:00:30,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-01-16 19:00:30,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 203. [2020-01-16 19:00:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-01-16 19:00:30,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 595 transitions. [2020-01-16 19:00:30,379 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 595 transitions. Word has length 19 [2020-01-16 19:00:30,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:30,379 INFO L478 AbstractCegarLoop]: Abstraction has 203 states and 595 transitions. [2020-01-16 19:00:30,379 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:30,379 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 595 transitions. [2020-01-16 19:00:30,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:30,380 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:30,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 19:00:30,380 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 19:00:30,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:30,381 INFO L82 PathProgramCache]: Analyzing trace with hash -461775484, now seen corresponding path program 268 times [2020-01-16 19:00:30,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:30,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617487731] [2020-01-16 19:00:30,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:30,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:30,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617487731] [2020-01-16 19:00:30,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:30,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:30,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436690129] [2020-01-16 19:00:30,603 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:30,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:30,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:30,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:30,603 INFO L87 Difference]: Start difference. First operand 203 states and 595 transitions. Second operand 8 states. [2020-01-16 19:00:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:30,684 INFO L93 Difference]: Finished difference Result 359 states and 903 transitions. [2020-01-16 19:00:30,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:30,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:30,685 INFO L225 Difference]: With dead ends: 359 [2020-01-16 19:00:30,685 INFO L226 Difference]: Without dead ends: 340 [2020-01-16 19:00:30,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-01-16 19:00:30,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 197. [2020-01-16 19:00:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-01-16 19:00:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 578 transitions. [2020-01-16 19:00:30,690 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 578 transitions. Word has length 19 [2020-01-16 19:00:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:30,690 INFO L478 AbstractCegarLoop]: Abstraction has 197 states and 578 transitions. [2020-01-16 19:00:30,690 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 578 transitions. [2020-01-16 19:00:30,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:30,691 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:30,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 19:00:30,691 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 19:00:30,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:30,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1704196806, now seen corresponding path program 269 times [2020-01-16 19:00:30,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:30,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613523034] [2020-01-16 19:00:30,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:30,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 19:00:30,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613523034] [2020-01-16 19:00:30,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:30,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:30,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506779807] [2020-01-16 19:00:30,908 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:30,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:30,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:30,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:30,909 INFO L87 Difference]: Start difference. First operand 197 states and 578 transitions. Second operand 8 states. [2020-01-16 19:00:30,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:30,991 INFO L93 Difference]: Finished difference Result 357 states and 900 transitions. [2020-01-16 19:00:30,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:30,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:30,992 INFO L225 Difference]: With dead ends: 357 [2020-01-16 19:00:30,992 INFO L226 Difference]: Without dead ends: 343 [2020-01-16 19:00:30,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:30,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-01-16 19:00:30,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 202. [2020-01-16 19:00:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-01-16 19:00:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 588 transitions. [2020-01-16 19:00:30,997 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 588 transitions. Word has length 19 [2020-01-16 19:00:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:30,997 INFO L478 AbstractCegarLoop]: Abstraction has 202 states and 588 transitions. [2020-01-16 19:00:30,997 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 588 transitions. [2020-01-16 19:00:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:30,998 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:30,998 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:30,998 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 19:00:30,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:30,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1732490606, now seen corresponding path program 270 times [2020-01-16 19:00:30,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:30,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352130096] [2020-01-16 19:00:30,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:31,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352130096] [2020-01-16 19:00:31,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:31,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:31,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805600126] [2020-01-16 19:00:31,210 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:31,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:31,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:31,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:31,210 INFO L87 Difference]: Start difference. First operand 202 states and 588 transitions. Second operand 8 states. [2020-01-16 19:00:31,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:31,294 INFO L93 Difference]: Finished difference Result 356 states and 893 transitions. [2020-01-16 19:00:31,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:31,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:31,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:31,296 INFO L225 Difference]: With dead ends: 356 [2020-01-16 19:00:31,296 INFO L226 Difference]: Without dead ends: 330 [2020-01-16 19:00:31,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 19:00:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-01-16 19:00:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 189. [2020-01-16 19:00:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 19:00:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 560 transitions. [2020-01-16 19:00:31,301 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 560 transitions. Word has length 19 [2020-01-16 19:00:31,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:31,301 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 560 transitions. [2020-01-16 19:00:31,301 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:31,301 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 560 transitions. [2020-01-16 19:00:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:31,302 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:31,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 19:00:31,302 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 19:00:31,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:31,302 INFO L82 PathProgramCache]: Analyzing trace with hash 710767946, now seen corresponding path program 271 times [2020-01-16 19:00:31,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:31,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303935113] [2020-01-16 19:00:31,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:31,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303935113] [2020-01-16 19:00:31,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:31,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:31,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104154969] [2020-01-16 19:00:31,538 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:31,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:31,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:31,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:31,539 INFO L87 Difference]: Start difference. First operand 189 states and 560 transitions. Second operand 8 states. [2020-01-16 19:00:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:31,599 INFO L93 Difference]: Finished difference Result 344 states and 860 transitions. [2020-01-16 19:00:31,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:31,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:31,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:31,601 INFO L225 Difference]: With dead ends: 344 [2020-01-16 19:00:31,601 INFO L226 Difference]: Without dead ends: 328 [2020-01-16 19:00:31,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 19:00:31,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-01-16 19:00:31,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 201. [2020-01-16 19:00:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2020-01-16 19:00:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 586 transitions. [2020-01-16 19:00:31,606 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 586 transitions. Word has length 19 [2020-01-16 19:00:31,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:31,606 INFO L478 AbstractCegarLoop]: Abstraction has 201 states and 586 transitions. [2020-01-16 19:00:31,606 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:31,606 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 586 transitions. [2020-01-16 19:00:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:31,607 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:31,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 19:00:31,607 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 19:00:31,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:31,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1085419132, now seen corresponding path program 272 times [2020-01-16 19:00:31,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:31,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188427351] [2020-01-16 19:00:31,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:31,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 19:00:31,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188427351] [2020-01-16 19:00:31,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:31,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:31,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081350938] [2020-01-16 19:00:31,823 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:31,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:31,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:31,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:31,823 INFO L87 Difference]: Start difference. First operand 201 states and 586 transitions. Second operand 8 states. [2020-01-16 19:00:31,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:31,909 INFO L93 Difference]: Finished difference Result 342 states and 850 transitions. [2020-01-16 19:00:31,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:31,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:31,910 INFO L225 Difference]: With dead ends: 342 [2020-01-16 19:00:31,910 INFO L226 Difference]: Without dead ends: 320 [2020-01-16 19:00:31,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 19:00:31,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-01-16 19:00:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 193. [2020-01-16 19:00:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-01-16 19:00:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 568 transitions. [2020-01-16 19:00:31,915 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 568 transitions. Word has length 19 [2020-01-16 19:00:31,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:31,915 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 568 transitions. [2020-01-16 19:00:31,915 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 568 transitions. [2020-01-16 19:00:31,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:31,916 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:31,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 19:00:31,916 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 19:00:31,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:31,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1240965252, now seen corresponding path program 273 times [2020-01-16 19:00:31,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:31,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106252146] [2020-01-16 19:00:31,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:32,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106252146] [2020-01-16 19:00:32,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:32,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:32,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060518675] [2020-01-16 19:00:32,122 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:32,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:32,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:32,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:32,123 INFO L87 Difference]: Start difference. First operand 193 states and 568 transitions. Second operand 8 states. [2020-01-16 19:00:32,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:32,184 INFO L93 Difference]: Finished difference Result 327 states and 818 transitions. [2020-01-16 19:00:32,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:32,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:32,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:32,186 INFO L225 Difference]: With dead ends: 327 [2020-01-16 19:00:32,186 INFO L226 Difference]: Without dead ends: 311 [2020-01-16 19:00:32,186 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-01-16 19:00:32,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 196. [2020-01-16 19:00:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-01-16 19:00:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 572 transitions. [2020-01-16 19:00:32,191 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 572 transitions. Word has length 19 [2020-01-16 19:00:32,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:32,191 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 572 transitions. [2020-01-16 19:00:32,191 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:32,191 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 572 transitions. [2020-01-16 19:00:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:32,191 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:32,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 19:00:32,191 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 19:00:32,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:32,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1500023478, now seen corresponding path program 274 times [2020-01-16 19:00:32,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:32,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995707984] [2020-01-16 19:00:32,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:32,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995707984] [2020-01-16 19:00:32,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:32,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:32,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312546892] [2020-01-16 19:00:32,398 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:32,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:32,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:32,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:32,398 INFO L87 Difference]: Start difference. First operand 196 states and 572 transitions. Second operand 8 states. [2020-01-16 19:00:32,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:32,459 INFO L93 Difference]: Finished difference Result 312 states and 794 transitions. [2020-01-16 19:00:32,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:32,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:32,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:32,461 INFO L225 Difference]: With dead ends: 312 [2020-01-16 19:00:32,461 INFO L226 Difference]: Without dead ends: 299 [2020-01-16 19:00:32,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-01-16 19:00:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 193. [2020-01-16 19:00:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-01-16 19:00:32,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 565 transitions. [2020-01-16 19:00:32,466 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 565 transitions. Word has length 19 [2020-01-16 19:00:32,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:32,466 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 565 transitions. [2020-01-16 19:00:32,466 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 565 transitions. [2020-01-16 19:00:32,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:32,466 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:32,466 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:32,467 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 19:00:32,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:32,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1131696324, now seen corresponding path program 275 times [2020-01-16 19:00:32,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:32,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356922455] [2020-01-16 19:00:32,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:32,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356922455] [2020-01-16 19:00:32,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:32,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:32,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863790450] [2020-01-16 19:00:32,672 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:32,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:32,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:32,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:32,673 INFO L87 Difference]: Start difference. First operand 193 states and 565 transitions. Second operand 8 states. [2020-01-16 19:00:32,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:32,765 INFO L93 Difference]: Finished difference Result 324 states and 810 transitions. [2020-01-16 19:00:32,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:32,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:32,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:32,767 INFO L225 Difference]: With dead ends: 324 [2020-01-16 19:00:32,767 INFO L226 Difference]: Without dead ends: 310 [2020-01-16 19:00:32,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 19:00:32,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-01-16 19:00:32,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 195. [2020-01-16 19:00:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-01-16 19:00:32,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 568 transitions. [2020-01-16 19:00:32,771 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 568 transitions. Word has length 19 [2020-01-16 19:00:32,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:32,772 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 568 transitions. [2020-01-16 19:00:32,772 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:32,772 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 568 transitions. [2020-01-16 19:00:32,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:32,772 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:32,772 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:32,772 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 19:00:32,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:32,773 INFO L82 PathProgramCache]: Analyzing trace with hash -11566494, now seen corresponding path program 276 times [2020-01-16 19:00:32,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:32,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674988571] [2020-01-16 19:00:32,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:33,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674988571] [2020-01-16 19:00:33,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:33,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:33,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265678892] [2020-01-16 19:00:33,006 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:33,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:33,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:33,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:33,006 INFO L87 Difference]: Start difference. First operand 195 states and 568 transitions. Second operand 8 states. [2020-01-16 19:00:33,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:33,084 INFO L93 Difference]: Finished difference Result 311 states and 790 transitions. [2020-01-16 19:00:33,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:33,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:33,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:33,085 INFO L225 Difference]: With dead ends: 311 [2020-01-16 19:00:33,085 INFO L226 Difference]: Without dead ends: 295 [2020-01-16 19:00:33,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 19:00:33,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-01-16 19:00:33,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 189. [2020-01-16 19:00:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 19:00:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 556 transitions. [2020-01-16 19:00:33,089 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 556 transitions. Word has length 19 [2020-01-16 19:00:33,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:33,089 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 556 transitions. [2020-01-16 19:00:33,089 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 556 transitions. [2020-01-16 19:00:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:33,090 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:33,090 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:33,090 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 19:00:33,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:33,090 INFO L82 PathProgramCache]: Analyzing trace with hash -790658038, now seen corresponding path program 277 times [2020-01-16 19:00:33,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:33,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277605978] [2020-01-16 19:00:33,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:33,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277605978] [2020-01-16 19:00:33,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:33,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:33,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793366454] [2020-01-16 19:00:33,299 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:33,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:33,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:33,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:33,299 INFO L87 Difference]: Start difference. First operand 189 states and 556 transitions. Second operand 8 states. [2020-01-16 19:00:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:33,359 INFO L93 Difference]: Finished difference Result 339 states and 846 transitions. [2020-01-16 19:00:33,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:33,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:33,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:33,361 INFO L225 Difference]: With dead ends: 339 [2020-01-16 19:00:33,361 INFO L226 Difference]: Without dead ends: 323 [2020-01-16 19:00:33,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:33,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-01-16 19:00:33,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 195. [2020-01-16 19:00:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-01-16 19:00:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 570 transitions. [2020-01-16 19:00:33,366 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 570 transitions. Word has length 19 [2020-01-16 19:00:33,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:33,366 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 570 transitions. [2020-01-16 19:00:33,366 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:33,366 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 570 transitions. [2020-01-16 19:00:33,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:33,367 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:33,367 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:33,367 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 19:00:33,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:33,367 INFO L82 PathProgramCache]: Analyzing trace with hash -531599812, now seen corresponding path program 278 times [2020-01-16 19:00:33,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:33,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273199913] [2020-01-16 19:00:33,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:33,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273199913] [2020-01-16 19:00:33,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:33,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:33,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155729938] [2020-01-16 19:00:33,573 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:33,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:33,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:33,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:33,573 INFO L87 Difference]: Start difference. First operand 195 states and 570 transitions. Second operand 8 states. [2020-01-16 19:00:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:33,637 INFO L93 Difference]: Finished difference Result 333 states and 831 transitions. [2020-01-16 19:00:33,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:33,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:33,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:33,638 INFO L225 Difference]: With dead ends: 333 [2020-01-16 19:00:33,638 INFO L226 Difference]: Without dead ends: 320 [2020-01-16 19:00:33,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-01-16 19:00:33,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 192. [2020-01-16 19:00:33,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 19:00:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 563 transitions. [2020-01-16 19:00:33,643 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 563 transitions. Word has length 19 [2020-01-16 19:00:33,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:33,643 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 563 transitions. [2020-01-16 19:00:33,643 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 563 transitions. [2020-01-16 19:00:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:33,643 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:33,643 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:33,643 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 19:00:33,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:33,644 INFO L82 PathProgramCache]: Analyzing trace with hash 303433550, now seen corresponding path program 279 times [2020-01-16 19:00:33,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:33,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899547338] [2020-01-16 19:00:33,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:33,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 19:00:33,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899547338] [2020-01-16 19:00:33,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:33,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:33,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537116414] [2020-01-16 19:00:33,852 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:33,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:33,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:33,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:33,853 INFO L87 Difference]: Start difference. First operand 192 states and 563 transitions. Second operand 8 states. [2020-01-16 19:00:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:33,918 INFO L93 Difference]: Finished difference Result 339 states and 843 transitions. [2020-01-16 19:00:33,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:33,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:33,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:33,919 INFO L225 Difference]: With dead ends: 339 [2020-01-16 19:00:33,919 INFO L226 Difference]: Without dead ends: 323 [2020-01-16 19:00:33,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 19:00:33,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-01-16 19:00:33,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 198. [2020-01-16 19:00:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-01-16 19:00:33,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 574 transitions. [2020-01-16 19:00:33,924 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 574 transitions. Word has length 19 [2020-01-16 19:00:33,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:33,924 INFO L478 AbstractCegarLoop]: Abstraction has 198 states and 574 transitions. [2020-01-16 19:00:33,924 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:33,924 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 574 transitions. [2020-01-16 19:00:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:33,924 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:33,924 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:33,924 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 19:00:33,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:33,925 INFO L82 PathProgramCache]: Analyzing trace with hash -672771200, now seen corresponding path program 280 times [2020-01-16 19:00:33,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:33,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920562731] [2020-01-16 19:00:33,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:34,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 19:00:34,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920562731] [2020-01-16 19:00:34,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:34,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:34,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208178880] [2020-01-16 19:00:34,137 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:34,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:34,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:34,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:34,137 INFO L87 Difference]: Start difference. First operand 198 states and 574 transitions. Second operand 8 states. [2020-01-16 19:00:34,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:34,224 INFO L93 Difference]: Finished difference Result 336 states and 832 transitions. [2020-01-16 19:00:34,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:34,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:34,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:34,225 INFO L225 Difference]: With dead ends: 336 [2020-01-16 19:00:34,225 INFO L226 Difference]: Without dead ends: 317 [2020-01-16 19:00:34,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-01-16 19:00:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 192. [2020-01-16 19:00:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 19:00:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 560 transitions. [2020-01-16 19:00:34,229 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 560 transitions. Word has length 19 [2020-01-16 19:00:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:34,229 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 560 transitions. [2020-01-16 19:00:34,229 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:34,229 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 560 transitions. [2020-01-16 19:00:34,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:34,230 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:34,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 19:00:34,230 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 19:00:34,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:34,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1980171160, now seen corresponding path program 281 times [2020-01-16 19:00:34,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:34,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463042487] [2020-01-16 19:00:34,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:34,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 19:00:34,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463042487] [2020-01-16 19:00:34,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:34,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:34,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244683204] [2020-01-16 19:00:34,467 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:34,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:34,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:34,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:34,467 INFO L87 Difference]: Start difference. First operand 192 states and 560 transitions. Second operand 8 states. [2020-01-16 19:00:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:34,527 INFO L93 Difference]: Finished difference Result 323 states and 804 transitions. [2020-01-16 19:00:34,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:34,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:34,528 INFO L225 Difference]: With dead ends: 323 [2020-01-16 19:00:34,528 INFO L226 Difference]: Without dead ends: 313 [2020-01-16 19:00:34,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 19:00:34,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-01-16 19:00:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 194. [2020-01-16 19:00:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-01-16 19:00:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 563 transitions. [2020-01-16 19:00:34,534 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 563 transitions. Word has length 19 [2020-01-16 19:00:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:34,534 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 563 transitions. [2020-01-16 19:00:34,534 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:34,534 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 563 transitions. [2020-01-16 19:00:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:34,534 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:34,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 19:00:34,535 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 19:00:34,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:34,535 INFO L82 PathProgramCache]: Analyzing trace with hash -490766164, now seen corresponding path program 282 times [2020-01-16 19:00:34,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:34,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85127672] [2020-01-16 19:00:34,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:34,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85127672] [2020-01-16 19:00:34,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:34,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:34,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366079866] [2020-01-16 19:00:34,741 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:34,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:34,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:34,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:34,741 INFO L87 Difference]: Start difference. First operand 194 states and 563 transitions. Second operand 8 states. [2020-01-16 19:00:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:34,824 INFO L93 Difference]: Finished difference Result 321 states and 799 transitions. [2020-01-16 19:00:34,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:34,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:34,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:34,826 INFO L225 Difference]: With dead ends: 321 [2020-01-16 19:00:34,826 INFO L226 Difference]: Without dead ends: 303 [2020-01-16 19:00:34,826 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:34,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-01-16 19:00:34,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 189. [2020-01-16 19:00:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 19:00:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 553 transitions. [2020-01-16 19:00:34,831 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 553 transitions. Word has length 19 [2020-01-16 19:00:34,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:34,831 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 553 transitions. [2020-01-16 19:00:34,831 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:34,831 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 553 transitions. [2020-01-16 19:00:34,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:34,831 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:34,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 19:00:34,832 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 19:00:34,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:34,832 INFO L82 PathProgramCache]: Analyzing trace with hash 504306274, now seen corresponding path program 283 times [2020-01-16 19:00:34,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:34,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118790025] [2020-01-16 19:00:34,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:35,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 19:00:35,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118790025] [2020-01-16 19:00:35,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:35,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:35,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656117480] [2020-01-16 19:00:35,054 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:35,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:35,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:35,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:35,055 INFO L87 Difference]: Start difference. First operand 189 states and 553 transitions. Second operand 8 states. [2020-01-16 19:00:35,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:35,136 INFO L93 Difference]: Finished difference Result 329 states and 825 transitions. [2020-01-16 19:00:35,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:35,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:35,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:35,137 INFO L225 Difference]: With dead ends: 329 [2020-01-16 19:00:35,138 INFO L226 Difference]: Without dead ends: 315 [2020-01-16 19:00:35,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 19:00:35,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-01-16 19:00:35,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 193. [2020-01-16 19:00:35,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-01-16 19:00:35,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 563 transitions. [2020-01-16 19:00:35,143 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 563 transitions. Word has length 19 [2020-01-16 19:00:35,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:35,143 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 563 transitions. [2020-01-16 19:00:35,143 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 563 transitions. [2020-01-16 19:00:35,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:35,143 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:35,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 19:00:35,144 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 19:00:35,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:35,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1624436104, now seen corresponding path program 284 times [2020-01-16 19:00:35,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:35,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594000887] [2020-01-16 19:00:35,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:35,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 19:00:35,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594000887] [2020-01-16 19:00:35,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:35,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:35,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759562685] [2020-01-16 19:00:35,351 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:35,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:35,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:35,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:35,352 INFO L87 Difference]: Start difference. First operand 193 states and 563 transitions. Second operand 8 states. [2020-01-16 19:00:35,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:35,418 INFO L93 Difference]: Finished difference Result 325 states and 814 transitions. [2020-01-16 19:00:35,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:35,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:35,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:35,419 INFO L225 Difference]: With dead ends: 325 [2020-01-16 19:00:35,420 INFO L226 Difference]: Without dead ends: 313 [2020-01-16 19:00:35,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-01-16 19:00:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 191. [2020-01-16 19:00:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 19:00:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 558 transitions. [2020-01-16 19:00:35,424 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 558 transitions. Word has length 19 [2020-01-16 19:00:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:35,425 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 558 transitions. [2020-01-16 19:00:35,425 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 558 transitions. [2020-01-16 19:00:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:35,425 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:35,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 19:00:35,425 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 19:00:35,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:35,425 INFO L82 PathProgramCache]: Analyzing trace with hash -568779106, now seen corresponding path program 285 times [2020-01-16 19:00:35,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:35,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422879682] [2020-01-16 19:00:35,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:35,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 19:00:35,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422879682] [2020-01-16 19:00:35,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:35,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:35,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859641233] [2020-01-16 19:00:35,672 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:35,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:35,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:35,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:35,673 INFO L87 Difference]: Start difference. First operand 191 states and 558 transitions. Second operand 8 states. [2020-01-16 19:00:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:35,763 INFO L93 Difference]: Finished difference Result 330 states and 825 transitions. [2020-01-16 19:00:35,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:35,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:35,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:35,764 INFO L225 Difference]: With dead ends: 330 [2020-01-16 19:00:35,764 INFO L226 Difference]: Without dead ends: 316 [2020-01-16 19:00:35,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 19:00:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2020-01-16 19:00:35,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 196. [2020-01-16 19:00:35,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-01-16 19:00:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 568 transitions. [2020-01-16 19:00:35,769 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 568 transitions. Word has length 19 [2020-01-16 19:00:35,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:35,770 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 568 transitions. [2020-01-16 19:00:35,770 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:35,770 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 568 transitions. [2020-01-16 19:00:35,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:35,770 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:35,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 19:00:35,770 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 19:00:35,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:35,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1210836024, now seen corresponding path program 286 times [2020-01-16 19:00:35,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:35,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011345682] [2020-01-16 19:00:35,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:35,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 19:00:35,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011345682] [2020-01-16 19:00:35,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:35,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:35,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365495705] [2020-01-16 19:00:35,976 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:35,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:35,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:35,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:35,977 INFO L87 Difference]: Start difference. First operand 196 states and 568 transitions. Second operand 8 states. [2020-01-16 19:00:36,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:36,069 INFO L93 Difference]: Finished difference Result 329 states and 818 transitions. [2020-01-16 19:00:36,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:36,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:36,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:36,070 INFO L225 Difference]: With dead ends: 329 [2020-01-16 19:00:36,071 INFO L226 Difference]: Without dead ends: 311 [2020-01-16 19:00:36,071 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:36,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-01-16 19:00:36,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 191. [2020-01-16 19:00:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 19:00:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 556 transitions. [2020-01-16 19:00:36,075 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 556 transitions. Word has length 19 [2020-01-16 19:00:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:36,075 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 556 transitions. [2020-01-16 19:00:36,075 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 556 transitions. [2020-01-16 19:00:36,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:36,076 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:36,076 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:36,076 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 19:00:36,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:36,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1594820036, now seen corresponding path program 287 times [2020-01-16 19:00:36,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:36,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287973530] [2020-01-16 19:00:36,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:36,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 19:00:36,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287973530] [2020-01-16 19:00:36,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:36,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:36,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314117968] [2020-01-16 19:00:36,283 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:36,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:36,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:36,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:36,283 INFO L87 Difference]: Start difference. First operand 191 states and 556 transitions. Second operand 8 states. [2020-01-16 19:00:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:36,358 INFO L93 Difference]: Finished difference Result 319 states and 795 transitions. [2020-01-16 19:00:36,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:36,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:36,360 INFO L225 Difference]: With dead ends: 319 [2020-01-16 19:00:36,360 INFO L226 Difference]: Without dead ends: 309 [2020-01-16 19:00:36,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 19:00:36,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2020-01-16 19:00:36,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 193. [2020-01-16 19:00:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-01-16 19:00:36,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 559 transitions. [2020-01-16 19:00:36,365 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 559 transitions. Word has length 19 [2020-01-16 19:00:36,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:36,366 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 559 transitions. [2020-01-16 19:00:36,366 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:36,366 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 559 transitions. [2020-01-16 19:00:36,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:36,366 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:36,366 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:36,366 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 19:00:36,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:36,367 INFO L82 PathProgramCache]: Analyzing trace with hash -105415040, now seen corresponding path program 288 times [2020-01-16 19:00:36,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:36,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531766664] [2020-01-16 19:00:36,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:36,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531766664] [2020-01-16 19:00:36,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:36,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:36,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929334603] [2020-01-16 19:00:36,578 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:36,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:36,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:36,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:36,578 INFO L87 Difference]: Start difference. First operand 193 states and 559 transitions. Second operand 8 states. [2020-01-16 19:00:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:36,662 INFO L93 Difference]: Finished difference Result 317 states and 790 transitions. [2020-01-16 19:00:36,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:36,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:36,664 INFO L225 Difference]: With dead ends: 317 [2020-01-16 19:00:36,664 INFO L226 Difference]: Without dead ends: 295 [2020-01-16 19:00:36,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:36,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-01-16 19:00:36,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2020-01-16 19:00:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-01-16 19:00:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 543 transitions. [2020-01-16 19:00:36,669 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 543 transitions. Word has length 19 [2020-01-16 19:00:36,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:36,669 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 543 transitions. [2020-01-16 19:00:36,669 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:36,669 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 543 transitions. [2020-01-16 19:00:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:36,670 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:36,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 19:00:36,670 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 19:00:36,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:36,670 INFO L82 PathProgramCache]: Analyzing trace with hash -907792650, now seen corresponding path program 289 times [2020-01-16 19:00:36,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:36,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200340810] [2020-01-16 19:00:36,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:36,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 19:00:36,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200340810] [2020-01-16 19:00:36,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:36,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:36,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533940710] [2020-01-16 19:00:36,888 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:36,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:36,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:36,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:36,889 INFO L87 Difference]: Start difference. First operand 184 states and 543 transitions. Second operand 8 states. [2020-01-16 19:00:36,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:36,957 INFO L93 Difference]: Finished difference Result 330 states and 816 transitions. [2020-01-16 19:00:36,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:36,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:36,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:36,959 INFO L225 Difference]: With dead ends: 330 [2020-01-16 19:00:36,959 INFO L226 Difference]: Without dead ends: 314 [2020-01-16 19:00:36,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 19:00:36,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-01-16 19:00:36,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 199. [2020-01-16 19:00:36,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-01-16 19:00:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 580 transitions. [2020-01-16 19:00:36,963 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 580 transitions. Word has length 19 [2020-01-16 19:00:36,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:36,963 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 580 transitions. [2020-01-16 19:00:36,963 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:36,963 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 580 transitions. [2020-01-16 19:00:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:36,964 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:36,964 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:36,964 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 19:00:36,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:36,964 INFO L82 PathProgramCache]: Analyzing trace with hash -533141464, now seen corresponding path program 290 times [2020-01-16 19:00:36,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:36,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839938041] [2020-01-16 19:00:36,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:37,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839938041] [2020-01-16 19:00:37,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:37,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:37,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731458886] [2020-01-16 19:00:37,176 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:37,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:37,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:37,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:37,176 INFO L87 Difference]: Start difference. First operand 199 states and 580 transitions. Second operand 8 states. [2020-01-16 19:00:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:37,272 INFO L93 Difference]: Finished difference Result 328 states and 806 transitions. [2020-01-16 19:00:37,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:37,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:37,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:37,274 INFO L225 Difference]: With dead ends: 328 [2020-01-16 19:00:37,274 INFO L226 Difference]: Without dead ends: 306 [2020-01-16 19:00:37,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:37,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-01-16 19:00:37,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 191. [2020-01-16 19:00:37,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 19:00:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 562 transitions. [2020-01-16 19:00:37,279 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 562 transitions. Word has length 19 [2020-01-16 19:00:37,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:37,279 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 562 transitions. [2020-01-16 19:00:37,279 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:37,279 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 562 transitions. [2020-01-16 19:00:37,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:37,280 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:37,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 19:00:37,280 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 19:00:37,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:37,280 INFO L82 PathProgramCache]: Analyzing trace with hash -703191568, now seen corresponding path program 291 times [2020-01-16 19:00:37,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:37,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288149422] [2020-01-16 19:00:37,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:37,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288149422] [2020-01-16 19:00:37,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:37,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:37,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749039116] [2020-01-16 19:00:37,482 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:37,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:37,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:37,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:37,482 INFO L87 Difference]: Start difference. First operand 191 states and 562 transitions. Second operand 8 states. [2020-01-16 19:00:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:37,558 INFO L93 Difference]: Finished difference Result 321 states and 789 transitions. [2020-01-16 19:00:37,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:37,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:37,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:37,560 INFO L225 Difference]: With dead ends: 321 [2020-01-16 19:00:37,560 INFO L226 Difference]: Without dead ends: 305 [2020-01-16 19:00:37,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:37,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-01-16 19:00:37,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 194. [2020-01-16 19:00:37,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-01-16 19:00:37,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 566 transitions. [2020-01-16 19:00:37,564 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 566 transitions. Word has length 19 [2020-01-16 19:00:37,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:37,565 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 566 transitions. [2020-01-16 19:00:37,565 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:37,565 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 566 transitions. [2020-01-16 19:00:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:37,565 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:37,565 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:37,565 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 19:00:37,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:37,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1440049182, now seen corresponding path program 292 times [2020-01-16 19:00:37,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:37,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126646983] [2020-01-16 19:00:37,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:37,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126646983] [2020-01-16 19:00:37,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:37,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:37,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730771900] [2020-01-16 19:00:37,760 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:37,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:37,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:37,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:37,761 INFO L87 Difference]: Start difference. First operand 194 states and 566 transitions. Second operand 8 states. [2020-01-16 19:00:37,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:37,853 INFO L93 Difference]: Finished difference Result 315 states and 774 transitions. [2020-01-16 19:00:37,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:37,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:37,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:37,855 INFO L225 Difference]: With dead ends: 315 [2020-01-16 19:00:37,855 INFO L226 Difference]: Without dead ends: 302 [2020-01-16 19:00:37,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 19:00:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-01-16 19:00:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 191. [2020-01-16 19:00:37,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 19:00:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 559 transitions. [2020-01-16 19:00:37,860 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 559 transitions. Word has length 19 [2020-01-16 19:00:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:37,860 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 559 transitions. [2020-01-16 19:00:37,860 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 559 transitions. [2020-01-16 19:00:37,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:37,861 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:37,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:37,861 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 19:00:37,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:37,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2101207602, now seen corresponding path program 293 times [2020-01-16 19:00:37,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:37,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421293444] [2020-01-16 19:00:37,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:38,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421293444] [2020-01-16 19:00:38,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:38,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:38,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897440153] [2020-01-16 19:00:38,058 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:38,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:38,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:38,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:38,059 INFO L87 Difference]: Start difference. First operand 191 states and 559 transitions. Second operand 8 states. [2020-01-16 19:00:38,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:38,149 INFO L93 Difference]: Finished difference Result 316 states and 778 transitions. [2020-01-16 19:00:38,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:38,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:38,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:38,150 INFO L225 Difference]: With dead ends: 316 [2020-01-16 19:00:38,151 INFO L226 Difference]: Without dead ends: 302 [2020-01-16 19:00:38,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-01-16 19:00:38,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 193. [2020-01-16 19:00:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-01-16 19:00:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 562 transitions. [2020-01-16 19:00:38,156 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 562 transitions. Word has length 19 [2020-01-16 19:00:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:38,156 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 562 transitions. [2020-01-16 19:00:38,156 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 562 transitions. [2020-01-16 19:00:38,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:38,156 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:38,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 19:00:38,157 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 19:00:38,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:38,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1319424368, now seen corresponding path program 294 times [2020-01-16 19:00:38,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:38,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936163952] [2020-01-16 19:00:38,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:38,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936163952] [2020-01-16 19:00:38,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:38,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:38,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090204635] [2020-01-16 19:00:38,353 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:38,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:38,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:38,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:38,353 INFO L87 Difference]: Start difference. First operand 193 states and 562 transitions. Second operand 8 states. [2020-01-16 19:00:38,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:38,438 INFO L93 Difference]: Finished difference Result 312 states and 767 transitions. [2020-01-16 19:00:38,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:38,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:38,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:38,440 INFO L225 Difference]: With dead ends: 312 [2020-01-16 19:00:38,440 INFO L226 Difference]: Without dead ends: 296 [2020-01-16 19:00:38,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 19:00:38,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-01-16 19:00:38,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 187. [2020-01-16 19:00:38,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 19:00:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 551 transitions. [2020-01-16 19:00:38,445 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 551 transitions. Word has length 19 [2020-01-16 19:00:38,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:38,445 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 551 transitions. [2020-01-16 19:00:38,445 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 551 transitions. [2020-01-16 19:00:38,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:38,446 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:38,446 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:38,446 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 19:00:38,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:38,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1330278376, now seen corresponding path program 295 times [2020-01-16 19:00:38,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:38,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538977493] [2020-01-16 19:00:38,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:38,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538977493] [2020-01-16 19:00:38,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:38,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:38,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173630223] [2020-01-16 19:00:38,690 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:38,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:38,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:38,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:38,690 INFO L87 Difference]: Start difference. First operand 187 states and 551 transitions. Second operand 8 states. [2020-01-16 19:00:38,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:38,755 INFO L93 Difference]: Finished difference Result 318 states and 780 transitions. [2020-01-16 19:00:38,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:38,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:38,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:38,756 INFO L225 Difference]: With dead ends: 318 [2020-01-16 19:00:38,757 INFO L226 Difference]: Without dead ends: 302 [2020-01-16 19:00:38,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 19:00:38,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-01-16 19:00:38,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 199. [2020-01-16 19:00:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-01-16 19:00:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 577 transitions. [2020-01-16 19:00:38,762 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 577 transitions. Word has length 19 [2020-01-16 19:00:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:38,762 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 577 transitions. [2020-01-16 19:00:38,762 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 577 transitions. [2020-01-16 19:00:38,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:38,763 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:38,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 19:00:38,763 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 19:00:38,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:38,763 INFO L82 PathProgramCache]: Analyzing trace with hash -955627190, now seen corresponding path program 296 times [2020-01-16 19:00:38,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:38,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392826575] [2020-01-16 19:00:38,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:38,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 19:00:38,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392826575] [2020-01-16 19:00:38,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:38,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:38,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840494979] [2020-01-16 19:00:38,970 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:38,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:38,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:38,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:38,971 INFO L87 Difference]: Start difference. First operand 199 states and 577 transitions. Second operand 8 states. [2020-01-16 19:00:39,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:39,052 INFO L93 Difference]: Finished difference Result 316 states and 770 transitions. [2020-01-16 19:00:39,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:39,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:39,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:39,053 INFO L225 Difference]: With dead ends: 316 [2020-01-16 19:00:39,053 INFO L226 Difference]: Without dead ends: 294 [2020-01-16 19:00:39,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:39,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-01-16 19:00:39,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 191. [2020-01-16 19:00:39,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 19:00:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 559 transitions. [2020-01-16 19:00:39,059 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 559 transitions. Word has length 19 [2020-01-16 19:00:39,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:39,059 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 559 transitions. [2020-01-16 19:00:39,059 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 559 transitions. [2020-01-16 19:00:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:39,060 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:39,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 19:00:39,060 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 19:00:39,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:39,060 INFO L82 PathProgramCache]: Analyzing trace with hash -800081070, now seen corresponding path program 297 times [2020-01-16 19:00:39,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:39,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958961110] [2020-01-16 19:00:39,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:39,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958961110] [2020-01-16 19:00:39,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:39,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:39,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099064930] [2020-01-16 19:00:39,276 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:39,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:39,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:39,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:39,276 INFO L87 Difference]: Start difference. First operand 191 states and 559 transitions. Second operand 8 states. [2020-01-16 19:00:39,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:39,350 INFO L93 Difference]: Finished difference Result 301 states and 738 transitions. [2020-01-16 19:00:39,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:39,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:39,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:39,352 INFO L225 Difference]: With dead ends: 301 [2020-01-16 19:00:39,352 INFO L226 Difference]: Without dead ends: 285 [2020-01-16 19:00:39,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:39,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-01-16 19:00:39,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 194. [2020-01-16 19:00:39,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-01-16 19:00:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 563 transitions. [2020-01-16 19:00:39,357 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 563 transitions. Word has length 19 [2020-01-16 19:00:39,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:39,358 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 563 transitions. [2020-01-16 19:00:39,358 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:39,358 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 563 transitions. [2020-01-16 19:00:39,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:39,358 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:39,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 19:00:39,358 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 19:00:39,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:39,359 INFO L82 PathProgramCache]: Analyzing trace with hash -541022844, now seen corresponding path program 298 times [2020-01-16 19:00:39,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:39,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953995810] [2020-01-16 19:00:39,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:39,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 19:00:39,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953995810] [2020-01-16 19:00:39,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:39,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:39,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720646874] [2020-01-16 19:00:39,589 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:39,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:39,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:39,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:39,590 INFO L87 Difference]: Start difference. First operand 194 states and 563 transitions. Second operand 8 states. [2020-01-16 19:00:39,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:39,654 INFO L93 Difference]: Finished difference Result 286 states and 714 transitions. [2020-01-16 19:00:39,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:39,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:39,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:39,656 INFO L225 Difference]: With dead ends: 286 [2020-01-16 19:00:39,656 INFO L226 Difference]: Without dead ends: 273 [2020-01-16 19:00:39,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:39,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-01-16 19:00:39,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 191. [2020-01-16 19:00:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 19:00:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 556 transitions. [2020-01-16 19:00:39,661 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 556 transitions. Word has length 19 [2020-01-16 19:00:39,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:39,661 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 556 transitions. [2020-01-16 19:00:39,662 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 556 transitions. [2020-01-16 19:00:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:39,662 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:39,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 19:00:39,662 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 19:00:39,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:39,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1122224650, now seen corresponding path program 299 times [2020-01-16 19:00:39,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:39,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866105108] [2020-01-16 19:00:39,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:39,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 19:00:39,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866105108] [2020-01-16 19:00:39,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:39,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:39,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442136871] [2020-01-16 19:00:39,864 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:39,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:39,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:39,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:39,864 INFO L87 Difference]: Start difference. First operand 191 states and 556 transitions. Second operand 8 states. [2020-01-16 19:00:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:39,950 INFO L93 Difference]: Finished difference Result 298 states and 730 transitions. [2020-01-16 19:00:39,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:39,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:39,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:39,951 INFO L225 Difference]: With dead ends: 298 [2020-01-16 19:00:39,951 INFO L226 Difference]: Without dead ends: 284 [2020-01-16 19:00:39,952 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-01-16 19:00:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 193. [2020-01-16 19:00:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2020-01-16 19:00:39,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 559 transitions. [2020-01-16 19:00:39,956 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 559 transitions. Word has length 19 [2020-01-16 19:00:39,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:39,957 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 559 transitions. [2020-01-16 19:00:39,957 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 559 transitions. [2020-01-16 19:00:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:39,957 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:39,957 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:39,957 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 19:00:39,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:39,957 INFO L82 PathProgramCache]: Analyzing trace with hash -2052612816, now seen corresponding path program 300 times [2020-01-16 19:00:39,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:39,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473925048] [2020-01-16 19:00:39,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:40,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473925048] [2020-01-16 19:00:40,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:40,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:40,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569082627] [2020-01-16 19:00:40,167 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:40,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:40,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:40,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:40,167 INFO L87 Difference]: Start difference. First operand 193 states and 559 transitions. Second operand 8 states. [2020-01-16 19:00:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:40,239 INFO L93 Difference]: Finished difference Result 285 states and 710 transitions. [2020-01-16 19:00:40,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:40,239 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:40,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:40,240 INFO L225 Difference]: With dead ends: 285 [2020-01-16 19:00:40,240 INFO L226 Difference]: Without dead ends: 269 [2020-01-16 19:00:40,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:40,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-01-16 19:00:40,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 187. [2020-01-16 19:00:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 19:00:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 548 transitions. [2020-01-16 19:00:40,245 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 548 transitions. Word has length 19 [2020-01-16 19:00:40,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:40,245 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 548 transitions. [2020-01-16 19:00:40,245 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:40,245 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 548 transitions. [2020-01-16 19:00:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:40,245 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:40,246 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:40,246 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 19:00:40,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:40,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1446944266, now seen corresponding path program 301 times [2020-01-16 19:00:40,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:40,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353507189] [2020-01-16 19:00:40,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:40,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 19:00:40,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353507189] [2020-01-16 19:00:40,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:40,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:40,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893672193] [2020-01-16 19:00:40,446 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:40,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:40,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:40,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:40,446 INFO L87 Difference]: Start difference. First operand 187 states and 548 transitions. Second operand 8 states. [2020-01-16 19:00:40,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:40,523 INFO L93 Difference]: Finished difference Result 294 states and 721 transitions. [2020-01-16 19:00:40,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:40,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:40,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:40,524 INFO L225 Difference]: With dead ends: 294 [2020-01-16 19:00:40,524 INFO L226 Difference]: Without dead ends: 278 [2020-01-16 19:00:40,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:40,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-01-16 19:00:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 192. [2020-01-16 19:00:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 19:00:40,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 558 transitions. [2020-01-16 19:00:40,530 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 558 transitions. Word has length 19 [2020-01-16 19:00:40,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:40,530 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 558 transitions. [2020-01-16 19:00:40,530 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:40,530 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 558 transitions. [2020-01-16 19:00:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:40,530 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:40,531 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:40,531 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 19:00:40,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:40,531 INFO L82 PathProgramCache]: Analyzing trace with hash 696296484, now seen corresponding path program 302 times [2020-01-16 19:00:40,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:40,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534760826] [2020-01-16 19:00:40,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:40,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 19:00:40,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534760826] [2020-01-16 19:00:40,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:40,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:40,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051096122] [2020-01-16 19:00:40,720 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:40,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:40,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:40,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:40,720 INFO L87 Difference]: Start difference. First operand 192 states and 558 transitions. Second operand 8 states. [2020-01-16 19:00:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:40,815 INFO L93 Difference]: Finished difference Result 288 states and 706 transitions. [2020-01-16 19:00:40,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:40,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:40,816 INFO L225 Difference]: With dead ends: 288 [2020-01-16 19:00:40,816 INFO L226 Difference]: Without dead ends: 275 [2020-01-16 19:00:40,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:40,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-01-16 19:00:40,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 189. [2020-01-16 19:00:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 19:00:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 552 transitions. [2020-01-16 19:00:40,820 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 552 transitions. Word has length 19 [2020-01-16 19:00:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:40,820 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 552 transitions. [2020-01-16 19:00:40,821 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 552 transitions. [2020-01-16 19:00:40,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:40,821 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:40,821 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:40,821 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 19:00:40,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:40,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1247585176, now seen corresponding path program 303 times [2020-01-16 19:00:40,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:40,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043109345] [2020-01-16 19:00:40,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:41,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043109345] [2020-01-16 19:00:41,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:41,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:41,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844094618] [2020-01-16 19:00:41,020 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:41,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:41,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:41,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:41,021 INFO L87 Difference]: Start difference. First operand 189 states and 552 transitions. Second operand 8 states. [2020-01-16 19:00:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:41,107 INFO L93 Difference]: Finished difference Result 283 states and 697 transitions. [2020-01-16 19:00:41,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:41,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:41,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:41,108 INFO L225 Difference]: With dead ends: 283 [2020-01-16 19:00:41,108 INFO L226 Difference]: Without dead ends: 267 [2020-01-16 19:00:41,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-01-16 19:00:41,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 192. [2020-01-16 19:00:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 19:00:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 556 transitions. [2020-01-16 19:00:41,113 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 556 transitions. Word has length 19 [2020-01-16 19:00:41,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:41,113 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 556 transitions. [2020-01-16 19:00:41,113 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 556 transitions. [2020-01-16 19:00:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:41,113 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:41,113 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:41,114 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 19:00:41,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:41,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1506643402, now seen corresponding path program 304 times [2020-01-16 19:00:41,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:41,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043991804] [2020-01-16 19:00:41,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:41,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 19:00:41,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043991804] [2020-01-16 19:00:41,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:41,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:41,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300382698] [2020-01-16 19:00:41,321 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:41,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:41,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:41,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:41,322 INFO L87 Difference]: Start difference. First operand 192 states and 556 transitions. Second operand 8 states. [2020-01-16 19:00:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:41,386 INFO L93 Difference]: Finished difference Result 268 states and 673 transitions. [2020-01-16 19:00:41,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:41,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:41,387 INFO L225 Difference]: With dead ends: 268 [2020-01-16 19:00:41,387 INFO L226 Difference]: Without dead ends: 255 [2020-01-16 19:00:41,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:41,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-01-16 19:00:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 189. [2020-01-16 19:00:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 19:00:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 550 transitions. [2020-01-16 19:00:41,393 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 550 transitions. Word has length 19 [2020-01-16 19:00:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:41,393 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 550 transitions. [2020-01-16 19:00:41,393 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 550 transitions. [2020-01-16 19:00:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:41,394 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:41,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:41,394 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 19:00:41,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:41,394 INFO L82 PathProgramCache]: Analyzing trace with hash 266205080, now seen corresponding path program 305 times [2020-01-16 19:00:41,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:41,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283200125] [2020-01-16 19:00:41,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:41,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 19:00:41,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283200125] [2020-01-16 19:00:41,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:41,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:41,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313961239] [2020-01-16 19:00:41,602 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:41,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:41,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:41,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:41,602 INFO L87 Difference]: Start difference. First operand 189 states and 550 transitions. Second operand 8 states. [2020-01-16 19:00:41,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:41,681 INFO L93 Difference]: Finished difference Result 266 states and 669 transitions. [2020-01-16 19:00:41,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:41,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:41,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:41,683 INFO L225 Difference]: With dead ends: 266 [2020-01-16 19:00:41,683 INFO L226 Difference]: Without dead ends: 256 [2020-01-16 19:00:41,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-01-16 19:00:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 190. [2020-01-16 19:00:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-01-16 19:00:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 551 transitions. [2020-01-16 19:00:41,688 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 551 transitions. Word has length 19 [2020-01-16 19:00:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:41,688 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 551 transitions. [2020-01-16 19:00:41,688 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:41,688 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 551 transitions. [2020-01-16 19:00:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:41,689 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:41,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 19:00:41,689 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 19:00:41,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:41,689 INFO L82 PathProgramCache]: Analyzing trace with hash 26562742, now seen corresponding path program 306 times [2020-01-16 19:00:41,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:41,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185283301] [2020-01-16 19:00:41,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:41,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 19:00:41,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185283301] [2020-01-16 19:00:41,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:41,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:41,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346564399] [2020-01-16 19:00:41,930 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:41,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:41,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:41,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:41,930 INFO L87 Difference]: Start difference. First operand 190 states and 551 transitions. Second operand 8 states. [2020-01-16 19:00:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:41,989 INFO L93 Difference]: Finished difference Result 255 states and 656 transitions. [2020-01-16 19:00:41,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:41,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:41,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:41,990 INFO L225 Difference]: With dead ends: 255 [2020-01-16 19:00:41,990 INFO L226 Difference]: Without dead ends: 242 [2020-01-16 19:00:41,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 19:00:41,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-01-16 19:00:41,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 187. [2020-01-16 19:00:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 19:00:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 546 transitions. [2020-01-16 19:00:41,994 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 546 transitions. Word has length 19 [2020-01-16 19:00:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:41,994 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 546 transitions. [2020-01-16 19:00:41,994 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 546 transitions. [2020-01-16 19:00:41,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:41,995 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:41,995 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:41,995 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 19:00:41,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:41,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1887873640, now seen corresponding path program 307 times [2020-01-16 19:00:41,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:41,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881222627] [2020-01-16 19:00:41,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:42,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 19:00:42,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881222627] [2020-01-16 19:00:42,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:42,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:42,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931015553] [2020-01-16 19:00:42,184 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:42,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:42,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:42,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:42,185 INFO L87 Difference]: Start difference. First operand 187 states and 546 transitions. Second operand 8 states. [2020-01-16 19:00:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:42,269 INFO L93 Difference]: Finished difference Result 287 states and 706 transitions. [2020-01-16 19:00:42,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:42,270 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:42,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:42,271 INFO L225 Difference]: With dead ends: 287 [2020-01-16 19:00:42,271 INFO L226 Difference]: Without dead ends: 273 [2020-01-16 19:00:42,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-01-16 19:00:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 190. [2020-01-16 19:00:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-01-16 19:00:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 552 transitions. [2020-01-16 19:00:42,275 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 552 transitions. Word has length 19 [2020-01-16 19:00:42,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:42,275 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 552 transitions. [2020-01-16 19:00:42,275 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 552 transitions. [2020-01-16 19:00:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:42,276 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:42,276 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:42,276 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 19:00:42,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:42,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1013538314, now seen corresponding path program 308 times [2020-01-16 19:00:42,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:42,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630189396] [2020-01-16 19:00:42,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:42,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630189396] [2020-01-16 19:00:42,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:42,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:42,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076050247] [2020-01-16 19:00:42,478 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:42,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:42,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:42,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:42,478 INFO L87 Difference]: Start difference. First operand 190 states and 552 transitions. Second operand 8 states. [2020-01-16 19:00:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:42,566 INFO L93 Difference]: Finished difference Result 283 states and 695 transitions. [2020-01-16 19:00:42,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:42,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:42,568 INFO L225 Difference]: With dead ends: 283 [2020-01-16 19:00:42,568 INFO L226 Difference]: Without dead ends: 271 [2020-01-16 19:00:42,568 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:42,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-01-16 19:00:42,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 188. [2020-01-16 19:00:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 19:00:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 548 transitions. [2020-01-16 19:00:42,572 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 548 transitions. Word has length 19 [2020-01-16 19:00:42,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:42,572 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 548 transitions. [2020-01-16 19:00:42,572 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 548 transitions. [2020-01-16 19:00:42,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:42,573 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:42,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 19:00:42,573 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 19:00:42,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:42,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1246071542, now seen corresponding path program 309 times [2020-01-16 19:00:42,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:42,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096074161] [2020-01-16 19:00:42,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:42,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096074161] [2020-01-16 19:00:42,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:42,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:42,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712870848] [2020-01-16 19:00:42,771 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:42,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:42,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:42,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:42,771 INFO L87 Difference]: Start difference. First operand 188 states and 548 transitions. Second operand 8 states. [2020-01-16 19:00:42,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:42,849 INFO L93 Difference]: Finished difference Result 279 states and 688 transitions. [2020-01-16 19:00:42,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:42,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:42,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:42,851 INFO L225 Difference]: With dead ends: 279 [2020-01-16 19:00:42,851 INFO L226 Difference]: Without dead ends: 265 [2020-01-16 19:00:42,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 19:00:42,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-01-16 19:00:42,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 190. [2020-01-16 19:00:42,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-01-16 19:00:42,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 551 transitions. [2020-01-16 19:00:42,855 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 551 transitions. Word has length 19 [2020-01-16 19:00:42,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:42,855 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 551 transitions. [2020-01-16 19:00:42,855 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 551 transitions. [2020-01-16 19:00:42,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:42,855 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:42,856 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:42,856 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 19:00:42,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:42,856 INFO L82 PathProgramCache]: Analyzing trace with hash -125941712, now seen corresponding path program 310 times [2020-01-16 19:00:42,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:42,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603441385] [2020-01-16 19:00:42,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:43,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603441385] [2020-01-16 19:00:43,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:43,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:43,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668301910] [2020-01-16 19:00:43,061 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:43,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:43,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:43,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:43,062 INFO L87 Difference]: Start difference. First operand 190 states and 551 transitions. Second operand 8 states. [2020-01-16 19:00:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:43,125 INFO L93 Difference]: Finished difference Result 266 states and 668 transitions. [2020-01-16 19:00:43,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:43,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:43,127 INFO L225 Difference]: With dead ends: 266 [2020-01-16 19:00:43,127 INFO L226 Difference]: Without dead ends: 254 [2020-01-16 19:00:43,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 19:00:43,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-01-16 19:00:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 188. [2020-01-16 19:00:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 19:00:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 547 transitions. [2020-01-16 19:00:43,132 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 547 transitions. Word has length 19 [2020-01-16 19:00:43,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:43,132 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 547 transitions. [2020-01-16 19:00:43,132 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 547 transitions. [2020-01-16 19:00:43,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:43,132 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:43,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 19:00:43,133 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 19:00:43,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:43,133 INFO L82 PathProgramCache]: Analyzing trace with hash 651556204, now seen corresponding path program 311 times [2020-01-16 19:00:43,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:43,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307269577] [2020-01-16 19:00:43,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:43,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307269577] [2020-01-16 19:00:43,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:43,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:43,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932302271] [2020-01-16 19:00:43,341 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:43,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:43,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:43,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:43,342 INFO L87 Difference]: Start difference. First operand 188 states and 547 transitions. Second operand 8 states. [2020-01-16 19:00:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:43,430 INFO L93 Difference]: Finished difference Result 265 states and 666 transitions. [2020-01-16 19:00:43,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:43,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:43,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:43,431 INFO L225 Difference]: With dead ends: 265 [2020-01-16 19:00:43,431 INFO L226 Difference]: Without dead ends: 255 [2020-01-16 19:00:43,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 19:00:43,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-01-16 19:00:43,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 189. [2020-01-16 19:00:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 19:00:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 548 transitions. [2020-01-16 19:00:43,435 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 548 transitions. Word has length 19 [2020-01-16 19:00:43,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:43,435 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 548 transitions. [2020-01-16 19:00:43,435 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:43,435 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 548 transitions. [2020-01-16 19:00:43,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:43,436 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:43,436 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:43,436 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 19:00:43,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:43,436 INFO L82 PathProgramCache]: Analyzing trace with hash 411913866, now seen corresponding path program 312 times [2020-01-16 19:00:43,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:43,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841823331] [2020-01-16 19:00:43,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:43,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841823331] [2020-01-16 19:00:43,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:43,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:43,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340004338] [2020-01-16 19:00:43,649 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:43,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:43,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:43,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:43,649 INFO L87 Difference]: Start difference. First operand 189 states and 548 transitions. Second operand 8 states. [2020-01-16 19:00:43,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:43,725 INFO L93 Difference]: Finished difference Result 254 states and 653 transitions. [2020-01-16 19:00:43,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:43,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:43,726 INFO L225 Difference]: With dead ends: 254 [2020-01-16 19:00:43,726 INFO L226 Difference]: Without dead ends: 239 [2020-01-16 19:00:43,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:43,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-01-16 19:00:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 184. [2020-01-16 19:00:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-01-16 19:00:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 540 transitions. [2020-01-16 19:00:43,730 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 540 transitions. Word has length 19 [2020-01-16 19:00:43,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:43,730 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 540 transitions. [2020-01-16 19:00:43,730 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 540 transitions. [2020-01-16 19:00:43,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:43,731 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:43,731 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:43,731 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 19:00:43,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:43,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2756816, now seen corresponding path program 313 times [2020-01-16 19:00:43,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:43,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271615303] [2020-01-16 19:00:43,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:43,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 19:00:43,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271615303] [2020-01-16 19:00:43,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:43,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:43,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98045497] [2020-01-16 19:00:43,939 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:43,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:43,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:43,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:43,939 INFO L87 Difference]: Start difference. First operand 184 states and 540 transitions. Second operand 8 states. [2020-01-16 19:00:44,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:44,004 INFO L93 Difference]: Finished difference Result 315 states and 778 transitions. [2020-01-16 19:00:44,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:44,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:44,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:44,005 INFO L225 Difference]: With dead ends: 315 [2020-01-16 19:00:44,005 INFO L226 Difference]: Without dead ends: 299 [2020-01-16 19:00:44,005 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:44,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-01-16 19:00:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 191. [2020-01-16 19:00:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 19:00:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 558 transitions. [2020-01-16 19:00:44,009 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 558 transitions. Word has length 19 [2020-01-16 19:00:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:44,009 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 558 transitions. [2020-01-16 19:00:44,010 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 558 transitions. [2020-01-16 19:00:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:44,010 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:44,010 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:44,010 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 19:00:44,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:44,010 INFO L82 PathProgramCache]: Analyzing trace with hash 2140483934, now seen corresponding path program 314 times [2020-01-16 19:00:44,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:44,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943764597] [2020-01-16 19:00:44,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:44,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943764597] [2020-01-16 19:00:44,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:44,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:44,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611015159] [2020-01-16 19:00:44,217 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:44,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:44,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:44,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:44,217 INFO L87 Difference]: Start difference. First operand 191 states and 558 transitions. Second operand 8 states. [2020-01-16 19:00:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:44,312 INFO L93 Difference]: Finished difference Result 309 states and 763 transitions. [2020-01-16 19:00:44,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:44,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:44,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:44,313 INFO L225 Difference]: With dead ends: 309 [2020-01-16 19:00:44,313 INFO L226 Difference]: Without dead ends: 296 [2020-01-16 19:00:44,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 19:00:44,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-01-16 19:00:44,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 188. [2020-01-16 19:00:44,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 19:00:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 552 transitions. [2020-01-16 19:00:44,318 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 552 transitions. Word has length 19 [2020-01-16 19:00:44,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:44,319 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 552 transitions. [2020-01-16 19:00:44,319 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:44,319 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 552 transitions. [2020-01-16 19:00:44,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:44,319 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:44,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 19:00:44,319 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 19:00:44,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:44,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1603194670, now seen corresponding path program 315 times [2020-01-16 19:00:44,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:44,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111862400] [2020-01-16 19:00:44,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:44,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111862400] [2020-01-16 19:00:44,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:44,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:44,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108659549] [2020-01-16 19:00:44,521 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:44,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:44,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:44,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:44,522 INFO L87 Difference]: Start difference. First operand 188 states and 552 transitions. Second operand 8 states. [2020-01-16 19:00:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:44,587 INFO L93 Difference]: Finished difference Result 315 states and 776 transitions. [2020-01-16 19:00:44,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:44,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:44,588 INFO L225 Difference]: With dead ends: 315 [2020-01-16 19:00:44,588 INFO L226 Difference]: Without dead ends: 299 [2020-01-16 19:00:44,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-01-16 19:00:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 191. [2020-01-16 19:00:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 19:00:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 556 transitions. [2020-01-16 19:00:44,593 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 556 transitions. Word has length 19 [2020-01-16 19:00:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:44,593 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 556 transitions. [2020-01-16 19:00:44,593 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:44,594 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 556 transitions. [2020-01-16 19:00:44,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:44,594 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:44,594 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:44,594 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 19:00:44,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:44,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1344136444, now seen corresponding path program 316 times [2020-01-16 19:00:44,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:44,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597364179] [2020-01-16 19:00:44,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:44,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 19:00:44,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597364179] [2020-01-16 19:00:44,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:44,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:44,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422905609] [2020-01-16 19:00:44,798 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:44,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:44,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:44,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:44,799 INFO L87 Difference]: Start difference. First operand 191 states and 556 transitions. Second operand 8 states. [2020-01-16 19:00:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:44,870 INFO L93 Difference]: Finished difference Result 309 states and 761 transitions. [2020-01-16 19:00:44,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:44,870 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:44,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:44,871 INFO L225 Difference]: With dead ends: 309 [2020-01-16 19:00:44,871 INFO L226 Difference]: Without dead ends: 296 [2020-01-16 19:00:44,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:44,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-01-16 19:00:44,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 188. [2020-01-16 19:00:44,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 19:00:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 550 transitions. [2020-01-16 19:00:44,876 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 550 transitions. Word has length 19 [2020-01-16 19:00:44,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:44,876 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 550 transitions. [2020-01-16 19:00:44,876 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:44,876 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 550 transitions. [2020-01-16 19:00:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:44,877 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:44,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 19:00:44,877 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 19:00:44,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:44,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1710392530, now seen corresponding path program 317 times [2020-01-16 19:00:44,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:44,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895693725] [2020-01-16 19:00:44,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:45,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895693725] [2020-01-16 19:00:45,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:45,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:45,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376154948] [2020-01-16 19:00:45,086 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:45,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:45,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:45,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:45,086 INFO L87 Difference]: Start difference. First operand 188 states and 550 transitions. Second operand 8 states. [2020-01-16 19:00:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:45,186 INFO L93 Difference]: Finished difference Result 301 states and 745 transitions. [2020-01-16 19:00:45,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:45,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:45,187 INFO L225 Difference]: With dead ends: 301 [2020-01-16 19:00:45,187 INFO L226 Difference]: Without dead ends: 291 [2020-01-16 19:00:45,187 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:45,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-01-16 19:00:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 189. [2020-01-16 19:00:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 19:00:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 551 transitions. [2020-01-16 19:00:45,192 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 551 transitions. Word has length 19 [2020-01-16 19:00:45,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:45,193 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 551 transitions. [2020-01-16 19:00:45,193 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:45,193 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 551 transitions. [2020-01-16 19:00:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:45,193 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:45,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 19:00:45,193 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 19:00:45,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:45,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1470750192, now seen corresponding path program 318 times [2020-01-16 19:00:45,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:45,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729888099] [2020-01-16 19:00:45,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:45,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729888099] [2020-01-16 19:00:45,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:45,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:45,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798995024] [2020-01-16 19:00:45,410 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:45,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:45,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:45,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:45,410 INFO L87 Difference]: Start difference. First operand 189 states and 551 transitions. Second operand 8 states. [2020-01-16 19:00:45,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:45,484 INFO L93 Difference]: Finished difference Result 301 states and 744 transitions. [2020-01-16 19:00:45,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:45,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:45,485 INFO L225 Difference]: With dead ends: 301 [2020-01-16 19:00:45,485 INFO L226 Difference]: Without dead ends: 288 [2020-01-16 19:00:45,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 19:00:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-01-16 19:00:45,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 186. [2020-01-16 19:00:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 19:00:45,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 546 transitions. [2020-01-16 19:00:45,490 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 546 transitions. Word has length 19 [2020-01-16 19:00:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:45,490 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 546 transitions. [2020-01-16 19:00:45,490 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 546 transitions. [2020-01-16 19:00:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:45,491 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:45,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 19:00:45,491 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 19:00:45,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:45,491 INFO L82 PathProgramCache]: Analyzing trace with hash -445655956, now seen corresponding path program 319 times [2020-01-16 19:00:45,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:45,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303009356] [2020-01-16 19:00:45,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:45,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 19:00:45,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303009356] [2020-01-16 19:00:45,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:45,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:45,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79777043] [2020-01-16 19:00:45,678 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:45,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:45,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:45,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:45,679 INFO L87 Difference]: Start difference. First operand 186 states and 546 transitions. Second operand 8 states. [2020-01-16 19:00:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:45,741 INFO L93 Difference]: Finished difference Result 314 states and 773 transitions. [2020-01-16 19:00:45,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:45,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:45,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:45,742 INFO L225 Difference]: With dead ends: 314 [2020-01-16 19:00:45,742 INFO L226 Difference]: Without dead ends: 298 [2020-01-16 19:00:45,742 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 19:00:45,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-01-16 19:00:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 192. [2020-01-16 19:00:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 19:00:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 560 transitions. [2020-01-16 19:00:45,746 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 560 transitions. Word has length 19 [2020-01-16 19:00:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:45,746 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 560 transitions. [2020-01-16 19:00:45,746 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 560 transitions. [2020-01-16 19:00:45,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:45,747 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:45,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 19:00:45,747 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 19:00:45,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:45,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1697584794, now seen corresponding path program 320 times [2020-01-16 19:00:45,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:45,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612821664] [2020-01-16 19:00:45,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:45,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612821664] [2020-01-16 19:00:45,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:45,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:45,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478818058] [2020-01-16 19:00:45,927 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:45,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:45,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:45,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:45,927 INFO L87 Difference]: Start difference. First operand 192 states and 560 transitions. Second operand 8 states. [2020-01-16 19:00:46,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:46,028 INFO L93 Difference]: Finished difference Result 308 states and 758 transitions. [2020-01-16 19:00:46,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:46,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:46,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:46,030 INFO L225 Difference]: With dead ends: 308 [2020-01-16 19:00:46,030 INFO L226 Difference]: Without dead ends: 295 [2020-01-16 19:00:46,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-01-16 19:00:46,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 189. [2020-01-16 19:00:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 19:00:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 553 transitions. [2020-01-16 19:00:46,034 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 553 transitions. Word has length 19 [2020-01-16 19:00:46,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:46,034 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 553 transitions. [2020-01-16 19:00:46,034 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:46,035 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 553 transitions. [2020-01-16 19:00:46,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:46,035 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:46,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 19:00:46,035 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 19:00:46,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:46,035 INFO L82 PathProgramCache]: Analyzing trace with hash -952002222, now seen corresponding path program 321 times [2020-01-16 19:00:46,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:46,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393398113] [2020-01-16 19:00:46,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:46,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393398113] [2020-01-16 19:00:46,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:46,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:46,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990189184] [2020-01-16 19:00:46,232 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:46,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:46,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:46,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:46,233 INFO L87 Difference]: Start difference. First operand 189 states and 553 transitions. Second operand 8 states. [2020-01-16 19:00:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:46,312 INFO L93 Difference]: Finished difference Result 320 states and 787 transitions. [2020-01-16 19:00:46,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:46,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:46,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:46,313 INFO L225 Difference]: With dead ends: 320 [2020-01-16 19:00:46,313 INFO L226 Difference]: Without dead ends: 304 [2020-01-16 19:00:46,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 19:00:46,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-01-16 19:00:46,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 195. [2020-01-16 19:00:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-01-16 19:00:46,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 564 transitions. [2020-01-16 19:00:46,317 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 564 transitions. Word has length 19 [2020-01-16 19:00:46,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:46,318 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 564 transitions. [2020-01-16 19:00:46,318 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:46,318 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 564 transitions. [2020-01-16 19:00:46,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:46,318 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:46,318 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:46,318 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 19:00:46,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:46,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1928206972, now seen corresponding path program 322 times [2020-01-16 19:00:46,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:46,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860155063] [2020-01-16 19:00:46,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:46,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 19:00:46,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860155063] [2020-01-16 19:00:46,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:46,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:46,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423456418] [2020-01-16 19:00:46,507 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:46,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:46,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:46,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:46,508 INFO L87 Difference]: Start difference. First operand 195 states and 564 transitions. Second operand 8 states. [2020-01-16 19:00:46,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:46,608 INFO L93 Difference]: Finished difference Result 317 states and 776 transitions. [2020-01-16 19:00:46,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:46,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:46,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:46,610 INFO L225 Difference]: With dead ends: 317 [2020-01-16 19:00:46,610 INFO L226 Difference]: Without dead ends: 298 [2020-01-16 19:00:46,610 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:46,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-01-16 19:00:46,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 189. [2020-01-16 19:00:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 19:00:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 550 transitions. [2020-01-16 19:00:46,615 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 550 transitions. Word has length 19 [2020-01-16 19:00:46,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:46,615 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 550 transitions. [2020-01-16 19:00:46,615 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 550 transitions. [2020-01-16 19:00:46,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:46,616 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:46,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 19:00:46,616 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 19:00:46,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:46,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1813226296, now seen corresponding path program 323 times [2020-01-16 19:00:46,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:46,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614436926] [2020-01-16 19:00:46,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:46,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 19:00:46,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614436926] [2020-01-16 19:00:46,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:46,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:46,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075882229] [2020-01-16 19:00:46,806 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:46,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:46,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:46,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:46,807 INFO L87 Difference]: Start difference. First operand 189 states and 550 transitions. Second operand 8 states. [2020-01-16 19:00:46,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:46,897 INFO L93 Difference]: Finished difference Result 304 states and 748 transitions. [2020-01-16 19:00:46,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:46,898 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:46,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:46,899 INFO L225 Difference]: With dead ends: 304 [2020-01-16 19:00:46,899 INFO L226 Difference]: Without dead ends: 294 [2020-01-16 19:00:46,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 19:00:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-01-16 19:00:46,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 191. [2020-01-16 19:00:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 19:00:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 553 transitions. [2020-01-16 19:00:46,904 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 553 transitions. Word has length 19 [2020-01-16 19:00:46,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:46,904 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 553 transitions. [2020-01-16 19:00:46,904 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 553 transitions. [2020-01-16 19:00:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:46,905 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:46,905 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:46,905 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 19:00:46,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:46,905 INFO L82 PathProgramCache]: Analyzing trace with hash 84178962, now seen corresponding path program 324 times [2020-01-16 19:00:46,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:46,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776055856] [2020-01-16 19:00:46,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:47,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 19:00:47,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776055856] [2020-01-16 19:00:47,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:47,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:47,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489086807] [2020-01-16 19:00:47,144 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:47,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:47,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:47,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:47,144 INFO L87 Difference]: Start difference. First operand 191 states and 553 transitions. Second operand 8 states. [2020-01-16 19:00:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:47,259 INFO L93 Difference]: Finished difference Result 307 states and 753 transitions. [2020-01-16 19:00:47,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:47,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:47,260 INFO L225 Difference]: With dead ends: 307 [2020-01-16 19:00:47,260 INFO L226 Difference]: Without dead ends: 289 [2020-01-16 19:00:47,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:47,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-01-16 19:00:47,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 186. [2020-01-16 19:00:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 19:00:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 544 transitions. [2020-01-16 19:00:47,265 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 544 transitions. Word has length 19 [2020-01-16 19:00:47,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:47,265 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 544 transitions. [2020-01-16 19:00:47,265 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:47,265 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 544 transitions. [2020-01-16 19:00:47,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:47,266 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:47,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 19:00:47,266 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 19:00:47,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:47,267 INFO L82 PathProgramCache]: Analyzing trace with hash -120059732, now seen corresponding path program 325 times [2020-01-16 19:00:47,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:47,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789971332] [2020-01-16 19:00:47,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:47,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 19:00:47,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789971332] [2020-01-16 19:00:47,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:47,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:47,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739739151] [2020-01-16 19:00:47,465 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:47,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:47,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:47,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:47,466 INFO L87 Difference]: Start difference. First operand 186 states and 544 transitions. Second operand 8 states. [2020-01-16 19:00:47,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:47,531 INFO L93 Difference]: Finished difference Result 311 states and 761 transitions. [2020-01-16 19:00:47,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:47,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:47,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:47,532 INFO L225 Difference]: With dead ends: 311 [2020-01-16 19:00:47,532 INFO L226 Difference]: Without dead ends: 295 [2020-01-16 19:00:47,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 19:00:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-01-16 19:00:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 192. [2020-01-16 19:00:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 19:00:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 558 transitions. [2020-01-16 19:00:47,537 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 558 transitions. Word has length 19 [2020-01-16 19:00:47,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:47,537 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 558 transitions. [2020-01-16 19:00:47,537 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 558 transitions. [2020-01-16 19:00:47,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:47,537 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:47,537 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:47,537 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 19:00:47,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:47,538 INFO L82 PathProgramCache]: Analyzing trace with hash 138998494, now seen corresponding path program 326 times [2020-01-16 19:00:47,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:47,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977909837] [2020-01-16 19:00:47,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:47,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977909837] [2020-01-16 19:00:47,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:47,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:47,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552908264] [2020-01-16 19:00:47,743 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:47,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:47,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:47,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:47,744 INFO L87 Difference]: Start difference. First operand 192 states and 558 transitions. Second operand 8 states. [2020-01-16 19:00:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:47,817 INFO L93 Difference]: Finished difference Result 305 states and 746 transitions. [2020-01-16 19:00:47,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:47,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:47,819 INFO L225 Difference]: With dead ends: 305 [2020-01-16 19:00:47,819 INFO L226 Difference]: Without dead ends: 292 [2020-01-16 19:00:47,819 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:47,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-01-16 19:00:47,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 189. [2020-01-16 19:00:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 19:00:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 551 transitions. [2020-01-16 19:00:47,823 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 551 transitions. Word has length 19 [2020-01-16 19:00:47,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:47,823 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 551 transitions. [2020-01-16 19:00:47,823 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 551 transitions. [2020-01-16 19:00:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:47,824 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:47,824 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:47,824 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 19:00:47,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:47,824 INFO L82 PathProgramCache]: Analyzing trace with hash 974031856, now seen corresponding path program 327 times [2020-01-16 19:00:47,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:47,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218196317] [2020-01-16 19:00:47,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:48,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218196317] [2020-01-16 19:00:48,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:48,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:48,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264777572] [2020-01-16 19:00:48,029 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:48,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:48,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:48,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:48,030 INFO L87 Difference]: Start difference. First operand 189 states and 551 transitions. Second operand 8 states. [2020-01-16 19:00:48,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:48,109 INFO L93 Difference]: Finished difference Result 311 states and 758 transitions. [2020-01-16 19:00:48,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:48,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:48,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:48,111 INFO L225 Difference]: With dead ends: 311 [2020-01-16 19:00:48,111 INFO L226 Difference]: Without dead ends: 295 [2020-01-16 19:00:48,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 19:00:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-01-16 19:00:48,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 195. [2020-01-16 19:00:48,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-01-16 19:00:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 562 transitions. [2020-01-16 19:00:48,116 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 562 transitions. Word has length 19 [2020-01-16 19:00:48,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:48,116 INFO L478 AbstractCegarLoop]: Abstraction has 195 states and 562 transitions. [2020-01-16 19:00:48,116 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 562 transitions. [2020-01-16 19:00:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:48,116 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:48,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 19:00:48,117 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 19:00:48,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:48,117 INFO L82 PathProgramCache]: Analyzing trace with hash -2172894, now seen corresponding path program 328 times [2020-01-16 19:00:48,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:48,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775052587] [2020-01-16 19:00:48,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:48,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 19:00:48,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775052587] [2020-01-16 19:00:48,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:48,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:48,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983480563] [2020-01-16 19:00:48,316 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:48,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:48,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:48,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:48,317 INFO L87 Difference]: Start difference. First operand 195 states and 562 transitions. Second operand 8 states. [2020-01-16 19:00:48,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:48,411 INFO L93 Difference]: Finished difference Result 308 states and 747 transitions. [2020-01-16 19:00:48,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:48,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:48,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:48,413 INFO L225 Difference]: With dead ends: 308 [2020-01-16 19:00:48,413 INFO L226 Difference]: Without dead ends: 289 [2020-01-16 19:00:48,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 19:00:48,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-01-16 19:00:48,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 189. [2020-01-16 19:00:48,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 19:00:48,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 548 transitions. [2020-01-16 19:00:48,418 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 548 transitions. Word has length 19 [2020-01-16 19:00:48,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:48,418 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 548 transitions. [2020-01-16 19:00:48,418 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:48,418 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 548 transitions. [2020-01-16 19:00:48,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:48,418 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:48,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:48,419 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 19:00:48,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:48,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1309572854, now seen corresponding path program 329 times [2020-01-16 19:00:48,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:48,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665165977] [2020-01-16 19:00:48,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:48,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 19:00:48,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665165977] [2020-01-16 19:00:48,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:48,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:48,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973262572] [2020-01-16 19:00:48,620 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:48,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:48,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:48,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:48,620 INFO L87 Difference]: Start difference. First operand 189 states and 548 transitions. Second operand 8 states. [2020-01-16 19:00:48,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:48,695 INFO L93 Difference]: Finished difference Result 295 states and 719 transitions. [2020-01-16 19:00:48,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:48,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:48,696 INFO L225 Difference]: With dead ends: 295 [2020-01-16 19:00:48,696 INFO L226 Difference]: Without dead ends: 285 [2020-01-16 19:00:48,697 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:48,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-01-16 19:00:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 191. [2020-01-16 19:00:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-01-16 19:00:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 551 transitions. [2020-01-16 19:00:48,701 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 551 transitions. Word has length 19 [2020-01-16 19:00:48,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:48,701 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 551 transitions. [2020-01-16 19:00:48,701 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 551 transitions. [2020-01-16 19:00:48,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:48,702 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:48,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:48,702 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 19:00:48,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:48,702 INFO L82 PathProgramCache]: Analyzing trace with hash 179832142, now seen corresponding path program 330 times [2020-01-16 19:00:48,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:48,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913765202] [2020-01-16 19:00:48,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:48,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 19:00:48,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913765202] [2020-01-16 19:00:48,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:48,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:48,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038799363] [2020-01-16 19:00:48,895 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:48,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:48,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:48,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:48,896 INFO L87 Difference]: Start difference. First operand 191 states and 551 transitions. Second operand 8 states. [2020-01-16 19:00:48,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:48,984 INFO L93 Difference]: Finished difference Result 293 states and 714 transitions. [2020-01-16 19:00:48,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:48,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:48,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:48,985 INFO L225 Difference]: With dead ends: 293 [2020-01-16 19:00:48,985 INFO L226 Difference]: Without dead ends: 275 [2020-01-16 19:00:48,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:48,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-01-16 19:00:48,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 186. [2020-01-16 19:00:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 19:00:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 542 transitions. [2020-01-16 19:00:48,989 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 542 transitions. Word has length 19 [2020-01-16 19:00:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:48,989 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 542 transitions. [2020-01-16 19:00:48,990 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 542 transitions. [2020-01-16 19:00:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:48,990 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:48,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 19:00:48,990 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 19:00:48,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:48,990 INFO L82 PathProgramCache]: Analyzing trace with hash -245646298, now seen corresponding path program 331 times [2020-01-16 19:00:48,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:48,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239243830] [2020-01-16 19:00:48,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:49,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 19:00:49,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239243830] [2020-01-16 19:00:49,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:49,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:49,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850721571] [2020-01-16 19:00:49,197 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:49,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:49,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:49,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:49,197 INFO L87 Difference]: Start difference. First operand 186 states and 542 transitions. Second operand 8 states. [2020-01-16 19:00:49,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:49,290 INFO L93 Difference]: Finished difference Result 283 states and 694 transitions. [2020-01-16 19:00:49,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:49,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:49,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:49,291 INFO L225 Difference]: With dead ends: 283 [2020-01-16 19:00:49,292 INFO L226 Difference]: Without dead ends: 273 [2020-01-16 19:00:49,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-01-16 19:00:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 188. [2020-01-16 19:00:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 19:00:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 546 transitions. [2020-01-16 19:00:49,296 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 546 transitions. Word has length 19 [2020-01-16 19:00:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:49,297 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 546 transitions. [2020-01-16 19:00:49,297 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:49,297 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 546 transitions. [2020-01-16 19:00:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:49,297 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:49,297 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:49,297 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 19:00:49,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:49,298 INFO L82 PathProgramCache]: Analyzing trace with hash -485288636, now seen corresponding path program 332 times [2020-01-16 19:00:49,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:49,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474834116] [2020-01-16 19:00:49,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:49,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 19:00:49,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474834116] [2020-01-16 19:00:49,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:49,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:49,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404256460] [2020-01-16 19:00:49,511 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:49,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:49,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:49,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:49,511 INFO L87 Difference]: Start difference. First operand 188 states and 546 transitions. Second operand 8 states. [2020-01-16 19:00:49,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:49,578 INFO L93 Difference]: Finished difference Result 283 states and 693 transitions. [2020-01-16 19:00:49,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:49,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:49,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:49,580 INFO L225 Difference]: With dead ends: 283 [2020-01-16 19:00:49,580 INFO L226 Difference]: Without dead ends: 272 [2020-01-16 19:00:49,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:49,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-01-16 19:00:49,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 187. [2020-01-16 19:00:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 19:00:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 544 transitions. [2020-01-16 19:00:49,585 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 544 transitions. Word has length 19 [2020-01-16 19:00:49,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:49,585 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 544 transitions. [2020-01-16 19:00:49,585 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 544 transitions. [2020-01-16 19:00:49,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:49,586 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:49,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 19:00:49,586 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 19:00:49,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:49,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1318731678, now seen corresponding path program 333 times [2020-01-16 19:00:49,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:49,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479526483] [2020-01-16 19:00:49,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:49,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479526483] [2020-01-16 19:00:49,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:49,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:49,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800662088] [2020-01-16 19:00:49,789 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:49,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:49,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:49,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:49,790 INFO L87 Difference]: Start difference. First operand 187 states and 544 transitions. Second operand 8 states. [2020-01-16 19:00:49,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:49,880 INFO L93 Difference]: Finished difference Result 280 states and 688 transitions. [2020-01-16 19:00:49,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:49,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:49,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:49,881 INFO L225 Difference]: With dead ends: 280 [2020-01-16 19:00:49,881 INFO L226 Difference]: Without dead ends: 270 [2020-01-16 19:00:49,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-01-16 19:00:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 189. [2020-01-16 19:00:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 19:00:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 547 transitions. [2020-01-16 19:00:49,886 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 547 transitions. Word has length 19 [2020-01-16 19:00:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:49,886 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 547 transitions. [2020-01-16 19:00:49,886 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 547 transitions. [2020-01-16 19:00:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:49,887 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:49,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 19:00:49,887 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 19:00:49,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:49,887 INFO L82 PathProgramCache]: Analyzing trace with hash -363752674, now seen corresponding path program 334 times [2020-01-16 19:00:49,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:49,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504766691] [2020-01-16 19:00:49,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:50,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 19:00:50,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504766691] [2020-01-16 19:00:50,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:50,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:50,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661206732] [2020-01-16 19:00:50,086 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:50,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:50,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:50,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:50,087 INFO L87 Difference]: Start difference. First operand 189 states and 547 transitions. Second operand 8 states. [2020-01-16 19:00:50,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:50,174 INFO L93 Difference]: Finished difference Result 283 states and 693 transitions. [2020-01-16 19:00:50,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:50,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:50,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:50,175 INFO L225 Difference]: With dead ends: 283 [2020-01-16 19:00:50,175 INFO L226 Difference]: Without dead ends: 268 [2020-01-16 19:00:50,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-01-16 19:00:50,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 187. [2020-01-16 19:00:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 19:00:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 543 transitions. [2020-01-16 19:00:50,179 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 543 transitions. Word has length 19 [2020-01-16 19:00:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:50,179 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 543 transitions. [2020-01-16 19:00:50,179 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 543 transitions. [2020-01-16 19:00:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:50,180 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:50,180 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:50,180 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 19:00:50,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:50,180 INFO L82 PathProgramCache]: Analyzing trace with hash 52566942, now seen corresponding path program 335 times [2020-01-16 19:00:50,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:50,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608778805] [2020-01-16 19:00:50,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:50,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 19:00:50,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608778805] [2020-01-16 19:00:50,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:50,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:50,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89526932] [2020-01-16 19:00:50,381 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:50,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:50,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:50,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:50,382 INFO L87 Difference]: Start difference. First operand 187 states and 543 transitions. Second operand 8 states. [2020-01-16 19:00:50,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:50,461 INFO L93 Difference]: Finished difference Result 278 states and 682 transitions. [2020-01-16 19:00:50,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:50,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:50,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:50,463 INFO L225 Difference]: With dead ends: 278 [2020-01-16 19:00:50,463 INFO L226 Difference]: Without dead ends: 268 [2020-01-16 19:00:50,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:50,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-01-16 19:00:50,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 189. [2020-01-16 19:00:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 19:00:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 546 transitions. [2020-01-16 19:00:50,468 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 546 transitions. Word has length 19 [2020-01-16 19:00:50,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:50,468 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 546 transitions. [2020-01-16 19:00:50,468 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 546 transitions. [2020-01-16 19:00:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:50,468 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00: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 19:00:50,469 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 19:00:50,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:50,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1541971938, now seen corresponding path program 336 times [2020-01-16 19:00:50,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:50,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905795537] [2020-01-16 19:00:50,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:50,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 19:00:50,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905795537] [2020-01-16 19:00:50,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:50,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:50,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119920046] [2020-01-16 19:00:50,669 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:50,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:50,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:50,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:50,670 INFO L87 Difference]: Start difference. First operand 189 states and 546 transitions. Second operand 8 states. [2020-01-16 19:00:50,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:50,756 INFO L93 Difference]: Finished difference Result 276 states and 677 transitions. [2020-01-16 19:00:50,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:50,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:50,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:50,757 INFO L225 Difference]: With dead ends: 276 [2020-01-16 19:00:50,757 INFO L226 Difference]: Without dead ends: 258 [2020-01-16 19:00:50,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 19:00:50,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-01-16 19:00:50,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 184. [2020-01-16 19:00:50,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-01-16 19:00:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 538 transitions. [2020-01-16 19:00:50,761 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 538 transitions. Word has length 19 [2020-01-16 19:00:50,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:50,761 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 538 transitions. [2020-01-16 19:00:50,761 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:50,761 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 538 transitions. [2020-01-16 19:00:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:50,762 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:50,762 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:50,762 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 19:00:50,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:50,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1064346626, now seen corresponding path program 337 times [2020-01-16 19:00:50,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:50,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584240992] [2020-01-16 19:00:50,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:50,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 19:00:50,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584240992] [2020-01-16 19:00:50,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:50,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:50,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771762699] [2020-01-16 19:00:50,949 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:50,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:50,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:50,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:50,949 INFO L87 Difference]: Start difference. First operand 184 states and 538 transitions. Second operand 8 states. [2020-01-16 19:00:51,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:51,048 INFO L93 Difference]: Finished difference Result 296 states and 736 transitions. [2020-01-16 19:00:51,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:51,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:51,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:51,050 INFO L225 Difference]: With dead ends: 296 [2020-01-16 19:00:51,050 INFO L226 Difference]: Without dead ends: 282 [2020-01-16 19:00:51,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 19:00:51,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-01-16 19:00:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 188. [2020-01-16 19:00:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 19:00:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 548 transitions. [2020-01-16 19:00:51,055 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 548 transitions. Word has length 19 [2020-01-16 19:00:51,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:51,055 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 548 transitions. [2020-01-16 19:00:51,055 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:51,055 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 548 transitions. [2020-01-16 19:00:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:51,056 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:51,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 19:00:51,056 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 19:00:51,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:51,056 INFO L82 PathProgramCache]: Analyzing trace with hash 190011300, now seen corresponding path program 338 times [2020-01-16 19:00:51,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:51,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212508397] [2020-01-16 19:00:51,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:51,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 19:00:51,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212508397] [2020-01-16 19:00:51,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:51,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:51,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428729557] [2020-01-16 19:00:51,260 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:51,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:51,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:51,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:51,260 INFO L87 Difference]: Start difference. First operand 188 states and 548 transitions. Second operand 8 states. [2020-01-16 19:00:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:51,344 INFO L93 Difference]: Finished difference Result 292 states and 725 transitions. [2020-01-16 19:00:51,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:51,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:51,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:51,345 INFO L225 Difference]: With dead ends: 292 [2020-01-16 19:00:51,345 INFO L226 Difference]: Without dead ends: 280 [2020-01-16 19:00:51,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 19:00:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-01-16 19:00:51,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 186. [2020-01-16 19:00:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 19:00:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 544 transitions. [2020-01-16 19:00:51,350 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 544 transitions. Word has length 19 [2020-01-16 19:00:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:51,350 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 544 transitions. [2020-01-16 19:00:51,350 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 544 transitions. [2020-01-16 19:00:51,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:51,351 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:51,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 19:00:51,351 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 19:00:51,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:51,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2069598556, now seen corresponding path program 339 times [2020-01-16 19:00:51,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:51,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187378326] [2020-01-16 19:00:51,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:51,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 19:00:51,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187378326] [2020-01-16 19:00:51,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:51,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:51,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965408021] [2020-01-16 19:00:51,549 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:51,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:51,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:51,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:51,550 INFO L87 Difference]: Start difference. First operand 186 states and 544 transitions. Second operand 8 states. [2020-01-16 19:00:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:51,636 INFO L93 Difference]: Finished difference Result 296 states and 735 transitions. [2020-01-16 19:00:51,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:51,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:51,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:51,637 INFO L225 Difference]: With dead ends: 296 [2020-01-16 19:00:51,637 INFO L226 Difference]: Without dead ends: 282 [2020-01-16 19:00:51,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:51,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-01-16 19:00:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 188. [2020-01-16 19:00:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 19:00:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 547 transitions. [2020-01-16 19:00:51,642 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 547 transitions. Word has length 19 [2020-01-16 19:00:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:51,643 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 547 transitions. [2020-01-16 19:00:51,643 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 547 transitions. [2020-01-16 19:00:51,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:51,643 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:51,643 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:51,643 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 19:00:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:51,644 INFO L82 PathProgramCache]: Analyzing trace with hash -949468726, now seen corresponding path program 340 times [2020-01-16 19:00:51,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:51,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732221780] [2020-01-16 19:00:51,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:51,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732221780] [2020-01-16 19:00:51,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:51,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:51,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005962819] [2020-01-16 19:00:51,836 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:51,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:51,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:51,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:51,836 INFO L87 Difference]: Start difference. First operand 188 states and 547 transitions. Second operand 8 states. [2020-01-16 19:00:51,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:51,904 INFO L93 Difference]: Finished difference Result 292 states and 724 transitions. [2020-01-16 19:00:51,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:51,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:51,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:51,905 INFO L225 Difference]: With dead ends: 292 [2020-01-16 19:00:51,906 INFO L226 Difference]: Without dead ends: 280 [2020-01-16 19:00:51,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:51,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-01-16 19:00:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 186. [2020-01-16 19:00:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 19:00:51,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 543 transitions. [2020-01-16 19:00:51,911 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 543 transitions. Word has length 19 [2020-01-16 19:00:51,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:51,911 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 543 transitions. [2020-01-16 19:00:51,911 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:51,911 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 543 transitions. [2020-01-16 19:00:51,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:51,911 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:51,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:51,911 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 19:00:51,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:51,912 INFO L82 PathProgramCache]: Analyzing trace with hash -171970810, now seen corresponding path program 341 times [2020-01-16 19:00:51,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:51,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327374369] [2020-01-16 19:00:51,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:52,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327374369] [2020-01-16 19:00:52,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:52,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:52,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637301865] [2020-01-16 19:00:52,112 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:52,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:52,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:52,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:52,112 INFO L87 Difference]: Start difference. First operand 186 states and 543 transitions. Second operand 8 states. [2020-01-16 19:00:52,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:52,207 INFO L93 Difference]: Finished difference Result 287 states and 713 transitions. [2020-01-16 19:00:52,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:52,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:52,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:52,208 INFO L225 Difference]: With dead ends: 287 [2020-01-16 19:00:52,208 INFO L226 Difference]: Without dead ends: 277 [2020-01-16 19:00:52,209 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:52,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-01-16 19:00:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 187. [2020-01-16 19:00:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 19:00:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 544 transitions. [2020-01-16 19:00:52,212 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 544 transitions. Word has length 19 [2020-01-16 19:00:52,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:52,212 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 544 transitions. [2020-01-16 19:00:52,212 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:52,212 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 544 transitions. [2020-01-16 19:00:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:52,213 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:52,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 19:00:52,213 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 19:00:52,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:52,213 INFO L82 PathProgramCache]: Analyzing trace with hash -411613148, now seen corresponding path program 342 times [2020-01-16 19:00:52,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:52,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576229730] [2020-01-16 19:00:52,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:52,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 19:00:52,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576229730] [2020-01-16 19:00:52,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:52,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:52,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565329347] [2020-01-16 19:00:52,430 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:52,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:52,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:52,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:52,431 INFO L87 Difference]: Start difference. First operand 187 states and 544 transitions. Second operand 8 states. [2020-01-16 19:00:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:52,510 INFO L93 Difference]: Finished difference Result 287 states and 712 transitions. [2020-01-16 19:00:52,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:52,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:52,511 INFO L225 Difference]: With dead ends: 287 [2020-01-16 19:00:52,511 INFO L226 Difference]: Without dead ends: 275 [2020-01-16 19:00:52,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 19:00:52,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-01-16 19:00:52,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 185. [2020-01-16 19:00:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-01-16 19:00:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 541 transitions. [2020-01-16 19:00:52,516 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 541 transitions. Word has length 19 [2020-01-16 19:00:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:52,516 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 541 transitions. [2020-01-16 19:00:52,516 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:52,516 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 541 transitions. [2020-01-16 19:00:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:52,517 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:52,517 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:52,517 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 19:00:52,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:52,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2136529082, now seen corresponding path program 343 times [2020-01-16 19:00:52,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:52,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501599099] [2020-01-16 19:00:52,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:52,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 19:00:52,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501599099] [2020-01-16 19:00:52,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:52,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:52,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622637997] [2020-01-16 19:00:52,695 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:52,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:52,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:52,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:52,695 INFO L87 Difference]: Start difference. First operand 185 states and 541 transitions. Second operand 8 states. [2020-01-16 19:00:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:52,779 INFO L93 Difference]: Finished difference Result 297 states and 737 transitions. [2020-01-16 19:00:52,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:52,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:52,780 INFO L225 Difference]: With dead ends: 297 [2020-01-16 19:00:52,780 INFO L226 Difference]: Without dead ends: 283 [2020-01-16 19:00:52,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:52,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-01-16 19:00:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 189. [2020-01-16 19:00:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 19:00:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 551 transitions. [2020-01-16 19:00:52,785 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 551 transitions. Word has length 19 [2020-01-16 19:00:52,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:52,785 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 551 transitions. [2020-01-16 19:00:52,785 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 551 transitions. [2020-01-16 19:00:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:52,785 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:52,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 19:00:52,785 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 19:00:52,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:52,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1284102888, now seen corresponding path program 344 times [2020-01-16 19:00:52,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:52,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752835145] [2020-01-16 19:00:52,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:52,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 19:00:52,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752835145] [2020-01-16 19:00:52,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:52,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:52,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058697963] [2020-01-16 19:00:52,962 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:52,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:52,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:52,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:52,963 INFO L87 Difference]: Start difference. First operand 189 states and 551 transitions. Second operand 8 states. [2020-01-16 19:00:53,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:53,052 INFO L93 Difference]: Finished difference Result 293 states and 726 transitions. [2020-01-16 19:00:53,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:53,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:53,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:53,053 INFO L225 Difference]: With dead ends: 293 [2020-01-16 19:00:53,053 INFO L226 Difference]: Without dead ends: 281 [2020-01-16 19:00:53,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:53,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-01-16 19:00:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 187. [2020-01-16 19:00:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 19:00:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 546 transitions. [2020-01-16 19:00:53,057 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 546 transitions. Word has length 19 [2020-01-16 19:00:53,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:53,057 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 546 transitions. [2020-01-16 19:00:53,058 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 546 transitions. [2020-01-16 19:00:53,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:53,058 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:53,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 19:00:53,058 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 19:00:53,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:53,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1698016266, now seen corresponding path program 345 times [2020-01-16 19:00:53,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:53,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113250384] [2020-01-16 19:00:53,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:53,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113250384] [2020-01-16 19:00:53,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:53,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:53,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290948279] [2020-01-16 19:00:53,247 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:53,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:53,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:53,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:53,248 INFO L87 Difference]: Start difference. First operand 187 states and 546 transitions. Second operand 8 states. [2020-01-16 19:00:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:53,348 INFO L93 Difference]: Finished difference Result 303 states and 752 transitions. [2020-01-16 19:00:53,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:53,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:53,349 INFO L225 Difference]: With dead ends: 303 [2020-01-16 19:00:53,349 INFO L226 Difference]: Without dead ends: 289 [2020-01-16 19:00:53,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 19:00:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-01-16 19:00:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2020-01-16 19:00:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 19:00:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 556 transitions. [2020-01-16 19:00:53,354 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 556 transitions. Word has length 19 [2020-01-16 19:00:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:53,354 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 556 transitions. [2020-01-16 19:00:53,354 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:53,354 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 556 transitions. [2020-01-16 19:00:53,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:53,355 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:53,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 19:00:53,355 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 19:00:53,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:53,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1628066990, now seen corresponding path program 346 times [2020-01-16 19:00:53,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:53,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903247898] [2020-01-16 19:00:53,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:53,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903247898] [2020-01-16 19:00:53,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:53,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:53,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933251418] [2020-01-16 19:00:53,540 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:53,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:53,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:53,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:53,541 INFO L87 Difference]: Start difference. First operand 192 states and 556 transitions. Second operand 8 states. [2020-01-16 19:00:53,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:53,625 INFO L93 Difference]: Finished difference Result 302 states and 745 transitions. [2020-01-16 19:00:53,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:53,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:53,627 INFO L225 Difference]: With dead ends: 302 [2020-01-16 19:00:53,627 INFO L226 Difference]: Without dead ends: 284 [2020-01-16 19:00:53,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 19:00:53,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-01-16 19:00:53,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 187. [2020-01-16 19:00:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 19:00:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 544 transitions. [2020-01-16 19:00:53,631 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 544 transitions. Word has length 19 [2020-01-16 19:00:53,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:53,631 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 544 transitions. [2020-01-16 19:00:53,631 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 544 transitions. [2020-01-16 19:00:53,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:53,632 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:53,632 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:53,632 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 19:00:53,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:53,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1237178862, now seen corresponding path program 347 times [2020-01-16 19:00:53,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:53,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317737583] [2020-01-16 19:00:53,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:53,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317737583] [2020-01-16 19:00:53,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:53,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:53,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508530286] [2020-01-16 19:00:53,811 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:53,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:53,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:53,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:53,812 INFO L87 Difference]: Start difference. First operand 187 states and 544 transitions. Second operand 8 states. [2020-01-16 19:00:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:53,891 INFO L93 Difference]: Finished difference Result 292 states and 722 transitions. [2020-01-16 19:00:53,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:53,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:53,892 INFO L225 Difference]: With dead ends: 292 [2020-01-16 19:00:53,892 INFO L226 Difference]: Without dead ends: 282 [2020-01-16 19:00:53,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-01-16 19:00:53,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 189. [2020-01-16 19:00:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 19:00:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 547 transitions. [2020-01-16 19:00:53,897 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 547 transitions. Word has length 19 [2020-01-16 19:00:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:53,898 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 547 transitions. [2020-01-16 19:00:53,898 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 547 transitions. [2020-01-16 19:00:53,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:53,898 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:53,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 19:00:53,898 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 19:00:53,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:53,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1328741100, now seen corresponding path program 348 times [2020-01-16 19:00:53,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:53,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228096866] [2020-01-16 19:00:53,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:54,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 19:00:54,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228096866] [2020-01-16 19:00:54,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:54,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:54,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817516304] [2020-01-16 19:00:54,081 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:54,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:54,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:54,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:54,082 INFO L87 Difference]: Start difference. First operand 189 states and 547 transitions. Second operand 8 states. [2020-01-16 19:00:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:54,176 INFO L93 Difference]: Finished difference Result 295 states and 727 transitions. [2020-01-16 19:00:54,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:54,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:54,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:54,178 INFO L225 Difference]: With dead ends: 295 [2020-01-16 19:00:54,178 INFO L226 Difference]: Without dead ends: 278 [2020-01-16 19:00:54,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-01-16 19:00:54,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 185. [2020-01-16 19:00:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-01-16 19:00:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 540 transitions. [2020-01-16 19:00:54,183 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 540 transitions. Word has length 19 [2020-01-16 19:00:54,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:54,183 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 540 transitions. [2020-01-16 19:00:54,183 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 540 transitions. [2020-01-16 19:00:54,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:54,184 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:54,184 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:54,184 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 19:00:54,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:54,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1719022474, now seen corresponding path program 349 times [2020-01-16 19:00:54,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:54,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509694970] [2020-01-16 19:00:54,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:54,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509694970] [2020-01-16 19:00:54,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:54,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:54,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344480193] [2020-01-16 19:00:54,372 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:54,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:54,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:54,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:54,373 INFO L87 Difference]: Start difference. First operand 185 states and 540 transitions. Second operand 8 states. [2020-01-16 19:00:54,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:54,458 INFO L93 Difference]: Finished difference Result 295 states and 729 transitions. [2020-01-16 19:00:54,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:54,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:54,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:54,459 INFO L225 Difference]: With dead ends: 295 [2020-01-16 19:00:54,459 INFO L226 Difference]: Without dead ends: 281 [2020-01-16 19:00:54,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 19:00:54,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-01-16 19:00:54,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 189. [2020-01-16 19:00:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 19:00:54,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 550 transitions. [2020-01-16 19:00:54,463 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 550 transitions. Word has length 19 [2020-01-16 19:00:54,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:54,464 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 550 transitions. [2020-01-16 19:00:54,464 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:54,464 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 550 transitions. [2020-01-16 19:00:54,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:54,464 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:54,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 19:00:54,464 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 19:00:54,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:54,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1455814992, now seen corresponding path program 350 times [2020-01-16 19:00:54,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:54,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065067539] [2020-01-16 19:00:54,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:54,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065067539] [2020-01-16 19:00:54,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:54,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:54,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51085139] [2020-01-16 19:00:54,661 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:54,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:54,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:54,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:54,661 INFO L87 Difference]: Start difference. First operand 189 states and 550 transitions. Second operand 8 states. [2020-01-16 19:00:54,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:54,735 INFO L93 Difference]: Finished difference Result 291 states and 718 transitions. [2020-01-16 19:00:54,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:54,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:54,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:54,736 INFO L225 Difference]: With dead ends: 291 [2020-01-16 19:00:54,736 INFO L226 Difference]: Without dead ends: 279 [2020-01-16 19:00:54,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-01-16 19:00:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 187. [2020-01-16 19:00:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 19:00:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 545 transitions. [2020-01-16 19:00:54,741 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 545 transitions. Word has length 19 [2020-01-16 19:00:54,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:54,741 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 545 transitions. [2020-01-16 19:00:54,741 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:54,741 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 545 transitions. [2020-01-16 19:00:54,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:54,742 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:54,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 19:00:54,742 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 19:00:54,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:54,742 INFO L82 PathProgramCache]: Analyzing trace with hash 645937094, now seen corresponding path program 351 times [2020-01-16 19:00:54,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:54,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765051745] [2020-01-16 19:00:54,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:54,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 19:00:54,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765051745] [2020-01-16 19:00:54,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:54,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:54,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362880081] [2020-01-16 19:00:54,943 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:54,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:54,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:54,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:54,943 INFO L87 Difference]: Start difference. First operand 187 states and 545 transitions. Second operand 8 states. [2020-01-16 19:00:55,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:55,037 INFO L93 Difference]: Finished difference Result 296 states and 729 transitions. [2020-01-16 19:00:55,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:55,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:55,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:55,038 INFO L225 Difference]: With dead ends: 296 [2020-01-16 19:00:55,039 INFO L226 Difference]: Without dead ends: 282 [2020-01-16 19:00:55,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 19:00:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-01-16 19:00:55,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 192. [2020-01-16 19:00:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 19:00:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 555 transitions. [2020-01-16 19:00:55,044 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 555 transitions. Word has length 19 [2020-01-16 19:00:55,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:55,044 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 555 transitions. [2020-01-16 19:00:55,044 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 555 transitions. [2020-01-16 19:00:55,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:55,044 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:55,045 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:55,045 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 19:00:55,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:55,045 INFO L82 PathProgramCache]: Analyzing trace with hash 3880176, now seen corresponding path program 352 times [2020-01-16 19:00:55,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:55,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406699178] [2020-01-16 19:00:55,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:55,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406699178] [2020-01-16 19:00:55,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:55,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:55,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492899535] [2020-01-16 19:00:55,248 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:55,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:55,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:55,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:55,248 INFO L87 Difference]: Start difference. First operand 192 states and 555 transitions. Second operand 8 states. [2020-01-16 19:00:55,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:55,336 INFO L93 Difference]: Finished difference Result 295 states and 722 transitions. [2020-01-16 19:00:55,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:55,336 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:55,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:55,337 INFO L225 Difference]: With dead ends: 295 [2020-01-16 19:00:55,337 INFO L226 Difference]: Without dead ends: 277 [2020-01-16 19:00: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 19:00:55,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-01-16 19:00:55,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 187. [2020-01-16 19:00:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 19:00:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 543 transitions. [2020-01-16 19:00:55,342 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 543 transitions. Word has length 19 [2020-01-16 19:00:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:55,342 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 543 transitions. [2020-01-16 19:00:55,342 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 543 transitions. [2020-01-16 19:00:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:55,343 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:55,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 19:00:55,343 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 19:00:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:55,343 INFO L82 PathProgramCache]: Analyzing trace with hash -380103836, now seen corresponding path program 353 times [2020-01-16 19:00:55,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:55,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132290874] [2020-01-16 19:00:55,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:55,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132290874] [2020-01-16 19:00:55,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:55,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:55,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058417151] [2020-01-16 19:00:55,538 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:55,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:55,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:55,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:55,538 INFO L87 Difference]: Start difference. First operand 187 states and 543 transitions. Second operand 8 states. [2020-01-16 19:00:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:55,599 INFO L93 Difference]: Finished difference Result 285 states and 699 transitions. [2020-01-16 19:00:55,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:55,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:55,600 INFO L225 Difference]: With dead ends: 285 [2020-01-16 19:00:55,600 INFO L226 Difference]: Without dead ends: 275 [2020-01-16 19:00:55,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 19:00:55,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-01-16 19:00:55,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 189. [2020-01-16 19:00:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-01-16 19:00:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 546 transitions. [2020-01-16 19:00:55,604 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 546 transitions. Word has length 19 [2020-01-16 19:00:55,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:55,604 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 546 transitions. [2020-01-16 19:00:55,604 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:55,604 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 546 transitions. [2020-01-16 19:00:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:55,605 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:55,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 19:00:55,605 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 19:00:55,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:55,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1109301160, now seen corresponding path program 354 times [2020-01-16 19:00:55,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:55,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135142070] [2020-01-16 19:00:55,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:55,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135142070] [2020-01-16 19:00:55,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:55,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:55,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299778965] [2020-01-16 19:00:55,793 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:55,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:55,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:55,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:55,794 INFO L87 Difference]: Start difference. First operand 189 states and 546 transitions. Second operand 8 states. [2020-01-16 19:00:55,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:55,878 INFO L93 Difference]: Finished difference Result 283 states and 694 transitions. [2020-01-16 19:00:55,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:55,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:55,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:55,879 INFO L225 Difference]: With dead ends: 283 [2020-01-16 19:00:55,879 INFO L226 Difference]: Without dead ends: 266 [2020-01-16 19:00:55,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 19:00:55,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-01-16 19:00:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 185. [2020-01-16 19:00:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-01-16 19:00:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 539 transitions. [2020-01-16 19:00:55,884 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 539 transitions. Word has length 19 [2020-01-16 19:00:55,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:55,884 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 539 transitions. [2020-01-16 19:00:55,884 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:55,885 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 539 transitions. [2020-01-16 19:00:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:55,885 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:55,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 19:00:55,885 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 19:00:55,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:55,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1184663342, now seen corresponding path program 355 times [2020-01-16 19:00:55,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:55,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362309741] [2020-01-16 19:00:55,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:56,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 19:00:56,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362309741] [2020-01-16 19:00:56,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:56,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:56,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199843885] [2020-01-16 19:00:56,100 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:56,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:56,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:56,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:56,100 INFO L87 Difference]: Start difference. First operand 185 states and 539 transitions. Second operand 8 states. [2020-01-16 19:00:56,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:56,196 INFO L93 Difference]: Finished difference Result 277 states and 681 transitions. [2020-01-16 19:00:56,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:56,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:56,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:56,197 INFO L225 Difference]: With dead ends: 277 [2020-01-16 19:00:56,197 INFO L226 Difference]: Without dead ends: 267 [2020-01-16 19:00:56,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 19:00:56,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-01-16 19:00:56,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 187. [2020-01-16 19:00:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 19:00:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 543 transitions. [2020-01-16 19:00:56,202 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 543 transitions. Word has length 19 [2020-01-16 19:00:56,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:56,202 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 543 transitions. [2020-01-16 19:00:56,202 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:56,202 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 543 transitions. [2020-01-16 19:00:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:56,203 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:56,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 19:00:56,203 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 19:00:56,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:56,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1424305680, now seen corresponding path program 356 times [2020-01-16 19:00:56,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:56,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409743967] [2020-01-16 19:00:56,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:56,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409743967] [2020-01-16 19:00:56,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:56,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:56,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374676841] [2020-01-16 19:00:56,421 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:56,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:56,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:56,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:56,421 INFO L87 Difference]: Start difference. First operand 187 states and 543 transitions. Second operand 8 states. [2020-01-16 19:00:56,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:56,485 INFO L93 Difference]: Finished difference Result 277 states and 680 transitions. [2020-01-16 19:00:56,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:56,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:56,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:56,486 INFO L225 Difference]: With dead ends: 277 [2020-01-16 19:00:56,486 INFO L226 Difference]: Without dead ends: 266 [2020-01-16 19:00:56,487 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:56,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-01-16 19:00:56,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 186. [2020-01-16 19:00:56,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 19:00:56,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 541 transitions. [2020-01-16 19:00:56,491 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 541 transitions. Word has length 19 [2020-01-16 19:00:56,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:56,491 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 541 transitions. [2020-01-16 19:00:56,491 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:56,492 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 541 transitions. [2020-01-16 19:00:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:56,492 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:56,492 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:56,492 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 19:00:56,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:56,492 INFO L82 PathProgramCache]: Analyzing trace with hash 2037218574, now seen corresponding path program 357 times [2020-01-16 19:00:56,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:56,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551271819] [2020-01-16 19:00:56,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:56,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551271819] [2020-01-16 19:00:56,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:56,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:56,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069817715] [2020-01-16 19:00:56,687 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:56,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:56,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:56,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:56,688 INFO L87 Difference]: Start difference. First operand 186 states and 541 transitions. Second operand 8 states. [2020-01-16 19:00:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:56,772 INFO L93 Difference]: Finished difference Result 274 states and 675 transitions. [2020-01-16 19:00:56,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:56,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:56,774 INFO L225 Difference]: With dead ends: 274 [2020-01-16 19:00:56,774 INFO L226 Difference]: Without dead ends: 264 [2020-01-16 19:00:56,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-01-16 19:00:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 188. [2020-01-16 19:00:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 19:00:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 544 transitions. [2020-01-16 19:00:56,778 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 544 transitions. Word has length 19 [2020-01-16 19:00:56,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:56,779 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 544 transitions. [2020-01-16 19:00:56,779 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 544 transitions. [2020-01-16 19:00:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:56,779 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:56,779 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:56,779 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 19:00:56,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:56,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1302769718, now seen corresponding path program 358 times [2020-01-16 19:00:56,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:56,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885495569] [2020-01-16 19:00:56,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:56,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 19:00:56,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885495569] [2020-01-16 19:00:56,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:56,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:56,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141991960] [2020-01-16 19:00:56,976 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:56,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:56,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:56,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:56,976 INFO L87 Difference]: Start difference. First operand 188 states and 544 transitions. Second operand 8 states. [2020-01-16 19:00:57,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:57,065 INFO L93 Difference]: Finished difference Result 277 states and 680 transitions. [2020-01-16 19:00:57,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:57,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:57,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:57,066 INFO L225 Difference]: With dead ends: 277 [2020-01-16 19:00:57,066 INFO L226 Difference]: Without dead ends: 262 [2020-01-16 19:00:57,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 19:00:57,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-01-16 19:00:57,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 186. [2020-01-16 19:00:57,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 19:00:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 540 transitions. [2020-01-16 19:00:57,071 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 540 transitions. Word has length 19 [2020-01-16 19:00:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:57,071 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 540 transitions. [2020-01-16 19:00:57,071 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 540 transitions. [2020-01-16 19:00:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:57,071 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00: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 19:00:57,072 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 19:00:57,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:57,072 INFO L82 PathProgramCache]: Analyzing trace with hash -886450102, now seen corresponding path program 359 times [2020-01-16 19:00:57,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:57,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663480599] [2020-01-16 19:00:57,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:57,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663480599] [2020-01-16 19:00:57,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:57,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:57,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357100313] [2020-01-16 19:00:57,276 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:57,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:57,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:57,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:57,277 INFO L87 Difference]: Start difference. First operand 186 states and 540 transitions. Second operand 8 states. [2020-01-16 19:00:57,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:57,355 INFO L93 Difference]: Finished difference Result 272 states and 669 transitions. [2020-01-16 19:00:57,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:57,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:57,356 INFO L225 Difference]: With dead ends: 272 [2020-01-16 19:00:57,356 INFO L226 Difference]: Without dead ends: 262 [2020-01-16 19:00:57,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:57,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-01-16 19:00:57,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 188. [2020-01-16 19:00:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-01-16 19:00:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 543 transitions. [2020-01-16 19:00:57,361 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 543 transitions. Word has length 19 [2020-01-16 19:00:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:57,361 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 543 transitions. [2020-01-16 19:00:57,361 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 543 transitions. [2020-01-16 19:00:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:57,362 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:57,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 19:00:57,362 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 19:00:57,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:57,362 INFO L82 PathProgramCache]: Analyzing trace with hash 602954894, now seen corresponding path program 360 times [2020-01-16 19:00:57,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:57,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090464789] [2020-01-16 19:00:57,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:57,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:57,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090464789] [2020-01-16 19:00:57,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:57,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:57,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417197629] [2020-01-16 19:00:57,555 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:57,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:57,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:57,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:57,556 INFO L87 Difference]: Start difference. First operand 188 states and 543 transitions. Second operand 8 states. [2020-01-16 19:00:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:57,639 INFO L93 Difference]: Finished difference Result 270 states and 664 transitions. [2020-01-16 19:00:57,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:57,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:57,641 INFO L225 Difference]: With dead ends: 270 [2020-01-16 19:00:57,641 INFO L226 Difference]: Without dead ends: 249 [2020-01-16 19:00:57,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 19:00:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-01-16 19:00:57,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 180. [2020-01-16 19:00:57,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-01-16 19:00:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 530 transitions. [2020-01-16 19:00:57,645 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 530 transitions. Word has length 19 [2020-01-16 19:00:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:57,646 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 530 transitions. [2020-01-16 19:00:57,646 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:57,646 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 530 transitions. [2020-01-16 19:00:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:57,646 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:57,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 19:00:57,646 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 19:00:57,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:57,647 INFO L82 PathProgramCache]: Analyzing trace with hash 234329704, now seen corresponding path program 361 times [2020-01-16 19:00:57,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:57,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257607839] [2020-01-16 19:00:57,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:57,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 19:00:57,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257607839] [2020-01-16 19:00:57,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:57,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:57,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610906634] [2020-01-16 19:00:57,869 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:57,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:57,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:57,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:57,869 INFO L87 Difference]: Start difference. First operand 180 states and 530 transitions. Second operand 8 states. [2020-01-16 19:00:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:57,933 INFO L93 Difference]: Finished difference Result 319 states and 780 transitions. [2020-01-16 19:00:57,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:57,934 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:57,934 INFO L225 Difference]: With dead ends: 319 [2020-01-16 19:00:57,935 INFO L226 Difference]: Without dead ends: 303 [2020-01-16 19:00:57,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-01-16 19:00:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 192. [2020-01-16 19:00:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 19:00:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 556 transitions. [2020-01-16 19:00:57,940 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 556 transitions. Word has length 19 [2020-01-16 19:00:57,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:57,940 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 556 transitions. [2020-01-16 19:00:57,940 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 556 transitions. [2020-01-16 19:00:57,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:57,941 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:57,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:57,941 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 19:00:57,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:57,941 INFO L82 PathProgramCache]: Analyzing trace with hash 608980890, now seen corresponding path program 362 times [2020-01-16 19:00:57,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:57,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138366002] [2020-01-16 19:00:57,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:58,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 19:00:58,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138366002] [2020-01-16 19:00:58,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:58,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:58,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991153231] [2020-01-16 19:00:58,156 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:58,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:58,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:58,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:58,157 INFO L87 Difference]: Start difference. First operand 192 states and 556 transitions. Second operand 8 states. [2020-01-16 19:00:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:58,246 INFO L93 Difference]: Finished difference Result 317 states and 770 transitions. [2020-01-16 19:00:58,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:58,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:58,248 INFO L225 Difference]: With dead ends: 317 [2020-01-16 19:00:58,248 INFO L226 Difference]: Without dead ends: 295 [2020-01-16 19:00:58,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 19:00:58,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-01-16 19:00:58,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2020-01-16 19:00:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-01-16 19:00:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 538 transitions. [2020-01-16 19:00:58,253 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 538 transitions. Word has length 19 [2020-01-16 19:00:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:58,253 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 538 transitions. [2020-01-16 19:00:58,253 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 538 transitions. [2020-01-16 19:00:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:58,253 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:58,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 19:00:58,254 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 19:00:58,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash 438930786, now seen corresponding path program 363 times [2020-01-16 19:00:58,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:58,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588519244] [2020-01-16 19:00:58,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:58,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588519244] [2020-01-16 19:00:58,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:58,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:58,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264983125] [2020-01-16 19:00:58,469 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:58,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:58,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:58,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:58,469 INFO L87 Difference]: Start difference. First operand 184 states and 538 transitions. Second operand 8 states. [2020-01-16 19:00:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:58,530 INFO L93 Difference]: Finished difference Result 310 states and 753 transitions. [2020-01-16 19:00:58,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:58,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:58,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:58,531 INFO L225 Difference]: With dead ends: 310 [2020-01-16 19:00:58,531 INFO L226 Difference]: Without dead ends: 294 [2020-01-16 19:00:58,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-01-16 19:00:58,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 187. [2020-01-16 19:00:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 19:00:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 542 transitions. [2020-01-16 19:00:58,536 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 542 transitions. Word has length 19 [2020-01-16 19:00:58,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:58,537 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 542 transitions. [2020-01-16 19:00:58,537 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:58,537 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 542 transitions. [2020-01-16 19:00:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:58,537 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:58,537 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:58,537 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 19:00:58,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:58,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1712795760, now seen corresponding path program 364 times [2020-01-16 19:00:58,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:58,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663351478] [2020-01-16 19:00:58,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:58,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 19:00:58,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663351478] [2020-01-16 19:00:58,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:58,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:58,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910592664] [2020-01-16 19:00:58,740 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:58,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:58,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:58,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:58,741 INFO L87 Difference]: Start difference. First operand 187 states and 542 transitions. Second operand 8 states. [2020-01-16 19:00:58,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:58,825 INFO L93 Difference]: Finished difference Result 304 states and 738 transitions. [2020-01-16 19:00:58,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:58,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:58,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:58,826 INFO L225 Difference]: With dead ends: 304 [2020-01-16 19:00:58,826 INFO L226 Difference]: Without dead ends: 291 [2020-01-16 19:00:58,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:58,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-01-16 19:00:58,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 184. [2020-01-16 19:00:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-01-16 19:00:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 535 transitions. [2020-01-16 19:00:58,831 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 535 transitions. Word has length 19 [2020-01-16 19:00:58,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:58,832 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 535 transitions. [2020-01-16 19:00:58,832 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 535 transitions. [2020-01-16 19:00:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:58,832 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:58,832 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:58,832 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 19:00:58,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:58,833 INFO L82 PathProgramCache]: Analyzing trace with hash -959085248, now seen corresponding path program 365 times [2020-01-16 19:00:58,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:58,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712017558] [2020-01-16 19:00:58,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:59,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 19:00:59,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712017558] [2020-01-16 19:00:59,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:59,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:59,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690482802] [2020-01-16 19:00:59,035 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:59,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:59,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:59,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:59,036 INFO L87 Difference]: Start difference. First operand 184 states and 535 transitions. Second operand 8 states. [2020-01-16 19:00:59,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:59,116 INFO L93 Difference]: Finished difference Result 305 states and 742 transitions. [2020-01-16 19:00:59,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:59,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:59,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:59,117 INFO L225 Difference]: With dead ends: 305 [2020-01-16 19:00:59,117 INFO L226 Difference]: Without dead ends: 291 [2020-01-16 19:00:59,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 19:00:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-01-16 19:00:59,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 186. [2020-01-16 19:00:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 19:00:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 538 transitions. [2020-01-16 19:00:59,121 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 538 transitions. Word has length 19 [2020-01-16 19:00:59,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:59,121 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 538 transitions. [2020-01-16 19:00:59,121 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 538 transitions. [2020-01-16 19:00:59,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:59,122 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:59,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 19:00:59,122 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 19:00:59,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:59,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1833420574, now seen corresponding path program 366 times [2020-01-16 19:00:59,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:59,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22136794] [2020-01-16 19:00:59,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:59,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22136794] [2020-01-16 19:00:59,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:59,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:59,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348131850] [2020-01-16 19:00:59,328 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:59,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:59,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:59,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:59,329 INFO L87 Difference]: Start difference. First operand 186 states and 538 transitions. Second operand 8 states. [2020-01-16 19:00:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:59,415 INFO L93 Difference]: Finished difference Result 301 states and 731 transitions. [2020-01-16 19:00:59,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:59,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:59,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:59,416 INFO L225 Difference]: With dead ends: 301 [2020-01-16 19:00:59,416 INFO L226 Difference]: Without dead ends: 285 [2020-01-16 19:00:59,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 19:00:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-01-16 19:00:59,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 180. [2020-01-16 19:00:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-01-16 19:00:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 527 transitions. [2020-01-16 19:00:59,420 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 527 transitions. Word has length 19 [2020-01-16 19:00:59,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:59,420 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 527 transitions. [2020-01-16 19:00:59,420 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:59,420 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 527 transitions. [2020-01-16 19:00:59,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:59,421 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:59,421 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:00:59,421 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 19:00:59,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:59,421 INFO L82 PathProgramCache]: Analyzing trace with hash -188156022, now seen corresponding path program 367 times [2020-01-16 19:00:59,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:59,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377024566] [2020-01-16 19:00:59,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:59,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 19:00:59,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377024566] [2020-01-16 19:00:59,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:59,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:59,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703799996] [2020-01-16 19:00:59,643 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:59,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:59,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:59,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:59,643 INFO L87 Difference]: Start difference. First operand 180 states and 527 transitions. Second operand 8 states. [2020-01-16 19:00:59,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:00:59,714 INFO L93 Difference]: Finished difference Result 319 states and 777 transitions. [2020-01-16 19:00:59,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:00:59,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:00:59,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:00:59,715 INFO L225 Difference]: With dead ends: 319 [2020-01-16 19:00:59,716 INFO L226 Difference]: Without dead ends: 303 [2020-01-16 19:00:59,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:00:59,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-01-16 19:00:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 192. [2020-01-16 19:00:59,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-01-16 19:00:59,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 553 transitions. [2020-01-16 19:00:59,721 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 553 transitions. Word has length 19 [2020-01-16 19:00:59,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:00:59,721 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 553 transitions. [2020-01-16 19:00:59,721 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:00:59,721 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 553 transitions. [2020-01-16 19:00:59,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:00:59,721 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:00:59,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 19:00:59,721 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 19:00:59,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:00:59,722 INFO L82 PathProgramCache]: Analyzing trace with hash 186495164, now seen corresponding path program 368 times [2020-01-16 19:00:59,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:00:59,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251394727] [2020-01-16 19:00:59,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:00:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:00:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:00:59,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251394727] [2020-01-16 19:00:59,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:00:59,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:00:59,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107016292] [2020-01-16 19:00:59,937 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:00:59,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:00:59,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:00:59,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:00:59,938 INFO L87 Difference]: Start difference. First operand 192 states and 553 transitions. Second operand 8 states. [2020-01-16 19:01:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:00,016 INFO L93 Difference]: Finished difference Result 317 states and 767 transitions. [2020-01-16 19:01:00,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:00,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:00,017 INFO L225 Difference]: With dead ends: 317 [2020-01-16 19:01:00,017 INFO L226 Difference]: Without dead ends: 295 [2020-01-16 19:01:00,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 19:01:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-01-16 19:01:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2020-01-16 19:01:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-01-16 19:01:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 535 transitions. [2020-01-16 19:01:00,023 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 535 transitions. Word has length 19 [2020-01-16 19:01:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:00,023 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 535 transitions. [2020-01-16 19:01:00,023 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 535 transitions. [2020-01-16 19:01:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:00,023 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:00,023 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:00,023 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 19:01:00,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:00,024 INFO L82 PathProgramCache]: Analyzing trace with hash 342041284, now seen corresponding path program 369 times [2020-01-16 19:01:00,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:00,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638018820] [2020-01-16 19:01:00,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:00,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638018820] [2020-01-16 19:01:00,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:00,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:00,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658848957] [2020-01-16 19:01:00,274 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:00,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:00,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:00,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:00,274 INFO L87 Difference]: Start difference. First operand 184 states and 535 transitions. Second operand 8 states. [2020-01-16 19:01:00,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:00,351 INFO L93 Difference]: Finished difference Result 310 states and 750 transitions. [2020-01-16 19:01:00,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:00,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:00,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:00,352 INFO L225 Difference]: With dead ends: 310 [2020-01-16 19:01:00,352 INFO L226 Difference]: Without dead ends: 294 [2020-01-16 19:01:00,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:00,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-01-16 19:01:00,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 187. [2020-01-16 19:01:00,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 19:01:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 539 transitions. [2020-01-16 19:01:00,357 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 539 transitions. Word has length 19 [2020-01-16 19:01:00,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:00,357 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 539 transitions. [2020-01-16 19:01:00,357 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:00,357 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 539 transitions. [2020-01-16 19:01:00,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:00,357 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:00,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:00,357 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 19:01:00,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:00,358 INFO L82 PathProgramCache]: Analyzing trace with hash 601099510, now seen corresponding path program 370 times [2020-01-16 19:01:00,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:00,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928480233] [2020-01-16 19:01:00,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:00,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 19:01:00,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928480233] [2020-01-16 19:01:00,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:00,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:00,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973247180] [2020-01-16 19:01:00,572 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:00,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:00,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:00,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:00,572 INFO L87 Difference]: Start difference. First operand 187 states and 539 transitions. Second operand 8 states. [2020-01-16 19:01:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:00,637 INFO L93 Difference]: Finished difference Result 304 states and 735 transitions. [2020-01-16 19:01:00,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:00,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:00,639 INFO L225 Difference]: With dead ends: 304 [2020-01-16 19:01:00,639 INFO L226 Difference]: Without dead ends: 291 [2020-01-16 19:01:00,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:00,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-01-16 19:01:00,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 184. [2020-01-16 19:01:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-01-16 19:01:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 532 transitions. [2020-01-16 19:01:00,643 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 532 transitions. Word has length 19 [2020-01-16 19:01:00,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:00,643 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 532 transitions. [2020-01-16 19:01:00,643 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:00,643 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 532 transitions. [2020-01-16 19:01:00,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:00,644 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:00,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 19:01:00,644 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 19:01:00,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:00,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2030620292, now seen corresponding path program 371 times [2020-01-16 19:01:00,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:00,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344005581] [2020-01-16 19:01:00,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:00,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344005581] [2020-01-16 19:01:00,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:00,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:00,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44617442] [2020-01-16 19:01:00,854 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:00,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:00,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:00,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:00,854 INFO L87 Difference]: Start difference. First operand 184 states and 532 transitions. Second operand 8 states. [2020-01-16 19:01:00,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:00,944 INFO L93 Difference]: Finished difference Result 305 states and 739 transitions. [2020-01-16 19:01:00,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:00,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:00,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:00,945 INFO L225 Difference]: With dead ends: 305 [2020-01-16 19:01:00,945 INFO L226 Difference]: Without dead ends: 291 [2020-01-16 19:01:00,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 19:01:00,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-01-16 19:01:00,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 186. [2020-01-16 19:01:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-01-16 19:01:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 535 transitions. [2020-01-16 19:01:00,950 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 535 transitions. Word has length 19 [2020-01-16 19:01:00,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:00,951 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 535 transitions. [2020-01-16 19:01:00,951 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:00,951 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 535 transitions. [2020-01-16 19:01:00,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:00,951 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:00,951 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:00,951 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 19:01:00,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:00,951 INFO L82 PathProgramCache]: Analyzing trace with hash -910490462, now seen corresponding path program 372 times [2020-01-16 19:01:00,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:00,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245794649] [2020-01-16 19:01:00,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:01,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245794649] [2020-01-16 19:01:01,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:01,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:01,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43694578] [2020-01-16 19:01:01,170 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:01,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:01,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:01,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:01,171 INFO L87 Difference]: Start difference. First operand 186 states and 535 transitions. Second operand 8 states. [2020-01-16 19:01:01,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:01,244 INFO L93 Difference]: Finished difference Result 301 states and 728 transitions. [2020-01-16 19:01:01,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:01,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:01,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:01,245 INFO L225 Difference]: With dead ends: 301 [2020-01-16 19:01:01,245 INFO L226 Difference]: Without dead ends: 285 [2020-01-16 19:01:01,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2020-01-16 19:01:01,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 180. [2020-01-16 19:01:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-01-16 19:01:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 524 transitions. [2020-01-16 19:01:01,249 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 524 transitions. Word has length 19 [2020-01-16 19:01:01,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:01,249 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 524 transitions. [2020-01-16 19:01:01,250 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 524 transitions. [2020-01-16 19:01:01,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:01,250 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:01,250 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:01,250 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 19:01:01,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:01,250 INFO L82 PathProgramCache]: Analyzing trace with hash -304821912, now seen corresponding path program 373 times [2020-01-16 19:01:01,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:01,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191189944] [2020-01-16 19:01:01,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:01,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 19:01:01,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191189944] [2020-01-16 19:01:01,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:01,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:01,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410884950] [2020-01-16 19:01:01,458 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:01,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:01,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:01,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:01,459 INFO L87 Difference]: Start difference. First operand 180 states and 524 transitions. Second operand 8 states. [2020-01-16 19:01:01,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:01,521 INFO L93 Difference]: Finished difference Result 298 states and 719 transitions. [2020-01-16 19:01:01,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:01,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:01,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:01,523 INFO L225 Difference]: With dead ends: 298 [2020-01-16 19:01:01,523 INFO L226 Difference]: Without dead ends: 282 [2020-01-16 19:01:01,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:01,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-01-16 19:01:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 185. [2020-01-16 19:01:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-01-16 19:01:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 534 transitions. [2020-01-16 19:01:01,528 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 534 transitions. Word has length 19 [2020-01-16 19:01:01,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:01,528 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 534 transitions. [2020-01-16 19:01:01,528 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:01,528 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 534 transitions. [2020-01-16 19:01:01,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:01,528 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:01,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 19:01:01,528 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 19:01:01,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:01,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1838418838, now seen corresponding path program 374 times [2020-01-16 19:01:01,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:01,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040313423] [2020-01-16 19:01:01,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:01,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040313423] [2020-01-16 19:01:01,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:01,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:01,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979872904] [2020-01-16 19:01:01,741 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:01,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:01,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:01,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:01,742 INFO L87 Difference]: Start difference. First operand 185 states and 534 transitions. Second operand 8 states. [2020-01-16 19:01:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:01,844 INFO L93 Difference]: Finished difference Result 292 states and 704 transitions. [2020-01-16 19:01:01,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:01,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:01,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:01,846 INFO L225 Difference]: With dead ends: 292 [2020-01-16 19:01:01,846 INFO L226 Difference]: Without dead ends: 279 [2020-01-16 19:01:01,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-01-16 19:01:01,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 182. [2020-01-16 19:01:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-01-16 19:01:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 528 transitions. [2020-01-16 19:01:01,850 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 528 transitions. Word has length 19 [2020-01-16 19:01:01,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:01,850 INFO L478 AbstractCegarLoop]: Abstraction has 182 states and 528 transitions. [2020-01-16 19:01:01,850 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:01,850 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 528 transitions. [2020-01-16 19:01:01,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:01,850 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:01,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 19:01:01,851 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 19:01:01,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:01,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1905259766, now seen corresponding path program 375 times [2020-01-16 19:01:01,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:01,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717125625] [2020-01-16 19:01:01,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:02,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 19:01:02,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717125625] [2020-01-16 19:01:02,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:02,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:02,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634922571] [2020-01-16 19:01:02,098 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:02,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:02,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:02,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:02,099 INFO L87 Difference]: Start difference. First operand 182 states and 528 transitions. Second operand 8 states. [2020-01-16 19:01:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:02,159 INFO L93 Difference]: Finished difference Result 298 states and 717 transitions. [2020-01-16 19:01:02,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:02,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:02,161 INFO L225 Difference]: With dead ends: 298 [2020-01-16 19:01:02,161 INFO L226 Difference]: Without dead ends: 282 [2020-01-16 19:01:02,161 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-01-16 19:01:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 185. [2020-01-16 19:01:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-01-16 19:01:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 532 transitions. [2020-01-16 19:01:02,166 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 532 transitions. Word has length 19 [2020-01-16 19:01:02,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:02,166 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 532 transitions. [2020-01-16 19:01:02,166 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:02,166 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 532 transitions. [2020-01-16 19:01:02,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:02,167 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:02,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:02,167 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 19:01:02,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:02,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1646201540, now seen corresponding path program 376 times [2020-01-16 19:01:02,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:02,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771220685] [2020-01-16 19:01:02,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:02,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771220685] [2020-01-16 19:01:02,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:02,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:02,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099661303] [2020-01-16 19:01:02,387 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:02,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:02,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:02,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:02,387 INFO L87 Difference]: Start difference. First operand 185 states and 532 transitions. Second operand 8 states. [2020-01-16 19:01:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:02,464 INFO L93 Difference]: Finished difference Result 292 states and 702 transitions. [2020-01-16 19:01:02,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:02,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:02,465 INFO L225 Difference]: With dead ends: 292 [2020-01-16 19:01:02,466 INFO L226 Difference]: Without dead ends: 279 [2020-01-16 19:01: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 19:01:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-01-16 19:01:02,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 182. [2020-01-16 19:01:02,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-01-16 19:01:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 526 transitions. [2020-01-16 19:01:02,469 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 526 transitions. Word has length 19 [2020-01-16 19:01:02,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:02,469 INFO L478 AbstractCegarLoop]: Abstraction has 182 states and 526 transitions. [2020-01-16 19:01:02,469 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:02,470 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 526 transitions. [2020-01-16 19:01:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:02,470 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:02,470 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:02,470 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 19:01:02,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:02,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1408327434, now seen corresponding path program 377 times [2020-01-16 19:01:02,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:02,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565144933] [2020-01-16 19:01:02,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:02,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 19:01:02,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565144933] [2020-01-16 19:01:02,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:02,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:02,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182167939] [2020-01-16 19:01:02,694 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:02,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:02,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:02,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:02,695 INFO L87 Difference]: Start difference. First operand 182 states and 526 transitions. Second operand 8 states. [2020-01-16 19:01:02,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:02,777 INFO L93 Difference]: Finished difference Result 284 states and 686 transitions. [2020-01-16 19:01:02,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:02,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:02,778 INFO L225 Difference]: With dead ends: 284 [2020-01-16 19:01:02,778 INFO L226 Difference]: Without dead ends: 274 [2020-01-16 19:01:02,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 19:01:02,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-01-16 19:01:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 183. [2020-01-16 19:01:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-01-16 19:01:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 527 transitions. [2020-01-16 19:01:02,782 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 527 transitions. Word has length 19 [2020-01-16 19:01:02,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:02,782 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 527 transitions. [2020-01-16 19:01:02,782 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:02,782 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 527 transitions. [2020-01-16 19:01:02,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:02,782 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01: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 19:01:02,783 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 19:01:02,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:02,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1168685096, now seen corresponding path program 378 times [2020-01-16 19:01:02,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:02,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586124757] [2020-01-16 19:01:02,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:03,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586124757] [2020-01-16 19:01:03,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:03,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:03,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401797836] [2020-01-16 19:01:03,010 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:03,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:03,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:03,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:03,010 INFO L87 Difference]: Start difference. First operand 183 states and 527 transitions. Second operand 8 states. [2020-01-16 19:01:03,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:03,078 INFO L93 Difference]: Finished difference Result 284 states and 685 transitions. [2020-01-16 19:01:03,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:03,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:03,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:03,079 INFO L225 Difference]: With dead ends: 284 [2020-01-16 19:01:03,080 INFO L226 Difference]: Without dead ends: 271 [2020-01-16 19:01:03,080 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:03,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-01-16 19:01:03,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 180. [2020-01-16 19:01:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-01-16 19:01:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 522 transitions. [2020-01-16 19:01:03,085 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 522 transitions. Word has length 19 [2020-01-16 19:01:03,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:03,085 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 522 transitions. [2020-01-16 19:01:03,085 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 522 transitions. [2020-01-16 19:01:03,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:03,085 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:03,085 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:03,085 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 19:01:03,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:03,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1264971302, now seen corresponding path program 379 times [2020-01-16 19:01:03,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:03,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101704963] [2020-01-16 19:01:03,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:03,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101704963] [2020-01-16 19:01:03,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:03,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:03,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641242951] [2020-01-16 19:01:03,295 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:03,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:03,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:03,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:03,295 INFO L87 Difference]: Start difference. First operand 180 states and 522 transitions. Second operand 8 states. [2020-01-16 19:01:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:03,384 INFO L93 Difference]: Finished difference Result 288 states and 699 transitions. [2020-01-16 19:01:03,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:03,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:03,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:03,385 INFO L225 Difference]: With dead ends: 288 [2020-01-16 19:01:03,385 INFO L226 Difference]: Without dead ends: 274 [2020-01-16 19:01:03,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-01-16 19:01:03,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 183. [2020-01-16 19:01:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-01-16 19:01:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 528 transitions. [2020-01-16 19:01:03,389 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 528 transitions. Word has length 19 [2020-01-16 19:01:03,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:03,389 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 528 transitions. [2020-01-16 19:01:03,389 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:03,389 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 528 transitions. [2020-01-16 19:01:03,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:03,390 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:03,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 19:01:03,390 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 19:01:03,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:03,391 INFO L82 PathProgramCache]: Analyzing trace with hash -2139306628, now seen corresponding path program 380 times [2020-01-16 19:01:03,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:03,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514039894] [2020-01-16 19:01:03,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:03,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514039894] [2020-01-16 19:01:03,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:03,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:03,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613455342] [2020-01-16 19:01:03,607 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:03,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:03,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:03,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:03,607 INFO L87 Difference]: Start difference. First operand 183 states and 528 transitions. Second operand 8 states. [2020-01-16 19:01:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:03,692 INFO L93 Difference]: Finished difference Result 284 states and 688 transitions. [2020-01-16 19:01:03,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:03,694 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:03,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:03,695 INFO L225 Difference]: With dead ends: 284 [2020-01-16 19:01:03,695 INFO L226 Difference]: Without dead ends: 272 [2020-01-16 19:01:03,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 19:01:03,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-01-16 19:01:03,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 181. [2020-01-16 19:01:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-01-16 19:01:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 524 transitions. [2020-01-16 19:01:03,700 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 524 transitions. Word has length 19 [2020-01-16 19:01:03,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:03,700 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 524 transitions. [2020-01-16 19:01:03,700 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 524 transitions. [2020-01-16 19:01:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:03,701 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:03,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 19:01:03,701 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 19:01:03,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:03,702 INFO L82 PathProgramCache]: Analyzing trace with hash -103949188, now seen corresponding path program 381 times [2020-01-16 19:01:03,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:03,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176125205] [2020-01-16 19:01:03,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:03,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 19:01:03,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176125205] [2020-01-16 19:01:03,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:03,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:03,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652440070] [2020-01-16 19:01:03,918 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:03,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:03,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:03,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:03,919 INFO L87 Difference]: Start difference. First operand 181 states and 524 transitions. Second operand 8 states. [2020-01-16 19:01:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:03,994 INFO L93 Difference]: Finished difference Result 288 states and 698 transitions. [2020-01-16 19:01:03,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:03,994 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:03,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:03,995 INFO L225 Difference]: With dead ends: 288 [2020-01-16 19:01:03,995 INFO L226 Difference]: Without dead ends: 274 [2020-01-16 19:01:03,995 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:03,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-01-16 19:01:03,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 183. [2020-01-16 19:01:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-01-16 19:01:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 527 transitions. [2020-01-16 19:01:03,999 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 527 transitions. Word has length 19 [2020-01-16 19:01:03,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:03,999 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 527 transitions. [2020-01-16 19:01:03,999 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:04,000 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 527 transitions. [2020-01-16 19:01:04,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:04,000 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:04,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:04,000 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 19:01:04,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:04,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1016180642, now seen corresponding path program 382 times [2020-01-16 19:01:04,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:04,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325958962] [2020-01-16 19:01:04,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:04,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 19:01:04,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325958962] [2020-01-16 19:01:04,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:04,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:04,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089455650] [2020-01-16 19:01:04,213 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:04,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:04,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:04,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:04,214 INFO L87 Difference]: Start difference. First operand 183 states and 527 transitions. Second operand 8 states. [2020-01-16 19:01:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:04,278 INFO L93 Difference]: Finished difference Result 284 states and 687 transitions. [2020-01-16 19:01:04,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:04,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:04,279 INFO L225 Difference]: With dead ends: 284 [2020-01-16 19:01:04,280 INFO L226 Difference]: Without dead ends: 272 [2020-01-16 19:01:04,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 19:01:04,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-01-16 19:01:04,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 181. [2020-01-16 19:01:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-01-16 19:01:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 523 transitions. [2020-01-16 19:01:04,284 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 523 transitions. Word has length 19 [2020-01-16 19:01:04,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:04,284 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 523 transitions. [2020-01-16 19:01:04,284 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:04,285 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 523 transitions. [2020-01-16 19:01:04,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:04,285 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:04,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 19:01:04,285 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 19:01:04,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:04,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1793678558, now seen corresponding path program 383 times [2020-01-16 19:01:04,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:04,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604577774] [2020-01-16 19:01:04,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:04,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 19:01:04,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604577774] [2020-01-16 19:01:04,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:04,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:04,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329561952] [2020-01-16 19:01:04,501 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:04,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:04,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:04,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:04,502 INFO L87 Difference]: Start difference. First operand 181 states and 523 transitions. Second operand 8 states. [2020-01-16 19:01:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:04,586 INFO L93 Difference]: Finished difference Result 279 states and 676 transitions. [2020-01-16 19:01:04,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:04,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:04,587 INFO L225 Difference]: With dead ends: 279 [2020-01-16 19:01:04,588 INFO L226 Difference]: Without dead ends: 269 [2020-01-16 19:01:04,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:04,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-01-16 19:01:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 182. [2020-01-16 19:01:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-01-16 19:01:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 524 transitions. [2020-01-16 19:01:04,592 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 524 transitions. Word has length 19 [2020-01-16 19:01:04,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:04,592 INFO L478 AbstractCegarLoop]: Abstraction has 182 states and 524 transitions. [2020-01-16 19:01:04,592 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 524 transitions. [2020-01-16 19:01:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:04,592 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:04,592 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:04,593 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 19:01:04,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:04,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1554036220, now seen corresponding path program 384 times [2020-01-16 19:01:04,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:04,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157679095] [2020-01-16 19:01:04,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:04,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157679095] [2020-01-16 19:01:04,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:04,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:04,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426654836] [2020-01-16 19:01:04,827 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:04,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:04,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:04,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:04,827 INFO L87 Difference]: Start difference. First operand 182 states and 524 transitions. Second operand 8 states. [2020-01-16 19:01:04,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:04,899 INFO L93 Difference]: Finished difference Result 279 states and 675 transitions. [2020-01-16 19:01:04,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:04,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:04,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:04,900 INFO L225 Difference]: With dead ends: 279 [2020-01-16 19:01:04,900 INFO L226 Difference]: Without dead ends: 264 [2020-01-16 19:01:04,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 19:01:04,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-01-16 19:01:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 177. [2020-01-16 19:01:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-01-16 19:01:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 516 transitions. [2020-01-16 19:01:04,905 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 516 transitions. Word has length 19 [2020-01-16 19:01:04,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:04,905 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 516 transitions. [2020-01-16 19:01:04,905 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 516 transitions. [2020-01-16 19:01:04,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:04,906 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:04,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 19:01:04,906 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 19:01:04,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:04,906 INFO L82 PathProgramCache]: Analyzing trace with hash 22174086, now seen corresponding path program 385 times [2020-01-16 19:01:04,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:04,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608420486] [2020-01-16 19:01:04,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:05,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 19:01:05,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608420486] [2020-01-16 19:01:05,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:05,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:05,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540259768] [2020-01-16 19:01:05,115 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:05,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:05,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:05,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:05,115 INFO L87 Difference]: Start difference. First operand 177 states and 516 transitions. Second operand 8 states. [2020-01-16 19:01:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:05,180 INFO L93 Difference]: Finished difference Result 321 states and 784 transitions. [2020-01-16 19:01:05,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:05,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:05,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:05,181 INFO L225 Difference]: With dead ends: 321 [2020-01-16 19:01:05,181 INFO L226 Difference]: Without dead ends: 305 [2020-01-16 19:01:05,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-01-16 19:01:05,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 185. [2020-01-16 19:01:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-01-16 19:01:05,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 530 transitions. [2020-01-16 19:01:05,186 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 530 transitions. Word has length 19 [2020-01-16 19:01:05,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:05,186 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 530 transitions. [2020-01-16 19:01:05,186 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 530 transitions. [2020-01-16 19:01:05,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:05,187 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:05,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:05,187 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 19:01:05,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:05,187 INFO L82 PathProgramCache]: Analyzing trace with hash 396825272, now seen corresponding path program 386 times [2020-01-16 19:01:05,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:05,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077990816] [2020-01-16 19:01:05,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:05,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077990816] [2020-01-16 19:01:05,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:05,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:05,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914203870] [2020-01-16 19:01:05,395 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:05,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:05,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:05,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:05,396 INFO L87 Difference]: Start difference. First operand 185 states and 530 transitions. Second operand 8 states. [2020-01-16 19:01:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:05,481 INFO L93 Difference]: Finished difference Result 319 states and 774 transitions. [2020-01-16 19:01:05,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:05,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:05,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:05,482 INFO L225 Difference]: With dead ends: 319 [2020-01-16 19:01:05,482 INFO L226 Difference]: Without dead ends: 297 [2020-01-16 19:01:05,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:05,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-01-16 19:01:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 177. [2020-01-16 19:01:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-01-16 19:01:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 512 transitions. [2020-01-16 19:01:05,487 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 512 transitions. Word has length 19 [2020-01-16 19:01:05,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:05,487 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 512 transitions. [2020-01-16 19:01:05,488 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:05,488 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 512 transitions. [2020-01-16 19:01:05,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:05,488 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:05,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 19:01:05,488 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 19:01:05,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:05,488 INFO L82 PathProgramCache]: Analyzing trace with hash 226775168, now seen corresponding path program 387 times [2020-01-16 19:01:05,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:05,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953406434] [2020-01-16 19:01:05,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:05,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953406434] [2020-01-16 19:01:05,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:05,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:05,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293743120] [2020-01-16 19:01:05,689 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:05,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:05,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:05,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:05,689 INFO L87 Difference]: Start difference. First operand 177 states and 512 transitions. Second operand 8 states. [2020-01-16 19:01:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:05,744 INFO L93 Difference]: Finished difference Result 312 states and 757 transitions. [2020-01-16 19:01:05,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:05,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:05,746 INFO L225 Difference]: With dead ends: 312 [2020-01-16 19:01:05,746 INFO L226 Difference]: Without dead ends: 296 [2020-01-16 19:01:05,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:05,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2020-01-16 19:01:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 180. [2020-01-16 19:01:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-01-16 19:01:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 516 transitions. [2020-01-16 19:01:05,751 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 516 transitions. Word has length 19 [2020-01-16 19:01:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:05,751 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 516 transitions. [2020-01-16 19:01:05,751 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 516 transitions. [2020-01-16 19:01:05,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:05,751 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:05,751 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:05,752 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 19:01:05,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:05,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1924951378, now seen corresponding path program 388 times [2020-01-16 19:01:05,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:05,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141664522] [2020-01-16 19:01:05,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:05,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 19:01:05,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141664522] [2020-01-16 19:01:05,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:05,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:05,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893110415] [2020-01-16 19:01:05,945 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:05,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:05,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:05,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:05,945 INFO L87 Difference]: Start difference. First operand 180 states and 516 transitions. Second operand 8 states. [2020-01-16 19:01:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:06,028 INFO L93 Difference]: Finished difference Result 306 states and 742 transitions. [2020-01-16 19:01:06,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:06,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:06,030 INFO L225 Difference]: With dead ends: 306 [2020-01-16 19:01:06,030 INFO L226 Difference]: Without dead ends: 293 [2020-01-16 19:01:06,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:06,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-01-16 19:01:06,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 177. [2020-01-16 19:01:06,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-01-16 19:01:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 509 transitions. [2020-01-16 19:01:06,033 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 509 transitions. Word has length 19 [2020-01-16 19:01:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:06,033 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 509 transitions. [2020-01-16 19:01:06,033 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 509 transitions. [2020-01-16 19:01:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:06,034 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:06,034 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:06,034 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 19:01:06,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:06,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1171240866, now seen corresponding path program 389 times [2020-01-16 19:01:06,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:06,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706010759] [2020-01-16 19:01:06,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:06,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:06,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706010759] [2020-01-16 19:01:06,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:06,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:06,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018849921] [2020-01-16 19:01:06,231 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:06,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:06,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:06,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:06,232 INFO L87 Difference]: Start difference. First operand 177 states and 509 transitions. Second operand 8 states. [2020-01-16 19:01:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:06,313 INFO L93 Difference]: Finished difference Result 307 states and 746 transitions. [2020-01-16 19:01:06,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:06,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:06,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:06,314 INFO L225 Difference]: With dead ends: 307 [2020-01-16 19:01:06,315 INFO L226 Difference]: Without dead ends: 293 [2020-01-16 19:01:06,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:06,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-01-16 19:01:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 179. [2020-01-16 19:01:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-01-16 19:01:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 512 transitions. [2020-01-16 19:01:06,319 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 512 transitions. Word has length 19 [2020-01-16 19:01:06,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:06,319 INFO L478 AbstractCegarLoop]: Abstraction has 179 states and 512 transitions. [2020-01-16 19:01:06,319 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 512 transitions. [2020-01-16 19:01:06,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:06,319 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:06,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 19:01:06,320 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 19:01:06,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:06,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2045576192, now seen corresponding path program 390 times [2020-01-16 19:01:06,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:06,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370130475] [2020-01-16 19:01:06,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:06,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370130475] [2020-01-16 19:01:06,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:06,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:06,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842004072] [2020-01-16 19:01:06,515 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:06,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:06,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:06,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:06,515 INFO L87 Difference]: Start difference. First operand 179 states and 512 transitions. Second operand 8 states. [2020-01-16 19:01:06,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:06,602 INFO L93 Difference]: Finished difference Result 303 states and 735 transitions. [2020-01-16 19:01:06,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:06,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:06,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:06,603 INFO L225 Difference]: With dead ends: 303 [2020-01-16 19:01:06,604 INFO L226 Difference]: Without dead ends: 287 [2020-01-16 19:01:06,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 19:01:06,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-01-16 19:01:06,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 173. [2020-01-16 19:01:06,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-01-16 19:01:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 500 transitions. [2020-01-16 19:01:06,608 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 500 transitions. Word has length 19 [2020-01-16 19:01:06,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:06,608 INFO L478 AbstractCegarLoop]: Abstraction has 173 states and 500 transitions. [2020-01-16 19:01:06,608 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:06,608 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 500 transitions. [2020-01-16 19:01:06,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:06,609 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:06,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:06,609 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 19:01:06,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:06,609 INFO L82 PathProgramCache]: Analyzing trace with hash -822797366, now seen corresponding path program 391 times [2020-01-16 19:01:06,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:06,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458279918] [2020-01-16 19:01:06,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:06,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 19:01:06,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458279918] [2020-01-16 19:01:06,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:06,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:06,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013176316] [2020-01-16 19:01:06,822 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:06,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:06,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:06,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:06,822 INFO L87 Difference]: Start difference. First operand 173 states and 500 transitions. Second operand 8 states. [2020-01-16 19:01:06,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:06,885 INFO L93 Difference]: Finished difference Result 321 states and 787 transitions. [2020-01-16 19:01:06,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:06,885 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:06,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:06,886 INFO L225 Difference]: With dead ends: 321 [2020-01-16 19:01:06,886 INFO L226 Difference]: Without dead ends: 305 [2020-01-16 19:01:06,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 19:01:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-01-16 19:01:06,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 187. [2020-01-16 19:01:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-01-16 19:01:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 535 transitions. [2020-01-16 19:01:06,891 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 535 transitions. Word has length 19 [2020-01-16 19:01:06,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:06,891 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 535 transitions. [2020-01-16 19:01:06,891 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 535 transitions. [2020-01-16 19:01:06,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:06,891 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:06,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 19:01:06,892 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 19:01:06,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:06,892 INFO L82 PathProgramCache]: Analyzing trace with hash -448146180, now seen corresponding path program 392 times [2020-01-16 19:01:06,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:06,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67826037] [2020-01-16 19:01:06,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:07,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 19:01:07,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67826037] [2020-01-16 19:01:07,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:07,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:07,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644798436] [2020-01-16 19:01:07,097 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:07,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:07,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:07,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:07,097 INFO L87 Difference]: Start difference. First operand 187 states and 535 transitions. Second operand 8 states. [2020-01-16 19:01:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:07,174 INFO L93 Difference]: Finished difference Result 319 states and 777 transitions. [2020-01-16 19:01:07,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:07,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:07,176 INFO L225 Difference]: With dead ends: 319 [2020-01-16 19:01:07,176 INFO L226 Difference]: Without dead ends: 297 [2020-01-16 19:01:07,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-01-16 19:01:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 179. [2020-01-16 19:01:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-01-16 19:01:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 515 transitions. [2020-01-16 19:01:07,180 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 515 transitions. Word has length 19 [2020-01-16 19:01:07,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:07,180 INFO L478 AbstractCegarLoop]: Abstraction has 179 states and 515 transitions. [2020-01-16 19:01:07,180 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 515 transitions. [2020-01-16 19:01:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:07,180 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:07,180 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:07,181 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 19:01:07,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:07,181 INFO L82 PathProgramCache]: Analyzing trace with hash 32996164, now seen corresponding path program 393 times [2020-01-16 19:01:07,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:07,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898667902] [2020-01-16 19:01:07,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:07,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898667902] [2020-01-16 19:01:07,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:07,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:07,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652197400] [2020-01-16 19:01:07,387 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:07,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:07,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:07,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:07,388 INFO L87 Difference]: Start difference. First operand 179 states and 515 transitions. Second operand 8 states. [2020-01-16 19:01:07,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:07,451 INFO L93 Difference]: Finished difference Result 308 states and 755 transitions. [2020-01-16 19:01:07,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:07,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:07,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:07,452 INFO L225 Difference]: With dead ends: 308 [2020-01-16 19:01:07,452 INFO L226 Difference]: Without dead ends: 292 [2020-01-16 19:01:07,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:07,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2020-01-16 19:01:07,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 184. [2020-01-16 19:01:07,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-01-16 19:01:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 524 transitions. [2020-01-16 19:01:07,457 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 524 transitions. Word has length 19 [2020-01-16 19:01:07,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:07,457 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 524 transitions. [2020-01-16 19:01:07,457 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:07,458 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 524 transitions. [2020-01-16 19:01:07,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:07,458 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:07,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 19:01:07,458 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 19:01:07,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:07,458 INFO L82 PathProgramCache]: Analyzing trace with hash -718065930, now seen corresponding path program 394 times [2020-01-16 19:01:07,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:07,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345796945] [2020-01-16 19:01:07,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:07,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 19:01:07,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345796945] [2020-01-16 19:01:07,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:07,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:07,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117017535] [2020-01-16 19:01:07,665 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:07,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:07,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:07,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:07,665 INFO L87 Difference]: Start difference. First operand 184 states and 524 transitions. Second operand 8 states. [2020-01-16 19:01:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:07,748 INFO L93 Difference]: Finished difference Result 295 states and 734 transitions. [2020-01-16 19:01:07,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:07,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:07,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:07,750 INFO L225 Difference]: With dead ends: 295 [2020-01-16 19:01:07,750 INFO L226 Difference]: Without dead ends: 278 [2020-01-16 19:01:07,750 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:07,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-01-16 19:01:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 179. [2020-01-16 19:01:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-01-16 19:01:07,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 510 transitions. [2020-01-16 19:01:07,754 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 510 transitions. Word has length 19 [2020-01-16 19:01:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:07,754 INFO L478 AbstractCegarLoop]: Abstraction has 179 states and 510 transitions. [2020-01-16 19:01:07,754 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 510 transitions. [2020-01-16 19:01:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:07,754 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:07,754 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:07,754 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 19:01:07,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:07,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1988186406, now seen corresponding path program 395 times [2020-01-16 19:01:07,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:07,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379565682] [2020-01-16 19:01:07,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:07,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 19:01:07,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379565682] [2020-01-16 19:01:07,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:07,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:07,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985483754] [2020-01-16 19:01:07,955 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:07,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:07,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:07,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:07,956 INFO L87 Difference]: Start difference. First operand 179 states and 510 transitions. Second operand 8 states. [2020-01-16 19:01:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:08,041 INFO L93 Difference]: Finished difference Result 305 states and 745 transitions. [2020-01-16 19:01:08,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:08,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:08,043 INFO L225 Difference]: With dead ends: 305 [2020-01-16 19:01:08,043 INFO L226 Difference]: Without dead ends: 291 [2020-01-16 19:01:08,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 19:01:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-01-16 19:01:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 183. [2020-01-16 19:01:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-01-16 19:01:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 518 transitions. [2020-01-16 19:01:08,048 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 518 transitions. Word has length 19 [2020-01-16 19:01:08,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:08,048 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 518 transitions. [2020-01-16 19:01:08,048 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 518 transitions. [2020-01-16 19:01:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:08,049 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:08,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 19:01:08,049 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 19:01:08,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1988781052, now seen corresponding path program 396 times [2020-01-16 19:01:08,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:08,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56843415] [2020-01-16 19:01:08,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:08,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56843415] [2020-01-16 19:01:08,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:08,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:08,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288373979] [2020-01-16 19:01:08,244 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:08,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:08,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:08,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:08,245 INFO L87 Difference]: Start difference. First operand 183 states and 518 transitions. Second operand 8 states. [2020-01-16 19:01:08,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:08,330 INFO L93 Difference]: Finished difference Result 294 states and 728 transitions. [2020-01-16 19:01:08,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:08,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:08,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:08,332 INFO L225 Difference]: With dead ends: 294 [2020-01-16 19:01:08,332 INFO L226 Difference]: Without dead ends: 272 [2020-01-16 19:01:08,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:08,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-01-16 19:01:08,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 173. [2020-01-16 19:01:08,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-01-16 19:01:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 496 transitions. [2020-01-16 19:01:08,337 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 496 transitions. Word has length 19 [2020-01-16 19:01:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:08,337 INFO L478 AbstractCegarLoop]: Abstraction has 173 states and 496 transitions. [2020-01-16 19:01:08,337 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:08,337 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 496 transitions. [2020-01-16 19:01:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:08,337 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:08,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:08,337 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 19:01:08,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:08,338 INFO L82 PathProgramCache]: Analyzing trace with hash 986570822, now seen corresponding path program 397 times [2020-01-16 19:01:08,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:08,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74844653] [2020-01-16 19:01:08,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:08,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74844653] [2020-01-16 19:01:08,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:08,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:08,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990873524] [2020-01-16 19:01:08,540 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:08,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:08,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:08,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:08,540 INFO L87 Difference]: Start difference. First operand 173 states and 496 transitions. Second operand 8 states. [2020-01-16 19:01:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:08,602 INFO L93 Difference]: Finished difference Result 303 states and 733 transitions. [2020-01-16 19:01:08,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:08,602 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:08,603 INFO L225 Difference]: With dead ends: 303 [2020-01-16 19:01:08,603 INFO L226 Difference]: Without dead ends: 287 [2020-01-16 19:01:08,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-01-16 19:01:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 179. [2020-01-16 19:01:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-01-16 19:01:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 510 transitions. [2020-01-16 19:01:08,608 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 510 transitions. Word has length 19 [2020-01-16 19:01:08,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:08,608 INFO L478 AbstractCegarLoop]: Abstraction has 179 states and 510 transitions. [2020-01-16 19:01:08,608 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 510 transitions. [2020-01-16 19:01:08,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:08,609 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:08,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:08,609 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 19:01:08,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:08,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1165155724, now seen corresponding path program 398 times [2020-01-16 19:01:08,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:08,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006240313] [2020-01-16 19:01:08,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:08,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 19:01:08,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006240313] [2020-01-16 19:01:08,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:08,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:08,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72434495] [2020-01-16 19:01:08,827 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:08,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:08,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:08,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:08,827 INFO L87 Difference]: Start difference. First operand 179 states and 510 transitions. Second operand 8 states. [2020-01-16 19:01:08,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:08,915 INFO L93 Difference]: Finished difference Result 297 states and 718 transitions. [2020-01-16 19:01:08,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:08,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:08,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:08,917 INFO L225 Difference]: With dead ends: 297 [2020-01-16 19:01:08,917 INFO L226 Difference]: Without dead ends: 284 [2020-01-16 19:01:08,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 19:01:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-01-16 19:01:08,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 176. [2020-01-16 19:01:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-01-16 19:01:08,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 503 transitions. [2020-01-16 19:01:08,922 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 503 transitions. Word has length 19 [2020-01-16 19:01:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:08,922 INFO L478 AbstractCegarLoop]: Abstraction has 176 states and 503 transitions. [2020-01-16 19:01:08,922 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 503 transitions. [2020-01-16 19:01:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:08,923 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:08,923 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:08,923 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 19:01:08,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:08,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2080662410, now seen corresponding path program 399 times [2020-01-16 19:01:08,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:08,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890673663] [2020-01-16 19:01:08,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:09,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890673663] [2020-01-16 19:01:09,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:09,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:09,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643442237] [2020-01-16 19:01:09,128 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:09,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:09,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:09,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:09,128 INFO L87 Difference]: Start difference. First operand 176 states and 503 transitions. Second operand 8 states. [2020-01-16 19:01:09,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:09,191 INFO L93 Difference]: Finished difference Result 299 states and 727 transitions. [2020-01-16 19:01:09,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:09,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:09,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:09,192 INFO L225 Difference]: With dead ends: 299 [2020-01-16 19:01:09,192 INFO L226 Difference]: Without dead ends: 283 [2020-01-16 19:01:09,192 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-01-16 19:01:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 181. [2020-01-16 19:01:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-01-16 19:01:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 512 transitions. [2020-01-16 19:01:09,197 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 512 transitions. Word has length 19 [2020-01-16 19:01:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:09,197 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 512 transitions. [2020-01-16 19:01:09,197 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 512 transitions. [2020-01-16 19:01:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:09,198 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:09,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 19:01:09,198 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 19:01:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:09,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1329600316, now seen corresponding path program 400 times [2020-01-16 19:01:09,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:09,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219079838] [2020-01-16 19:01:09,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:09,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 19:01:09,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219079838] [2020-01-16 19:01:09,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:09,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:09,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821062466] [2020-01-16 19:01:09,399 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:09,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:09,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:09,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:09,400 INFO L87 Difference]: Start difference. First operand 181 states and 512 transitions. Second operand 8 states. [2020-01-16 19:01:09,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:09,489 INFO L93 Difference]: Finished difference Result 286 states and 706 transitions. [2020-01-16 19:01:09,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:09,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:09,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:09,490 INFO L225 Difference]: With dead ends: 286 [2020-01-16 19:01:09,490 INFO L226 Difference]: Without dead ends: 269 [2020-01-16 19:01:09,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-01-16 19:01:09,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 176. [2020-01-16 19:01:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-01-16 19:01:09,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 500 transitions. [2020-01-16 19:01:09,494 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 500 transitions. Word has length 19 [2020-01-16 19:01:09,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:09,494 INFO L478 AbstractCegarLoop]: Abstraction has 176 states and 500 transitions. [2020-01-16 19:01:09,495 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:09,495 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 500 transitions. [2020-01-16 19:01:09,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:09,495 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:09,495 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:09,495 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 19:01:09,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:09,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1804719824, now seen corresponding path program 401 times [2020-01-16 19:01:09,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:09,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472335190] [2020-01-16 19:01:09,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:09,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472335190] [2020-01-16 19:01:09,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:09,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:09,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843863730] [2020-01-16 19:01:09,696 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:09,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:09,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:09,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:09,696 INFO L87 Difference]: Start difference. First operand 176 states and 500 transitions. Second operand 8 states. [2020-01-16 19:01:09,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:09,775 INFO L93 Difference]: Finished difference Result 290 states and 703 transitions. [2020-01-16 19:01:09,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:09,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:09,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:09,776 INFO L225 Difference]: With dead ends: 290 [2020-01-16 19:01:09,776 INFO L226 Difference]: Without dead ends: 280 [2020-01-16 19:01:09,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:09,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-01-16 19:01:09,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 178. [2020-01-16 19:01:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-01-16 19:01:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 503 transitions. [2020-01-16 19:01:09,780 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 503 transitions. Word has length 19 [2020-01-16 19:01:09,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:09,780 INFO L478 AbstractCegarLoop]: Abstraction has 178 states and 503 transitions. [2020-01-16 19:01:09,780 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 503 transitions. [2020-01-16 19:01:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:09,780 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:09,780 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:09,781 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 19:01:09,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:09,781 INFO L82 PathProgramCache]: Analyzing trace with hash -94106516, now seen corresponding path program 402 times [2020-01-16 19:01:09,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:09,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673854463] [2020-01-16 19:01:09,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:09,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 19:01:09,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673854463] [2020-01-16 19:01:09,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:09,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:09,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905797675] [2020-01-16 19:01:09,984 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:09,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:09,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:09,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:09,984 INFO L87 Difference]: Start difference. First operand 178 states and 503 transitions. Second operand 8 states. [2020-01-16 19:01:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:10,066 INFO L93 Difference]: Finished difference Result 283 states and 697 transitions. [2020-01-16 19:01:10,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:10,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:10,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:10,067 INFO L225 Difference]: With dead ends: 283 [2020-01-16 19:01:10,067 INFO L226 Difference]: Without dead ends: 266 [2020-01-16 19:01:10,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 19:01:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-01-16 19:01:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 173. [2020-01-16 19:01:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-01-16 19:01:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 493 transitions. [2020-01-16 19:01:10,072 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 493 transitions. Word has length 19 [2020-01-16 19:01:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:10,073 INFO L478 AbstractCegarLoop]: Abstraction has 173 states and 493 transitions. [2020-01-16 19:01:10,073 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 493 transitions. [2020-01-16 19:01:10,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:10,073 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:10,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 19:01:10,073 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 19:01:10,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:10,073 INFO L82 PathProgramCache]: Analyzing trace with hash 196668370, now seen corresponding path program 403 times [2020-01-16 19:01:10,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:10,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128033702] [2020-01-16 19:01:10,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:10,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 19:01:10,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128033702] [2020-01-16 19:01:10,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:10,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:10,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487437643] [2020-01-16 19:01:10,252 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:10,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:10,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:10,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:10,253 INFO L87 Difference]: Start difference. First operand 173 states and 493 transitions. Second operand 8 states. [2020-01-16 19:01:10,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:10,331 INFO L93 Difference]: Finished difference Result 294 states and 714 transitions. [2020-01-16 19:01:10,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:10,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:10,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:10,332 INFO L225 Difference]: With dead ends: 294 [2020-01-16 19:01:10,332 INFO L226 Difference]: Without dead ends: 280 [2020-01-16 19:01:10,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:10,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-01-16 19:01:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 177. [2020-01-16 19:01:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-01-16 19:01:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 503 transitions. [2020-01-16 19:01:10,336 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 503 transitions. Word has length 19 [2020-01-16 19:01:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:10,336 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 503 transitions. [2020-01-16 19:01:10,336 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 503 transitions. [2020-01-16 19:01:10,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:10,337 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:10,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:10,337 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 19:01:10,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash -677666956, now seen corresponding path program 404 times [2020-01-16 19:01:10,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:10,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603347339] [2020-01-16 19:01:10,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:10,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603347339] [2020-01-16 19:01:10,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:10,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:10,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725264770] [2020-01-16 19:01:10,521 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:10,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:10,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:10,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:10,521 INFO L87 Difference]: Start difference. First operand 177 states and 503 transitions. Second operand 8 states. [2020-01-16 19:01:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:10,602 INFO L93 Difference]: Finished difference Result 290 states and 703 transitions. [2020-01-16 19:01:10,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:10,602 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:10,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:10,603 INFO L225 Difference]: With dead ends: 290 [2020-01-16 19:01:10,603 INFO L226 Difference]: Without dead ends: 278 [2020-01-16 19:01:10,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 19:01:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-01-16 19:01:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 175. [2020-01-16 19:01:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-01-16 19:01:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 498 transitions. [2020-01-16 19:01:10,608 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 498 transitions. Word has length 19 [2020-01-16 19:01:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:10,608 INFO L478 AbstractCegarLoop]: Abstraction has 175 states and 498 transitions. [2020-01-16 19:01:10,608 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 498 transitions. [2020-01-16 19:01:10,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:10,609 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:10,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:10,609 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 19:01:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:10,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1686073366, now seen corresponding path program 405 times [2020-01-16 19:01:10,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:10,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366091653] [2020-01-16 19:01:10,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:10,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 19:01:10,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366091653] [2020-01-16 19:01:10,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:10,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:10,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400470721] [2020-01-16 19:01:10,795 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:10,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:10,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:10,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:10,795 INFO L87 Difference]: Start difference. First operand 175 states and 498 transitions. Second operand 8 states. [2020-01-16 19:01:10,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:10,876 INFO L93 Difference]: Finished difference Result 292 states and 712 transitions. [2020-01-16 19:01:10,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:10,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:10,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:10,877 INFO L225 Difference]: With dead ends: 292 [2020-01-16 19:01:10,877 INFO L226 Difference]: Without dead ends: 278 [2020-01-16 19:01:10,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-01-16 19:01:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 179. [2020-01-16 19:01:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-01-16 19:01:10,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 506 transitions. [2020-01-16 19:01:10,882 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 506 transitions. Word has length 19 [2020-01-16 19:01:10,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:10,882 INFO L478 AbstractCegarLoop]: Abstraction has 179 states and 506 transitions. [2020-01-16 19:01:10,882 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 506 transitions. [2020-01-16 19:01:10,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:10,883 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:10,883 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:10,883 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 19:01:10,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:10,883 INFO L82 PathProgramCache]: Analyzing trace with hash 940776222, now seen corresponding path program 406 times [2020-01-16 19:01:10,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:10,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297252526] [2020-01-16 19:01:10,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:11,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297252526] [2020-01-16 19:01:11,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:11,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:11,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170558856] [2020-01-16 19:01:11,063 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:11,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:11,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:11,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:11,063 INFO L87 Difference]: Start difference. First operand 179 states and 506 transitions. Second operand 8 states. [2020-01-16 19:01:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:11,144 INFO L93 Difference]: Finished difference Result 281 states and 695 transitions. [2020-01-16 19:01:11,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:11,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:11,145 INFO L225 Difference]: With dead ends: 281 [2020-01-16 19:01:11,145 INFO L226 Difference]: Without dead ends: 265 [2020-01-16 19:01:11,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 19:01:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-01-16 19:01:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 175. [2020-01-16 19:01:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-01-16 19:01:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 496 transitions. [2020-01-16 19:01:11,150 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 496 transitions. Word has length 19 [2020-01-16 19:01:11,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:11,150 INFO L478 AbstractCegarLoop]: Abstraction has 175 states and 496 transitions. [2020-01-16 19:01:11,150 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 496 transitions. [2020-01-16 19:01:11,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:11,150 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:11,150 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:11,150 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 19:01:11,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:11,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1249121762, now seen corresponding path program 407 times [2020-01-16 19:01:11,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:11,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294104489] [2020-01-16 19:01:11,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:11,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294104489] [2020-01-16 19:01:11,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:11,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:11,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413302979] [2020-01-16 19:01:11,341 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:11,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:11,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:11,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:11,341 INFO L87 Difference]: Start difference. First operand 175 states and 496 transitions. Second operand 8 states. [2020-01-16 19:01:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:11,420 INFO L93 Difference]: Finished difference Result 286 states and 694 transitions. [2020-01-16 19:01:11,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:11,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:11,422 INFO L225 Difference]: With dead ends: 286 [2020-01-16 19:01:11,422 INFO L226 Difference]: Without dead ends: 276 [2020-01-16 19:01:11,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2020-01-16 19:01:11,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 177. [2020-01-16 19:01:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-01-16 19:01:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 499 transitions. [2020-01-16 19:01:11,430 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 499 transitions. Word has length 19 [2020-01-16 19:01:11,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:11,430 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 499 transitions. [2020-01-16 19:01:11,430 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:11,430 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 499 transitions. [2020-01-16 19:01:11,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:11,431 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:11,431 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:11,431 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 19:01:11,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:11,431 INFO L82 PathProgramCache]: Analyzing trace with hash 461491546, now seen corresponding path program 408 times [2020-01-16 19:01:11,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:11,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950946877] [2020-01-16 19:01:11,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:11,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:11,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950946877] [2020-01-16 19:01:11,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:11,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:11,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107681603] [2020-01-16 19:01:11,618 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:11,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:11,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:11,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:11,618 INFO L87 Difference]: Start difference. First operand 177 states and 499 transitions. Second operand 8 states. [2020-01-16 19:01:11,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:11,705 INFO L93 Difference]: Finished difference Result 279 states and 688 transitions. [2020-01-16 19:01:11,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:11,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:11,706 INFO L225 Difference]: With dead ends: 279 [2020-01-16 19:01:11,706 INFO L226 Difference]: Without dead ends: 259 [2020-01-16 19:01:11,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:11,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-01-16 19:01:11,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 169. [2020-01-16 19:01:11,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-01-16 19:01:11,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 485 transitions. [2020-01-16 19:01:11,710 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 485 transitions. Word has length 19 [2020-01-16 19:01:11,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:11,711 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 485 transitions. [2020-01-16 19:01:11,711 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:11,711 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 485 transitions. [2020-01-16 19:01:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:11,711 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:11,711 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:11,711 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 19:01:11,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:11,712 INFO L82 PathProgramCache]: Analyzing trace with hash -612467258, now seen corresponding path program 409 times [2020-01-16 19:01:11,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:11,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275447436] [2020-01-16 19:01:11,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:11,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275447436] [2020-01-16 19:01:11,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:11,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:11,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347458071] [2020-01-16 19:01:11,922 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:11,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:11,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:11,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:11,922 INFO L87 Difference]: Start difference. First operand 169 states and 485 transitions. Second operand 8 states. [2020-01-16 19:01:11,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:11,981 INFO L93 Difference]: Finished difference Result 305 states and 732 transitions. [2020-01-16 19:01:11,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:11,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:11,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:11,982 INFO L225 Difference]: With dead ends: 305 [2020-01-16 19:01:11,982 INFO L226 Difference]: Without dead ends: 289 [2020-01-16 19:01:11,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 19:01:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-01-16 19:01:11,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 177. [2020-01-16 19:01:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-01-16 19:01:11,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 499 transitions. [2020-01-16 19:01:11,986 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 499 transitions. Word has length 19 [2020-01-16 19:01:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:11,986 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 499 transitions. [2020-01-16 19:01:11,986 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 499 transitions. [2020-01-16 19:01:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:11,987 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:11,987 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:11,987 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 19:01:11,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:11,987 INFO L82 PathProgramCache]: Analyzing trace with hash -237816072, now seen corresponding path program 410 times [2020-01-16 19:01:11,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:11,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518044278] [2020-01-16 19:01:11,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:12,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518044278] [2020-01-16 19:01:12,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:12,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:12,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137880133] [2020-01-16 19:01:12,194 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:12,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:12,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:12,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:12,194 INFO L87 Difference]: Start difference. First operand 177 states and 499 transitions. Second operand 8 states. [2020-01-16 19:01:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:12,277 INFO L93 Difference]: Finished difference Result 303 states and 722 transitions. [2020-01-16 19:01:12,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:12,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:12,279 INFO L225 Difference]: With dead ends: 303 [2020-01-16 19:01:12,279 INFO L226 Difference]: Without dead ends: 281 [2020-01-16 19:01:12,279 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-01-16 19:01:12,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 169. [2020-01-16 19:01:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-01-16 19:01:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 481 transitions. [2020-01-16 19:01:12,284 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 481 transitions. Word has length 19 [2020-01-16 19:01:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:12,284 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 481 transitions. [2020-01-16 19:01:12,284 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 481 transitions. [2020-01-16 19:01:12,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:12,284 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:12,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 19:01:12,284 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 19:01:12,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:12,285 INFO L82 PathProgramCache]: Analyzing trace with hash -82269952, now seen corresponding path program 411 times [2020-01-16 19:01:12,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:12,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983870945] [2020-01-16 19:01:12,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:12,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 19:01:12,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983870945] [2020-01-16 19:01:12,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:12,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:12,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725379057] [2020-01-16 19:01:12,483 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:12,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:12,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:12,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:12,484 INFO L87 Difference]: Start difference. First operand 169 states and 481 transitions. Second operand 8 states. [2020-01-16 19:01:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:12,541 INFO L93 Difference]: Finished difference Result 296 states and 705 transitions. [2020-01-16 19:01:12,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:12,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:12,542 INFO L225 Difference]: With dead ends: 296 [2020-01-16 19:01:12,542 INFO L226 Difference]: Without dead ends: 280 [2020-01-16 19:01:12,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 19:01:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-01-16 19:01:12,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 172. [2020-01-16 19:01:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-01-16 19:01:12,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 485 transitions. [2020-01-16 19:01:12,547 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 485 transitions. Word has length 19 [2020-01-16 19:01:12,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:12,547 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 485 transitions. [2020-01-16 19:01:12,547 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:12,547 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 485 transitions. [2020-01-16 19:01:12,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:12,547 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:12,547 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:12,548 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 19:01:12,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:12,548 INFO L82 PathProgramCache]: Analyzing trace with hash 176788274, now seen corresponding path program 412 times [2020-01-16 19:01:12,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:12,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503119134] [2020-01-16 19:01:12,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:12,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 19:01:12,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503119134] [2020-01-16 19:01:12,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:12,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:12,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398706838] [2020-01-16 19:01:12,748 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:12,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:12,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:12,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:12,749 INFO L87 Difference]: Start difference. First operand 172 states and 485 transitions. Second operand 8 states. [2020-01-16 19:01:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:12,808 INFO L93 Difference]: Finished difference Result 290 states and 690 transitions. [2020-01-16 19:01:12,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:12,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:12,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:12,809 INFO L225 Difference]: With dead ends: 290 [2020-01-16 19:01:12,809 INFO L226 Difference]: Without dead ends: 277 [2020-01-16 19:01:12,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-01-16 19:01:12,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 169. [2020-01-16 19:01:12,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-01-16 19:01:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 478 transitions. [2020-01-16 19:01:12,814 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 478 transitions. Word has length 19 [2020-01-16 19:01:12,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:12,814 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 478 transitions. [2020-01-16 19:01:12,814 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 478 transitions. [2020-01-16 19:01:12,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:12,814 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:12,814 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:12,815 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 19:01:12,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:12,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1840035768, now seen corresponding path program 413 times [2020-01-16 19:01:12,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:12,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297295754] [2020-01-16 19:01:12,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:13,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 19:01:13,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297295754] [2020-01-16 19:01:13,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:13,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:13,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394528301] [2020-01-16 19:01:13,012 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:13,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:13,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:13,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:13,012 INFO L87 Difference]: Start difference. First operand 169 states and 478 transitions. Second operand 8 states. [2020-01-16 19:01:13,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:13,092 INFO L93 Difference]: Finished difference Result 291 states and 694 transitions. [2020-01-16 19:01:13,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:13,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:13,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:13,093 INFO L225 Difference]: With dead ends: 291 [2020-01-16 19:01:13,093 INFO L226 Difference]: Without dead ends: 277 [2020-01-16 19:01:13,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 19:01:13,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-01-16 19:01:13,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 171. [2020-01-16 19:01:13,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-01-16 19:01:13,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 481 transitions. [2020-01-16 19:01:13,097 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 481 transitions. Word has length 19 [2020-01-16 19:01:13,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:13,098 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 481 transitions. [2020-01-16 19:01:13,098 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:13,098 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 481 transitions. [2020-01-16 19:01:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:13,098 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:13,098 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:13,098 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 19:01:13,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:13,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1334801698, now seen corresponding path program 414 times [2020-01-16 19:01:13,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:13,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956138151] [2020-01-16 19:01:13,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:13,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956138151] [2020-01-16 19:01:13,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:13,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:13,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292823816] [2020-01-16 19:01:13,298 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:13,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:13,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:13,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:13,298 INFO L87 Difference]: Start difference. First operand 171 states and 481 transitions. Second operand 8 states. [2020-01-16 19:01:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:13,362 INFO L93 Difference]: Finished difference Result 287 states and 683 transitions. [2020-01-16 19:01:13,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:13,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:13,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:13,363 INFO L225 Difference]: With dead ends: 287 [2020-01-16 19:01:13,363 INFO L226 Difference]: Without dead ends: 271 [2020-01-16 19:01:13,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-01-16 19:01:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 165. [2020-01-16 19:01:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-01-16 19:01:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 469 transitions. [2020-01-16 19:01:13,367 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 469 transitions. Word has length 19 [2020-01-16 19:01:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:13,367 INFO L478 AbstractCegarLoop]: Abstraction has 165 states and 469 transitions. [2020-01-16 19:01:13,367 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 469 transitions. [2020-01-16 19:01:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:13,367 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:13,367 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:13,368 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 19:01:13,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:13,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1034952984, now seen corresponding path program 415 times [2020-01-16 19:01:13,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:13,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113509118] [2020-01-16 19:01:13,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:13,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113509118] [2020-01-16 19:01:13,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:13,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:13,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188107210] [2020-01-16 19:01:13,580 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:13,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:13,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:13,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:13,580 INFO L87 Difference]: Start difference. First operand 165 states and 469 transitions. Second operand 8 states. [2020-01-16 19:01:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:13,640 INFO L93 Difference]: Finished difference Result 299 states and 714 transitions. [2020-01-16 19:01:13,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:13,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:13,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:13,642 INFO L225 Difference]: With dead ends: 299 [2020-01-16 19:01:13,642 INFO L226 Difference]: Without dead ends: 283 [2020-01-16 19:01:13,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-01-16 19:01:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 165. [2020-01-16 19:01:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-01-16 19:01:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 462 transitions. [2020-01-16 19:01:13,646 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 462 transitions. Word has length 19 [2020-01-16 19:01:13,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:13,646 INFO L478 AbstractCegarLoop]: Abstraction has 165 states and 462 transitions. [2020-01-16 19:01:13,646 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:13,646 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 462 transitions. [2020-01-16 19:01:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:13,647 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:13,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 19:01:13,647 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 19:01:13,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:13,647 INFO L82 PathProgramCache]: Analyzing trace with hash -660301798, now seen corresponding path program 416 times [2020-01-16 19:01:13,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:13,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399341282] [2020-01-16 19:01:13,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:13,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 19:01:13,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399341282] [2020-01-16 19:01:13,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:13,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:13,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143026903] [2020-01-16 19:01:13,852 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:13,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:13,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:13,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:13,852 INFO L87 Difference]: Start difference. First operand 165 states and 462 transitions. Second operand 8 states. [2020-01-16 19:01:13,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:13,932 INFO L93 Difference]: Finished difference Result 297 states and 704 transitions. [2020-01-16 19:01:13,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:13,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:13,933 INFO L225 Difference]: With dead ends: 297 [2020-01-16 19:01:13,933 INFO L226 Difference]: Without dead ends: 275 [2020-01-16 19:01:13,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-01-16 19:01:13,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 157. [2020-01-16 19:01:13,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-01-16 19:01:13,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 442 transitions. [2020-01-16 19:01:13,936 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 442 transitions. Word has length 19 [2020-01-16 19:01:13,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:13,937 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 442 transitions. [2020-01-16 19:01:13,937 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:13,937 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 442 transitions. [2020-01-16 19:01:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:13,937 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:13,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 19:01:13,937 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 19:01:13,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:13,937 INFO L82 PathProgramCache]: Analyzing trace with hash -179159454, now seen corresponding path program 417 times [2020-01-16 19:01:13,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:13,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067892401] [2020-01-16 19:01:13,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:14,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 19:01:14,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067892401] [2020-01-16 19:01:14,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:14,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:14,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114363203] [2020-01-16 19:01:14,146 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:14,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:14,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:14,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:14,147 INFO L87 Difference]: Start difference. First operand 157 states and 442 transitions. Second operand 8 states. [2020-01-16 19:01:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:14,209 INFO L93 Difference]: Finished difference Result 286 states and 682 transitions. [2020-01-16 19:01:14,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:14,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:14,210 INFO L225 Difference]: With dead ends: 286 [2020-01-16 19:01:14,211 INFO L226 Difference]: Without dead ends: 270 [2020-01-16 19:01:14,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-01-16 19:01:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 162. [2020-01-16 19:01:14,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-01-16 19:01:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 451 transitions. [2020-01-16 19:01:14,214 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 451 transitions. Word has length 19 [2020-01-16 19:01:14,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:14,215 INFO L478 AbstractCegarLoop]: Abstraction has 162 states and 451 transitions. [2020-01-16 19:01:14,215 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:14,215 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 451 transitions. [2020-01-16 19:01:14,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:14,215 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:14,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 19:01:14,215 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 19:01:14,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:14,216 INFO L82 PathProgramCache]: Analyzing trace with hash -930221548, now seen corresponding path program 418 times [2020-01-16 19:01:14,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:14,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006844966] [2020-01-16 19:01:14,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:14,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006844966] [2020-01-16 19:01:14,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:14,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:14,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644423734] [2020-01-16 19:01:14,420 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:14,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:14,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:14,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:14,421 INFO L87 Difference]: Start difference. First operand 162 states and 451 transitions. Second operand 8 states. [2020-01-16 19:01:14,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:14,503 INFO L93 Difference]: Finished difference Result 273 states and 661 transitions. [2020-01-16 19:01:14,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:14,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:14,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:14,504 INFO L225 Difference]: With dead ends: 273 [2020-01-16 19:01:14,504 INFO L226 Difference]: Without dead ends: 256 [2020-01-16 19:01:14,504 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-01-16 19:01:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 157. [2020-01-16 19:01:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-01-16 19:01:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 437 transitions. [2020-01-16 19:01:14,508 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 437 transitions. Word has length 19 [2020-01-16 19:01:14,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:14,508 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 437 transitions. [2020-01-16 19:01:14,508 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 437 transitions. [2020-01-16 19:01:14,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:14,509 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:14,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 19:01:14,509 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 19:01:14,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:14,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2094625272, now seen corresponding path program 419 times [2020-01-16 19:01:14,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:14,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144706084] [2020-01-16 19:01:14,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:14,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 19:01:14,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144706084] [2020-01-16 19:01:14,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:14,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:14,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174196518] [2020-01-16 19:01:14,708 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:14,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:14,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:14,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:14,708 INFO L87 Difference]: Start difference. First operand 157 states and 437 transitions. Second operand 8 states. [2020-01-16 19:01:14,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:14,787 INFO L93 Difference]: Finished difference Result 283 states and 672 transitions. [2020-01-16 19:01:14,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:14,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:14,788 INFO L225 Difference]: With dead ends: 283 [2020-01-16 19:01:14,788 INFO L226 Difference]: Without dead ends: 269 [2020-01-16 19:01:14,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 19:01:14,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-01-16 19:01:14,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 161. [2020-01-16 19:01:14,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-01-16 19:01:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 445 transitions. [2020-01-16 19:01:14,792 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 445 transitions. Word has length 19 [2020-01-16 19:01:14,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:14,793 INFO L478 AbstractCegarLoop]: Abstraction has 161 states and 445 transitions. [2020-01-16 19:01:14,793 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 445 transitions. [2020-01-16 19:01:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:14,793 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:14,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 19:01:14,793 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 19:01:14,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:14,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2094030626, now seen corresponding path program 420 times [2020-01-16 19:01:14,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:14,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304451385] [2020-01-16 19:01:14,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:14,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304451385] [2020-01-16 19:01:14,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:14,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:14,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694091566] [2020-01-16 19:01:14,993 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:14,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:14,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:14,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:14,993 INFO L87 Difference]: Start difference. First operand 161 states and 445 transitions. Second operand 8 states. [2020-01-16 19:01:15,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:15,074 INFO L93 Difference]: Finished difference Result 272 states and 655 transitions. [2020-01-16 19:01:15,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:15,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:15,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:15,075 INFO L225 Difference]: With dead ends: 272 [2020-01-16 19:01:15,075 INFO L226 Difference]: Without dead ends: 250 [2020-01-16 19:01:15,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 19:01:15,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-01-16 19:01:15,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 151. [2020-01-16 19:01:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 19:01:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 423 transitions. [2020-01-16 19:01:15,079 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 423 transitions. Word has length 19 [2020-01-16 19:01:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:15,079 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 423 transitions. [2020-01-16 19:01:15,079 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 423 transitions. [2020-01-16 19:01:15,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:15,080 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:15,080 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:15,080 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 19:01:15,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:15,080 INFO L82 PathProgramCache]: Analyzing trace with hash 677525702, now seen corresponding path program 421 times [2020-01-16 19:01:15,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:15,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758435626] [2020-01-16 19:01:15,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:15,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 19:01:15,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758435626] [2020-01-16 19:01:15,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:15,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:15,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836184899] [2020-01-16 19:01:15,285 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:15,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:15,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:15,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:15,285 INFO L87 Difference]: Start difference. First operand 151 states and 423 transitions. Second operand 8 states. [2020-01-16 19:01:15,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:15,350 INFO L93 Difference]: Finished difference Result 273 states and 645 transitions. [2020-01-16 19:01:15,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:15,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:15,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:15,351 INFO L225 Difference]: With dead ends: 273 [2020-01-16 19:01:15,351 INFO L226 Difference]: Without dead ends: 257 [2020-01-16 19:01:15,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:15,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-01-16 19:01:15,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 157. [2020-01-16 19:01:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-01-16 19:01:15,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 437 transitions. [2020-01-16 19:01:15,356 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 437 transitions. Word has length 19 [2020-01-16 19:01:15,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:15,356 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 437 transitions. [2020-01-16 19:01:15,356 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:15,356 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 437 transitions. [2020-01-16 19:01:15,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:15,357 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:15,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:15,357 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 19:01:15,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:15,357 INFO L82 PathProgramCache]: Analyzing trace with hash 936583928, now seen corresponding path program 422 times [2020-01-16 19:01:15,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:15,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594170878] [2020-01-16 19:01:15,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:15,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594170878] [2020-01-16 19:01:15,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:15,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:15,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198931778] [2020-01-16 19:01:15,560 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:15,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:15,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:15,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:15,560 INFO L87 Difference]: Start difference. First operand 157 states and 437 transitions. Second operand 8 states. [2020-01-16 19:01:15,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:15,630 INFO L93 Difference]: Finished difference Result 267 states and 630 transitions. [2020-01-16 19:01:15,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:15,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:15,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:15,631 INFO L225 Difference]: With dead ends: 267 [2020-01-16 19:01:15,631 INFO L226 Difference]: Without dead ends: 254 [2020-01-16 19:01:15,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:15,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-01-16 19:01:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 154. [2020-01-16 19:01:15,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-01-16 19:01:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 430 transitions. [2020-01-16 19:01:15,635 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 430 transitions. Word has length 19 [2020-01-16 19:01:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:15,635 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 430 transitions. [2020-01-16 19:01:15,635 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:15,635 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 430 transitions. [2020-01-16 19:01:15,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:15,635 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:15,635 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:15,635 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 19:01:15,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:15,636 INFO L82 PathProgramCache]: Analyzing trace with hash -922912152, now seen corresponding path program 423 times [2020-01-16 19:01:15,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:15,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215816585] [2020-01-16 19:01:15,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:15,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215816585] [2020-01-16 19:01:15,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:15,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:15,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099163567] [2020-01-16 19:01:15,843 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:15,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:15,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:15,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:15,844 INFO L87 Difference]: Start difference. First operand 154 states and 430 transitions. Second operand 8 states. [2020-01-16 19:01:15,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:15,909 INFO L93 Difference]: Finished difference Result 264 states and 625 transitions. [2020-01-16 19:01:15,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:15,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:15,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:15,910 INFO L225 Difference]: With dead ends: 264 [2020-01-16 19:01:15,911 INFO L226 Difference]: Without dead ends: 248 [2020-01-16 19:01:15,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 19:01:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-01-16 19:01:15,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 159. [2020-01-16 19:01:15,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-01-16 19:01:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 439 transitions. [2020-01-16 19:01:15,915 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 439 transitions. Word has length 19 [2020-01-16 19:01:15,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:15,915 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 439 transitions. [2020-01-16 19:01:15,915 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 439 transitions. [2020-01-16 19:01:15,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:15,916 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:15,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 19:01:15,916 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 19:01:15,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:15,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1673974246, now seen corresponding path program 424 times [2020-01-16 19:01:15,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:15,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317186326] [2020-01-16 19:01:15,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:16,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317186326] [2020-01-16 19:01:16,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:16,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:16,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449336036] [2020-01-16 19:01:16,121 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:16,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:16,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:16,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:16,121 INFO L87 Difference]: Start difference. First operand 159 states and 439 transitions. Second operand 8 states. [2020-01-16 19:01:16,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:16,208 INFO L93 Difference]: Finished difference Result 251 states and 604 transitions. [2020-01-16 19:01:16,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:16,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:16,209 INFO L225 Difference]: With dead ends: 251 [2020-01-16 19:01:16,209 INFO L226 Difference]: Without dead ends: 234 [2020-01-16 19:01:16,209 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-01-16 19:01:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 154. [2020-01-16 19:01:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-01-16 19:01:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 427 transitions. [2020-01-16 19:01:16,213 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 427 transitions. Word has length 19 [2020-01-16 19:01:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:16,213 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 427 transitions. [2020-01-16 19:01:16,213 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:16,214 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 427 transitions. [2020-01-16 19:01:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:16,214 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:16,214 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:16,214 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 19:01:16,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:16,214 INFO L82 PathProgramCache]: Analyzing trace with hash -522490524, now seen corresponding path program 425 times [2020-01-16 19:01:16,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:16,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192901910] [2020-01-16 19:01:16,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:16,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 19:01:16,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192901910] [2020-01-16 19:01:16,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:16,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:16,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251917560] [2020-01-16 19:01:16,423 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:16,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:16,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:16,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:16,423 INFO L87 Difference]: Start difference. First operand 154 states and 427 transitions. Second operand 8 states. [2020-01-16 19:01:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:16,492 INFO L93 Difference]: Finished difference Result 246 states and 592 transitions. [2020-01-16 19:01:16,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:16,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:16,493 INFO L225 Difference]: With dead ends: 246 [2020-01-16 19:01:16,493 INFO L226 Difference]: Without dead ends: 236 [2020-01-16 19:01:16,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:16,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-01-16 19:01:16,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 156. [2020-01-16 19:01:16,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-01-16 19:01:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 430 transitions. [2020-01-16 19:01:16,497 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 430 transitions. Word has length 19 [2020-01-16 19:01:16,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:16,497 INFO L478 AbstractCegarLoop]: Abstraction has 156 states and 430 transitions. [2020-01-16 19:01:16,497 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 430 transitions. [2020-01-16 19:01:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:16,497 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:16,497 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:16,497 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 19:01:16,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:16,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1377797178, now seen corresponding path program 426 times [2020-01-16 19:01:16,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:16,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305152298] [2020-01-16 19:01:16,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:16,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305152298] [2020-01-16 19:01:16,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:16,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:16,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025506942] [2020-01-16 19:01:16,703 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:16,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:16,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:16,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:16,703 INFO L87 Difference]: Start difference. First operand 156 states and 430 transitions. Second operand 8 states. [2020-01-16 19:01:16,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:16,790 INFO L93 Difference]: Finished difference Result 235 states and 578 transitions. [2020-01-16 19:01:16,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:16,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:16,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:16,791 INFO L225 Difference]: With dead ends: 235 [2020-01-16 19:01:16,791 INFO L226 Difference]: Without dead ends: 218 [2020-01-16 19:01:16,792 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:16,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-01-16 19:01:16,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 151. [2020-01-16 19:01:16,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 19:01:16,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 420 transitions. [2020-01-16 19:01:16,796 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 420 transitions. Word has length 19 [2020-01-16 19:01:16,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:16,797 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 420 transitions. [2020-01-16 19:01:16,797 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:16,797 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 420 transitions. [2020-01-16 19:01:16,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:16,797 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:16,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 19:01:16,797 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 19:01:16,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:16,798 INFO L82 PathProgramCache]: Analyzing trace with hash -722039428, now seen corresponding path program 427 times [2020-01-16 19:01:16,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:16,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528877755] [2020-01-16 19:01:16,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:16,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 19:01:16,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528877755] [2020-01-16 19:01:16,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:16,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:16,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986990130] [2020-01-16 19:01:16,999 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:17,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:17,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:17,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:17,000 INFO L87 Difference]: Start difference. First operand 151 states and 420 transitions. Second operand 8 states. [2020-01-16 19:01:17,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:17,083 INFO L93 Difference]: Finished difference Result 266 states and 629 transitions. [2020-01-16 19:01:17,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:17,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:17,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:17,084 INFO L225 Difference]: With dead ends: 266 [2020-01-16 19:01:17,084 INFO L226 Difference]: Without dead ends: 252 [2020-01-16 19:01:17,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 19:01:17,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2020-01-16 19:01:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 155. [2020-01-16 19:01:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-01-16 19:01:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 430 transitions. [2020-01-16 19:01:17,089 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 430 transitions. Word has length 19 [2020-01-16 19:01:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:17,089 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 430 transitions. [2020-01-16 19:01:17,089 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 430 transitions. [2020-01-16 19:01:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:17,089 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:17,090 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:17,090 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 19:01:17,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:17,090 INFO L82 PathProgramCache]: Analyzing trace with hash 398090402, now seen corresponding path program 428 times [2020-01-16 19:01:17,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:17,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507151047] [2020-01-16 19:01:17,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:17,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 19:01:17,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507151047] [2020-01-16 19:01:17,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:17,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:17,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122660957] [2020-01-16 19:01:17,292 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:17,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:17,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:17,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:17,293 INFO L87 Difference]: Start difference. First operand 155 states and 430 transitions. Second operand 8 states. [2020-01-16 19:01:17,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:17,357 INFO L93 Difference]: Finished difference Result 262 states and 618 transitions. [2020-01-16 19:01:17,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:17,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:17,359 INFO L225 Difference]: With dead ends: 262 [2020-01-16 19:01:17,359 INFO L226 Difference]: Without dead ends: 250 [2020-01-16 19:01:17,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:17,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-01-16 19:01:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 153. [2020-01-16 19:01:17,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-01-16 19:01:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 425 transitions. [2020-01-16 19:01:17,363 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 425 transitions. Word has length 19 [2020-01-16 19:01:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:17,363 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 425 transitions. [2020-01-16 19:01:17,363 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 425 transitions. [2020-01-16 19:01:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:17,364 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:17,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 19:01:17,364 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 19:01:17,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:17,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1466741926, now seen corresponding path program 429 times [2020-01-16 19:01:17,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:17,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706107436] [2020-01-16 19:01:17,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:17,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 19:01:17,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706107436] [2020-01-16 19:01:17,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:17,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:17,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16380704] [2020-01-16 19:01:17,544 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:17,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:17,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:17,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:17,545 INFO L87 Difference]: Start difference. First operand 153 states and 425 transitions. Second operand 8 states. [2020-01-16 19:01:17,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:17,623 INFO L93 Difference]: Finished difference Result 260 states and 615 transitions. [2020-01-16 19:01:17,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:17,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:17,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:17,625 INFO L225 Difference]: With dead ends: 260 [2020-01-16 19:01:17,625 INFO L226 Difference]: Without dead ends: 246 [2020-01-16 19:01:17,625 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-01-16 19:01:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 157. [2020-01-16 19:01:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-01-16 19:01:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 433 transitions. [2020-01-16 19:01:17,628 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 433 transitions. Word has length 19 [2020-01-16 19:01:17,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:17,628 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 433 transitions. [2020-01-16 19:01:17,628 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:17,628 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 433 transitions. [2020-01-16 19:01:17,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:17,629 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:17,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 19:01:17,629 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 19:01:17,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:17,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2082928226, now seen corresponding path program 430 times [2020-01-16 19:01:17,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:17,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114611740] [2020-01-16 19:01:17,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:17,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114611740] [2020-01-16 19:01:17,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:17,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:17,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168362734] [2020-01-16 19:01:17,813 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:17,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:17,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:17,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:17,813 INFO L87 Difference]: Start difference. First operand 157 states and 433 transitions. Second operand 8 states. [2020-01-16 19:01:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:17,898 INFO L93 Difference]: Finished difference Result 249 states and 598 transitions. [2020-01-16 19:01:17,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:17,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:17,900 INFO L225 Difference]: With dead ends: 249 [2020-01-16 19:01:17,900 INFO L226 Difference]: Without dead ends: 233 [2020-01-16 19:01:17,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 19:01:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-01-16 19:01:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 153. [2020-01-16 19:01:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-01-16 19:01:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 423 transitions. [2020-01-16 19:01:17,904 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 423 transitions. Word has length 19 [2020-01-16 19:01:17,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:17,904 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 423 transitions. [2020-01-16 19:01:17,904 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:17,904 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 423 transitions. [2020-01-16 19:01:17,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:17,905 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:17,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 19:01:17,905 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 19:01:17,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:17,905 INFO L82 PathProgramCache]: Analyzing trace with hash -137139400, now seen corresponding path program 431 times [2020-01-16 19:01:17,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:17,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945440653] [2020-01-16 19:01:17,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:18,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945440653] [2020-01-16 19:01:18,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:18,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:18,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219557134] [2020-01-16 19:01:18,104 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:18,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:18,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:18,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:18,104 INFO L87 Difference]: Start difference. First operand 153 states and 423 transitions. Second operand 8 states. [2020-01-16 19:01:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:18,167 INFO L93 Difference]: Finished difference Result 245 states and 588 transitions. [2020-01-16 19:01:18,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:18,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:18,169 INFO L225 Difference]: With dead ends: 245 [2020-01-16 19:01:18,169 INFO L226 Difference]: Without dead ends: 235 [2020-01-16 19:01:18,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:18,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-01-16 19:01:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 155. [2020-01-16 19:01:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-01-16 19:01:18,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 426 transitions. [2020-01-16 19:01:18,173 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 426 transitions. Word has length 19 [2020-01-16 19:01:18,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:18,173 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 426 transitions. [2020-01-16 19:01:18,173 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 426 transitions. [2020-01-16 19:01:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:18,173 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:18,173 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:18,173 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 19:01:18,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:18,174 INFO L82 PathProgramCache]: Analyzing trace with hash -992446054, now seen corresponding path program 432 times [2020-01-16 19:01:18,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:18,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141164620] [2020-01-16 19:01:18,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:18,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141164620] [2020-01-16 19:01:18,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:18,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:18,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473189414] [2020-01-16 19:01:18,362 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:18,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:18,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:18,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:18,363 INFO L87 Difference]: Start difference. First operand 155 states and 426 transitions. Second operand 8 states. [2020-01-16 19:01:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:18,442 INFO L93 Difference]: Finished difference Result 234 states and 574 transitions. [2020-01-16 19:01:18,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:18,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:18,443 INFO L225 Difference]: With dead ends: 234 [2020-01-16 19:01:18,443 INFO L226 Difference]: Without dead ends: 214 [2020-01-16 19:01:18,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-01-16 19:01:18,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 147. [2020-01-16 19:01:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 19:01:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 412 transitions. [2020-01-16 19:01:18,447 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 412 transitions. Word has length 19 [2020-01-16 19:01:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:18,447 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 412 transitions. [2020-01-16 19:01:18,447 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 412 transitions. [2020-01-16 19:01:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:18,448 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:18,448 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:18,448 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 19:01:18,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:18,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1774006882, now seen corresponding path program 433 times [2020-01-16 19:01:18,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:18,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471710886] [2020-01-16 19:01:18,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:18,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471710886] [2020-01-16 19:01:18,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:18,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:18,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697962014] [2020-01-16 19:01:18,657 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:18,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:18,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:18,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:18,657 INFO L87 Difference]: Start difference. First operand 147 states and 412 transitions. Second operand 8 states. [2020-01-16 19:01:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:18,720 INFO L93 Difference]: Finished difference Result 260 states and 610 transitions. [2020-01-16 19:01:18,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:18,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:18,721 INFO L225 Difference]: With dead ends: 260 [2020-01-16 19:01:18,722 INFO L226 Difference]: Without dead ends: 244 [2020-01-16 19:01:18,722 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-01-16 19:01:18,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 154. [2020-01-16 19:01:18,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-01-16 19:01:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 430 transitions. [2020-01-16 19:01:18,725 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 430 transitions. Word has length 19 [2020-01-16 19:01:18,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:18,728 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 430 transitions. [2020-01-16 19:01:18,729 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 430 transitions. [2020-01-16 19:01:18,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:18,729 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:18,729 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:18,729 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 19:01:18,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:18,729 INFO L82 PathProgramCache]: Analyzing trace with hash -377719664, now seen corresponding path program 434 times [2020-01-16 19:01:18,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:18,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020314962] [2020-01-16 19:01:18,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:18,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 19:01:18,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020314962] [2020-01-16 19:01:18,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:18,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:18,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81951868] [2020-01-16 19:01:18,933 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:18,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:18,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:18,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:18,934 INFO L87 Difference]: Start difference. First operand 154 states and 430 transitions. Second operand 8 states. [2020-01-16 19:01:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:19,015 INFO L93 Difference]: Finished difference Result 254 states and 595 transitions. [2020-01-16 19:01:19,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:19,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:19,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:19,016 INFO L225 Difference]: With dead ends: 254 [2020-01-16 19:01:19,016 INFO L226 Difference]: Without dead ends: 241 [2020-01-16 19:01:19,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 19:01:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-01-16 19:01:19,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 151. [2020-01-16 19:01:19,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 19:01:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 424 transitions. [2020-01-16 19:01:19,020 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 424 transitions. Word has length 19 [2020-01-16 19:01:19,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:19,020 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 424 transitions. [2020-01-16 19:01:19,020 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:19,020 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 424 transitions. [2020-01-16 19:01:19,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:19,020 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:19,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 19:01:19,020 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 19:01:19,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:19,021 INFO L82 PathProgramCache]: Analyzing trace with hash 173569028, now seen corresponding path program 435 times [2020-01-16 19:01:19,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:19,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615104442] [2020-01-16 19:01:19,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:19,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615104442] [2020-01-16 19:01:19,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:19,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:19,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129728941] [2020-01-16 19:01:19,229 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:19,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:19,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:19,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:19,229 INFO L87 Difference]: Start difference. First operand 151 states and 424 transitions. Second operand 8 states. [2020-01-16 19:01:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:19,286 INFO L93 Difference]: Finished difference Result 260 states and 608 transitions. [2020-01-16 19:01:19,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:19,287 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:19,288 INFO L225 Difference]: With dead ends: 260 [2020-01-16 19:01:19,288 INFO L226 Difference]: Without dead ends: 244 [2020-01-16 19:01:19,288 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:19,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-01-16 19:01:19,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 154. [2020-01-16 19:01:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-01-16 19:01:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 428 transitions. [2020-01-16 19:01:19,291 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 428 transitions. Word has length 19 [2020-01-16 19:01:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:19,291 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 428 transitions. [2020-01-16 19:01:19,291 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 428 transitions. [2020-01-16 19:01:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:19,292 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:19,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 19:01:19,292 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 19:01:19,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:19,292 INFO L82 PathProgramCache]: Analyzing trace with hash 432627254, now seen corresponding path program 436 times [2020-01-16 19:01:19,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:19,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477477924] [2020-01-16 19:01:19,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:19,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477477924] [2020-01-16 19:01:19,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:19,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:19,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107124724] [2020-01-16 19:01:19,499 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:19,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:19,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:19,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:19,500 INFO L87 Difference]: Start difference. First operand 154 states and 428 transitions. Second operand 8 states. [2020-01-16 19:01:19,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:19,562 INFO L93 Difference]: Finished difference Result 254 states and 593 transitions. [2020-01-16 19:01:19,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:19,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:19,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:19,563 INFO L225 Difference]: With dead ends: 254 [2020-01-16 19:01:19,563 INFO L226 Difference]: Without dead ends: 241 [2020-01-16 19:01:19,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 19:01:19,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-01-16 19:01:19,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 151. [2020-01-16 19:01:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 19:01:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 422 transitions. [2020-01-16 19:01:19,567 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 422 transitions. Word has length 19 [2020-01-16 19:01:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:19,567 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 422 transitions. [2020-01-16 19:01:19,567 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:19,567 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 422 transitions. [2020-01-16 19:01:19,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:19,567 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:19,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 19:01:19,567 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 19:01:19,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:19,568 INFO L82 PathProgramCache]: Analyzing trace with hash -807811068, now seen corresponding path program 437 times [2020-01-16 19:01:19,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:19,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148757710] [2020-01-16 19:01:19,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:19,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148757710] [2020-01-16 19:01:19,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:19,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:19,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042064833] [2020-01-16 19:01:19,783 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:19,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:19,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:19,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:19,784 INFO L87 Difference]: Start difference. First operand 151 states and 422 transitions. Second operand 8 states. [2020-01-16 19:01:19,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:19,865 INFO L93 Difference]: Finished difference Result 246 states and 577 transitions. [2020-01-16 19:01:19,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:19,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:19,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:19,866 INFO L225 Difference]: With dead ends: 246 [2020-01-16 19:01:19,866 INFO L226 Difference]: Without dead ends: 236 [2020-01-16 19:01:19,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 19:01:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-01-16 19:01:19,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 152. [2020-01-16 19:01:19,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 19:01:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 423 transitions. [2020-01-16 19:01:19,870 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 423 transitions. Word has length 19 [2020-01-16 19:01:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:19,870 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 423 transitions. [2020-01-16 19:01:19,870 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 423 transitions. [2020-01-16 19:01:19,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:19,870 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:19,870 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:19,870 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 19:01:19,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:19,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1047453406, now seen corresponding path program 438 times [2020-01-16 19:01:19,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:19,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967099964] [2020-01-16 19:01:19,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:20,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 19:01:20,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967099964] [2020-01-16 19:01:20,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:20,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:20,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892384563] [2020-01-16 19:01:20,090 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:20,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:20,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:20,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:20,090 INFO L87 Difference]: Start difference. First operand 152 states and 423 transitions. Second operand 8 states. [2020-01-16 19:01:20,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:20,155 INFO L93 Difference]: Finished difference Result 246 states and 576 transitions. [2020-01-16 19:01:20,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:20,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:20,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:20,156 INFO L225 Difference]: With dead ends: 246 [2020-01-16 19:01:20,157 INFO L226 Difference]: Without dead ends: 233 [2020-01-16 19:01:20,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 19:01:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-01-16 19:01:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 149. [2020-01-16 19:01:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 19:01:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 418 transitions. [2020-01-16 19:01:20,161 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 418 transitions. Word has length 19 [2020-01-16 19:01:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:20,161 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 418 transitions. [2020-01-16 19:01:20,161 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 418 transitions. [2020-01-16 19:01:20,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:20,161 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:20,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 19:01:20,161 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 19:01:20,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash -594926336, now seen corresponding path program 439 times [2020-01-16 19:01:20,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:20,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901658904] [2020-01-16 19:01:20,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:20,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901658904] [2020-01-16 19:01:20,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:20,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:20,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748210148] [2020-01-16 19:01:20,376 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:20,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:20,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:20,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:20,377 INFO L87 Difference]: Start difference. First operand 149 states and 418 transitions. Second operand 8 states. [2020-01-16 19:01:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:20,437 INFO L93 Difference]: Finished difference Result 258 states and 603 transitions. [2020-01-16 19:01:20,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:20,437 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:20,438 INFO L225 Difference]: With dead ends: 258 [2020-01-16 19:01:20,438 INFO L226 Difference]: Without dead ends: 242 [2020-01-16 19:01:20,438 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:20,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-01-16 19:01:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 155. [2020-01-16 19:01:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-01-16 19:01:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 432 transitions. [2020-01-16 19:01:20,442 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 432 transitions. Word has length 19 [2020-01-16 19:01:20,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:20,442 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 432 transitions. [2020-01-16 19:01:20,442 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 432 transitions. [2020-01-16 19:01:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:20,443 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:20,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:20,443 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 19:01:20,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:20,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1548314414, now seen corresponding path program 440 times [2020-01-16 19:01:20,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:20,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187774222] [2020-01-16 19:01:20,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:20,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:20,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187774222] [2020-01-16 19:01:20,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:20,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:20,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359953778] [2020-01-16 19:01:20,649 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:20,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:20,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:20,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:20,650 INFO L87 Difference]: Start difference. First operand 155 states and 432 transitions. Second operand 8 states. [2020-01-16 19:01:20,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:20,732 INFO L93 Difference]: Finished difference Result 252 states and 588 transitions. [2020-01-16 19:01:20,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:20,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:20,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:20,733 INFO L225 Difference]: With dead ends: 252 [2020-01-16 19:01:20,734 INFO L226 Difference]: Without dead ends: 239 [2020-01-16 19:01:20,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 19:01:20,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-01-16 19:01:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 152. [2020-01-16 19:01:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 19:01:20,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 425 transitions. [2020-01-16 19:01:20,737 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 425 transitions. Word has length 19 [2020-01-16 19:01:20,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:20,737 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 425 transitions. [2020-01-16 19:01:20,738 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 425 transitions. [2020-01-16 19:01:20,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:20,738 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:20,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 19:01:20,738 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 19:01:20,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:20,738 INFO L82 PathProgramCache]: Analyzing trace with hash 499165252, now seen corresponding path program 441 times [2020-01-16 19:01:20,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:20,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281855022] [2020-01-16 19:01:20,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:20,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 19:01:20,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281855022] [2020-01-16 19:01:20,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:20,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:20,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375356915] [2020-01-16 19:01:20,954 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:20,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:20,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:20,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:20,954 INFO L87 Difference]: Start difference. First operand 152 states and 425 transitions. Second operand 8 states. [2020-01-16 19:01:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:21,013 INFO L93 Difference]: Finished difference Result 254 states and 597 transitions. [2020-01-16 19:01:21,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:21,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:21,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:21,015 INFO L225 Difference]: With dead ends: 254 [2020-01-16 19:01:21,015 INFO L226 Difference]: Without dead ends: 238 [2020-01-16 19:01:21,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 19:01:21,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-01-16 19:01:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 157. [2020-01-16 19:01:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-01-16 19:01:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 434 transitions. [2020-01-16 19:01:21,018 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 434 transitions. Word has length 19 [2020-01-16 19:01:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:21,018 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 434 transitions. [2020-01-16 19:01:21,019 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 434 transitions. [2020-01-16 19:01:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:21,019 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:21,019 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:21,019 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 19:01:21,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:21,019 INFO L82 PathProgramCache]: Analyzing trace with hash -251896842, now seen corresponding path program 442 times [2020-01-16 19:01:21,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:21,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323688465] [2020-01-16 19:01:21,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:21,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323688465] [2020-01-16 19:01:21,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:21,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:21,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618645616] [2020-01-16 19:01:21,232 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:21,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:21,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:21,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:21,232 INFO L87 Difference]: Start difference. First operand 157 states and 434 transitions. Second operand 8 states. [2020-01-16 19:01:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:21,316 INFO L93 Difference]: Finished difference Result 241 states and 576 transitions. [2020-01-16 19:01:21,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:21,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:21,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:21,317 INFO L225 Difference]: With dead ends: 241 [2020-01-16 19:01:21,317 INFO L226 Difference]: Without dead ends: 224 [2020-01-16 19:01:21,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 19:01:21,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-01-16 19:01:21,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 152. [2020-01-16 19:01:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 19:01:21,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 422 transitions. [2020-01-16 19:01:21,322 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 422 transitions. Word has length 19 [2020-01-16 19:01:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:21,322 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 422 transitions. [2020-01-16 19:01:21,322 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 422 transitions. [2020-01-16 19:01:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:21,323 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:21,323 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:21,323 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 19:01:21,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:21,323 INFO L82 PathProgramCache]: Analyzing trace with hash 908750314, now seen corresponding path program 443 times [2020-01-16 19:01:21,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:21,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145838517] [2020-01-16 19:01:21,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:21,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 19:01:21,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145838517] [2020-01-16 19:01:21,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:21,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:21,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173227574] [2020-01-16 19:01:21,531 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:21,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:21,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:21,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:21,531 INFO L87 Difference]: Start difference. First operand 152 states and 422 transitions. Second operand 8 states. [2020-01-16 19:01:21,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:21,622 INFO L93 Difference]: Finished difference Result 245 states and 573 transitions. [2020-01-16 19:01:21,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:21,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:21,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:21,624 INFO L225 Difference]: With dead ends: 245 [2020-01-16 19:01:21,624 INFO L226 Difference]: Without dead ends: 235 [2020-01-16 19:01:21,624 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:21,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-01-16 19:01:21,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 154. [2020-01-16 19:01:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-01-16 19:01:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 425 transitions. [2020-01-16 19:01:21,628 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 425 transitions. Word has length 19 [2020-01-16 19:01:21,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:21,628 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 425 transitions. [2020-01-16 19:01:21,628 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 425 transitions. [2020-01-16 19:01:21,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:21,629 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:21,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 19:01:21,629 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 19:01:21,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:21,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1675603674, now seen corresponding path program 444 times [2020-01-16 19:01:21,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:21,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723706688] [2020-01-16 19:01:21,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:21,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723706688] [2020-01-16 19:01:21,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:21,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:21,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130546895] [2020-01-16 19:01:21,845 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:21,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:21,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:21,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:21,845 INFO L87 Difference]: Start difference. First operand 154 states and 425 transitions. Second operand 8 states. [2020-01-16 19:01:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:21,927 INFO L93 Difference]: Finished difference Result 238 states and 567 transitions. [2020-01-16 19:01:21,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:21,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:21,928 INFO L225 Difference]: With dead ends: 238 [2020-01-16 19:01:21,928 INFO L226 Difference]: Without dead ends: 221 [2020-01-16 19:01:21,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:21,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-01-16 19:01:21,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 149. [2020-01-16 19:01:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 19:01:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 416 transitions. [2020-01-16 19:01:21,932 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 416 transitions. Word has length 19 [2020-01-16 19:01:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:21,933 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 416 transitions. [2020-01-16 19:01:21,933 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 416 transitions. [2020-01-16 19:01:21,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:21,933 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:21,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 19:01:21,933 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 19:01:21,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:21,934 INFO L82 PathProgramCache]: Analyzing trace with hash -269330112, now seen corresponding path program 445 times [2020-01-16 19:01:21,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:21,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115049988] [2020-01-16 19:01:21,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:22,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115049988] [2020-01-16 19:01:22,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:22,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:22,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609281611] [2020-01-16 19:01:22,170 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:22,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:22,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:22,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:22,171 INFO L87 Difference]: Start difference. First operand 149 states and 416 transitions. Second operand 8 states. [2020-01-16 19:01:22,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:22,234 INFO L93 Difference]: Finished difference Result 244 states and 569 transitions. [2020-01-16 19:01:22,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:22,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:22,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:22,235 INFO L225 Difference]: With dead ends: 244 [2020-01-16 19:01:22,236 INFO L226 Difference]: Without dead ends: 228 [2020-01-16 19:01:22,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 19:01:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-01-16 19:01:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 155. [2020-01-16 19:01:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-01-16 19:01:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 430 transitions. [2020-01-16 19:01:22,240 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 430 transitions. Word has length 19 [2020-01-16 19:01:22,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:22,240 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 430 transitions. [2020-01-16 19:01:22,240 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:22,240 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 430 transitions. [2020-01-16 19:01:22,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:22,240 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:22,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 19:01:22,240 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 19:01:22,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:22,241 INFO L82 PathProgramCache]: Analyzing trace with hash -10271886, now seen corresponding path program 446 times [2020-01-16 19:01:22,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:22,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476930296] [2020-01-16 19:01:22,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:22,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476930296] [2020-01-16 19:01:22,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:22,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:22,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574698400] [2020-01-16 19:01:22,459 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:22,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:22,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:22,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:22,459 INFO L87 Difference]: Start difference. First operand 155 states and 430 transitions. Second operand 8 states. [2020-01-16 19:01:22,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:22,518 INFO L93 Difference]: Finished difference Result 238 states and 554 transitions. [2020-01-16 19:01:22,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:22,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:22,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:22,519 INFO L225 Difference]: With dead ends: 238 [2020-01-16 19:01:22,519 INFO L226 Difference]: Without dead ends: 225 [2020-01-16 19:01:22,519 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:22,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-01-16 19:01:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 152. [2020-01-16 19:01:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 19:01:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 423 transitions. [2020-01-16 19:01:22,522 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 423 transitions. Word has length 19 [2020-01-16 19:01:22,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:22,522 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 423 transitions. [2020-01-16 19:01:22,523 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 423 transitions. [2020-01-16 19:01:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:22,523 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:22,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 19:01:22,523 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 19:01:22,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:22,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1869767966, now seen corresponding path program 447 times [2020-01-16 19:01:22,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:22,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839870509] [2020-01-16 19:01:22,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:22,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839870509] [2020-01-16 19:01:22,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:22,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:22,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408274490] [2020-01-16 19:01:22,742 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:22,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:22,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:22,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:22,742 INFO L87 Difference]: Start difference. First operand 152 states and 423 transitions. Second operand 8 states. [2020-01-16 19:01:22,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:22,805 INFO L93 Difference]: Finished difference Result 235 states and 549 transitions. [2020-01-16 19:01:22,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:22,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:22,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:22,806 INFO L225 Difference]: With dead ends: 235 [2020-01-16 19:01:22,806 INFO L226 Difference]: Without dead ends: 219 [2020-01-16 19:01:22,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:22,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-01-16 19:01:22,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 157. [2020-01-16 19:01:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-01-16 19:01:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 432 transitions. [2020-01-16 19:01:22,809 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 432 transitions. Word has length 19 [2020-01-16 19:01:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:22,810 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 432 transitions. [2020-01-16 19:01:22,810 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:22,810 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 432 transitions. [2020-01-16 19:01:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:22,810 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:22,810 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:22,810 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 19:01:22,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:22,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1674137236, now seen corresponding path program 448 times [2020-01-16 19:01:22,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:22,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725518762] [2020-01-16 19:01:22,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:23,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 19:01:23,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725518762] [2020-01-16 19:01:23,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:23,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:23,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077864967] [2020-01-16 19:01:23,042 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:23,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:23,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:23,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:23,042 INFO L87 Difference]: Start difference. First operand 157 states and 432 transitions. Second operand 8 states. [2020-01-16 19:01:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:23,126 INFO L93 Difference]: Finished difference Result 222 states and 528 transitions. [2020-01-16 19:01:23,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:23,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:23,128 INFO L225 Difference]: With dead ends: 222 [2020-01-16 19:01:23,128 INFO L226 Difference]: Without dead ends: 205 [2020-01-16 19:01:23,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:23,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-01-16 19:01:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 152. [2020-01-16 19:01:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 19:01:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 420 transitions. [2020-01-16 19:01:23,131 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 420 transitions. Word has length 19 [2020-01-16 19:01:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:23,131 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 420 transitions. [2020-01-16 19:01:23,131 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 420 transitions. [2020-01-16 19:01:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:23,132 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:23,132 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:23,132 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 19:01:23,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:23,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1469346338, now seen corresponding path program 449 times [2020-01-16 19:01:23,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:23,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286813904] [2020-01-16 19:01:23,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:23,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 19:01:23,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286813904] [2020-01-16 19:01:23,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:23,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:23,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736725253] [2020-01-16 19:01:23,349 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:23,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:23,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:23,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:23,350 INFO L87 Difference]: Start difference. First operand 152 states and 420 transitions. Second operand 8 states. [2020-01-16 19:01:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:23,410 INFO L93 Difference]: Finished difference Result 217 states and 516 transitions. [2020-01-16 19:01:23,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:23,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:23,411 INFO L225 Difference]: With dead ends: 217 [2020-01-16 19:01:23,411 INFO L226 Difference]: Without dead ends: 207 [2020-01-16 19:01:23,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 19:01:23,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-01-16 19:01:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 154. [2020-01-16 19:01:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-01-16 19:01:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 423 transitions. [2020-01-16 19:01:23,415 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 423 transitions. Word has length 19 [2020-01-16 19:01:23,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:23,415 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 423 transitions. [2020-01-16 19:01:23,415 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 423 transitions. [2020-01-16 19:01:23,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:23,416 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:23,416 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:23,416 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 19:01:23,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:23,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1970314304, now seen corresponding path program 450 times [2020-01-16 19:01:23,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:23,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117679002] [2020-01-16 19:01:23,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:23,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117679002] [2020-01-16 19:01:23,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:23,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:23,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110533160] [2020-01-16 19:01:23,629 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:23,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:23,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:23,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:23,630 INFO L87 Difference]: Start difference. First operand 154 states and 423 transitions. Second operand 8 states. [2020-01-16 19:01:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:23,711 INFO L93 Difference]: Finished difference Result 206 states and 502 transitions. [2020-01-16 19:01:23,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:23,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:23,712 INFO L225 Difference]: With dead ends: 206 [2020-01-16 19:01:23,712 INFO L226 Difference]: Without dead ends: 189 [2020-01-16 19:01:23,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 19:01:23,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-01-16 19:01:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 149. [2020-01-16 19:01:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 19:01:23,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 414 transitions. [2020-01-16 19:01:23,716 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 414 transitions. Word has length 19 [2020-01-16 19:01:23,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:23,716 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 414 transitions. [2020-01-16 19:01:23,716 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:23,716 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 414 transitions. [2020-01-16 19:01:23,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:23,716 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:23,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 19:01:23,717 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 19:01:23,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:23,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1205521176, now seen corresponding path program 451 times [2020-01-16 19:01:23,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:23,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31369304] [2020-01-16 19:01:23,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:23,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 19:01:23,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31369304] [2020-01-16 19:01:23,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:23,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:23,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906593661] [2020-01-16 19:01:23,941 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:23,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:23,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:23,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:23,941 INFO L87 Difference]: Start difference. First operand 149 states and 414 transitions. Second operand 8 states. [2020-01-16 19:01:24,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:24,021 INFO L93 Difference]: Finished difference Result 214 states and 510 transitions. [2020-01-16 19:01:24,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:24,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:24,023 INFO L225 Difference]: With dead ends: 214 [2020-01-16 19:01:24,023 INFO L226 Difference]: Without dead ends: 204 [2020-01-16 19:01:24,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 19:01:24,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-01-16 19:01:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 151. [2020-01-16 19:01:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 19:01:24,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 418 transitions. [2020-01-16 19:01:24,027 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 418 transitions. Word has length 19 [2020-01-16 19:01:24,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:24,027 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 418 transitions. [2020-01-16 19:01:24,027 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:24,027 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 418 transitions. [2020-01-16 19:01:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:24,027 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:24,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:24,028 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 19:01:24,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:24,028 INFO L82 PathProgramCache]: Analyzing trace with hash 965878838, now seen corresponding path program 452 times [2020-01-16 19:01:24,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:24,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726680346] [2020-01-16 19:01:24,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:24,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 19:01:24,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726680346] [2020-01-16 19:01:24,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:24,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:24,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060374044] [2020-01-16 19:01:24,253 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:24,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:24,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:24,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:24,253 INFO L87 Difference]: Start difference. First operand 151 states and 418 transitions. Second operand 8 states. [2020-01-16 19:01:24,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:24,319 INFO L93 Difference]: Finished difference Result 214 states and 509 transitions. [2020-01-16 19:01:24,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:24,319 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:24,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:24,320 INFO L225 Difference]: With dead ends: 214 [2020-01-16 19:01:24,320 INFO L226 Difference]: Without dead ends: 203 [2020-01-16 19:01:24,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-01-16 19:01:24,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 150. [2020-01-16 19:01:24,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 19:01:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-01-16 19:01:24,323 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-01-16 19:01:24,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:24,323 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-01-16 19:01:24,324 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-01-16 19:01:24,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:24,324 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:24,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 19:01:24,324 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 19:01:24,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:24,324 INFO L82 PathProgramCache]: Analyzing trace with hash 460818678, now seen corresponding path program 453 times [2020-01-16 19:01:24,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:24,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610737048] [2020-01-16 19:01:24,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:24,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610737048] [2020-01-16 19:01:24,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:24,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:24,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179940659] [2020-01-16 19:01:24,539 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:24,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:24,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:24,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:24,539 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-01-16 19:01:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:24,619 INFO L93 Difference]: Finished difference Result 211 states and 504 transitions. [2020-01-16 19:01:24,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:24,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:24,620 INFO L225 Difference]: With dead ends: 211 [2020-01-16 19:01:24,620 INFO L226 Difference]: Without dead ends: 201 [2020-01-16 19:01:24,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 19:01:24,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-01-16 19:01:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 152. [2020-01-16 19:01:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 19:01:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 419 transitions. [2020-01-16 19:01:24,624 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 419 transitions. Word has length 19 [2020-01-16 19:01:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:24,625 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 419 transitions. [2020-01-16 19:01:24,625 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 419 transitions. [2020-01-16 19:01:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:24,625 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:24,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 19:01:24,625 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 19:01:24,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:24,625 INFO L82 PathProgramCache]: Analyzing trace with hash -2123535310, now seen corresponding path program 454 times [2020-01-16 19:01:24,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:24,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452850520] [2020-01-16 19:01:24,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:24,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452850520] [2020-01-16 19:01:24,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:24,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:24,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391863846] [2020-01-16 19:01:24,862 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:24,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:24,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:24,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:24,863 INFO L87 Difference]: Start difference. First operand 152 states and 419 transitions. Second operand 8 states. [2020-01-16 19:01:24,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:24,937 INFO L93 Difference]: Finished difference Result 204 states and 498 transitions. [2020-01-16 19:01:24,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:24,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:24,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:24,937 INFO L225 Difference]: With dead ends: 204 [2020-01-16 19:01:24,938 INFO L226 Difference]: Without dead ends: 190 [2020-01-16 19:01:24,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 19:01:24,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-01-16 19:01:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 150. [2020-01-16 19:01:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 19:01:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 415 transitions. [2020-01-16 19:01:24,941 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 415 transitions. Word has length 19 [2020-01-16 19:01:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:24,942 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 415 transitions. [2020-01-16 19:01:24,942 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 415 transitions. [2020-01-16 19:01:24,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:24,942 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:24,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 19:01:24,942 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 19:01:24,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:24,943 INFO L82 PathProgramCache]: Analyzing trace with hash -107206542, now seen corresponding path program 455 times [2020-01-16 19:01:24,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:24,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910774523] [2020-01-16 19:01:24,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:25,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 19:01:25,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910774523] [2020-01-16 19:01:25,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:25,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:25,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818592404] [2020-01-16 19:01:25,162 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:25,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:25,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:25,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:25,163 INFO L87 Difference]: Start difference. First operand 150 states and 415 transitions. Second operand 8 states. [2020-01-16 19:01:25,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:25,221 INFO L93 Difference]: Finished difference Result 198 states and 486 transitions. [2020-01-16 19:01:25,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:25,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:25,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:25,222 INFO L225 Difference]: With dead ends: 198 [2020-01-16 19:01:25,223 INFO L226 Difference]: Without dead ends: 188 [2020-01-16 19:01:25,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 19:01:25,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-01-16 19:01:25,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 152. [2020-01-16 19:01:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 19:01:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 418 transitions. [2020-01-16 19:01:25,227 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 418 transitions. Word has length 19 [2020-01-16 19:01:25,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:25,227 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 418 transitions. [2020-01-16 19:01:25,227 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:25,227 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 418 transitions. [2020-01-16 19:01:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:25,227 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:25,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 19:01:25,228 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 19:01:25,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:25,228 INFO L82 PathProgramCache]: Analyzing trace with hash -962513196, now seen corresponding path program 456 times [2020-01-16 19:01:25,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:25,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049124355] [2020-01-16 19:01:25,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:25,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049124355] [2020-01-16 19:01:25,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:25,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:25,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589010214] [2020-01-16 19:01:25,447 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:25,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:25,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:25,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:25,448 INFO L87 Difference]: Start difference. First operand 152 states and 418 transitions. Second operand 8 states. [2020-01-16 19:01:25,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:25,519 INFO L93 Difference]: Finished difference Result 187 states and 472 transitions. [2020-01-16 19:01:25,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:25,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:25,520 INFO L225 Difference]: With dead ends: 187 [2020-01-16 19:01:25,520 INFO L226 Difference]: Without dead ends: 170 [2020-01-16 19:01:25,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 19:01:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-01-16 19:01:25,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 147. [2020-01-16 19:01:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 19:01:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 410 transitions. [2020-01-16 19:01:25,524 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 410 transitions. Word has length 19 [2020-01-16 19:01:25,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:25,524 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 410 transitions. [2020-01-16 19:01:25,524 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 410 transitions. [2020-01-16 19:01:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:25,524 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:25,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 19:01:25,524 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 19:01:25,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:25,525 INFO L82 PathProgramCache]: Analyzing trace with hash 915076246, now seen corresponding path program 457 times [2020-01-16 19:01:25,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:25,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917425990] [2020-01-16 19:01:25,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:25,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917425990] [2020-01-16 19:01:25,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:25,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:25,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002431544] [2020-01-16 19:01:25,724 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:25,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:25,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:25,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:25,725 INFO L87 Difference]: Start difference. First operand 147 states and 410 transitions. Second operand 8 states. [2020-01-16 19:01:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:25,809 INFO L93 Difference]: Finished difference Result 246 states and 578 transitions. [2020-01-16 19:01:25,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:25,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:25,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:25,810 INFO L225 Difference]: With dead ends: 246 [2020-01-16 19:01:25,810 INFO L226 Difference]: Without dead ends: 232 [2020-01-16 19:01:25,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 19:01:25,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-01-16 19:01:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 151. [2020-01-16 19:01:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 19:01:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 420 transitions. [2020-01-16 19:01:25,814 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 420 transitions. Word has length 19 [2020-01-16 19:01:25,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:25,814 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 420 transitions. [2020-01-16 19:01:25,814 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 420 transitions. [2020-01-16 19:01:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:25,814 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:25,814 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:25,815 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 19:01:25,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:25,815 INFO L82 PathProgramCache]: Analyzing trace with hash 40740920, now seen corresponding path program 458 times [2020-01-16 19:01:25,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:25,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633370191] [2020-01-16 19:01:25,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:26,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 19:01:26,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633370191] [2020-01-16 19:01:26,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:26,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:26,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193727917] [2020-01-16 19:01:26,013 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:26,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:26,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:26,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:26,013 INFO L87 Difference]: Start difference. First operand 151 states and 420 transitions. Second operand 8 states. [2020-01-16 19:01:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:26,098 INFO L93 Difference]: Finished difference Result 242 states and 567 transitions. [2020-01-16 19:01:26,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:26,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:26,099 INFO L225 Difference]: With dead ends: 242 [2020-01-16 19:01:26,100 INFO L226 Difference]: Without dead ends: 230 [2020-01-16 19:01:26,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:26,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-01-16 19:01:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 149. [2020-01-16 19:01:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 19:01:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 416 transitions. [2020-01-16 19:01:26,103 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 416 transitions. Word has length 19 [2020-01-16 19:01:26,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:26,104 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 416 transitions. [2020-01-16 19:01:26,104 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:26,104 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 416 transitions. [2020-01-16 19:01:26,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:26,104 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:26,104 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:26,104 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 19:01:26,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:26,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2076098360, now seen corresponding path program 459 times [2020-01-16 19:01:26,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:26,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726332023] [2020-01-16 19:01:26,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:26,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 19:01:26,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726332023] [2020-01-16 19:01:26,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:26,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:26,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406609516] [2020-01-16 19:01:26,296 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:26,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:26,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:26,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:26,297 INFO L87 Difference]: Start difference. First operand 149 states and 416 transitions. Second operand 8 states. [2020-01-16 19:01:26,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:26,376 INFO L93 Difference]: Finished difference Result 246 states and 577 transitions. [2020-01-16 19:01:26,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:26,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:26,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:26,378 INFO L225 Difference]: With dead ends: 246 [2020-01-16 19:01:26,378 INFO L226 Difference]: Without dead ends: 232 [2020-01-16 19:01: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 19:01:26,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-01-16 19:01:26,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 151. [2020-01-16 19:01:26,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 19:01:26,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 419 transitions. [2020-01-16 19:01:26,386 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 419 transitions. Word has length 19 [2020-01-16 19:01:26,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:26,386 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 419 transitions. [2020-01-16 19:01:26,386 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 419 transitions. [2020-01-16 19:01:26,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:26,386 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:26,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 19:01:26,386 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 19:01:26,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:26,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1098739106, now seen corresponding path program 460 times [2020-01-16 19:01:26,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:26,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077934387] [2020-01-16 19:01:26,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:26,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 19:01:26,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077934387] [2020-01-16 19:01:26,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:26,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:26,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896584351] [2020-01-16 19:01:26,591 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:26,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:26,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:26,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:26,591 INFO L87 Difference]: Start difference. First operand 151 states and 419 transitions. Second operand 8 states. [2020-01-16 19:01:26,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:26,657 INFO L93 Difference]: Finished difference Result 242 states and 566 transitions. [2020-01-16 19:01:26,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:26,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:26,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:26,658 INFO L225 Difference]: With dead ends: 242 [2020-01-16 19:01:26,659 INFO L226 Difference]: Without dead ends: 230 [2020-01-16 19:01:26,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:26,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-01-16 19:01:26,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 149. [2020-01-16 19:01:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 19:01:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 415 transitions. [2020-01-16 19:01:26,663 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 415 transitions. Word has length 19 [2020-01-16 19:01:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:26,663 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 415 transitions. [2020-01-16 19:01:26,663 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 415 transitions. [2020-01-16 19:01:26,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:26,663 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:26,663 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:26,664 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 19:01:26,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:26,664 INFO L82 PathProgramCache]: Analyzing trace with hash -321241190, now seen corresponding path program 461 times [2020-01-16 19:01:26,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:26,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24563422] [2020-01-16 19:01:26,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:26,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 19:01:26,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24563422] [2020-01-16 19:01:26,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:26,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:26,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139800663] [2020-01-16 19:01:26,869 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:26,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:26,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:26,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:26,869 INFO L87 Difference]: Start difference. First operand 149 states and 415 transitions. Second operand 8 states. [2020-01-16 19:01:26,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:26,949 INFO L93 Difference]: Finished difference Result 237 states and 555 transitions. [2020-01-16 19:01:26,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:26,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:26,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:26,951 INFO L225 Difference]: With dead ends: 237 [2020-01-16 19:01:26,951 INFO L226 Difference]: Without dead ends: 227 [2020-01-16 19:01:26,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 19:01:26,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-01-16 19:01:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 150. [2020-01-16 19:01:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 19:01:26,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-01-16 19:01:26,955 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-01-16 19:01:26,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:26,955 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-01-16 19:01:26,955 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-01-16 19:01:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:26,955 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:26,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 19:01:26,955 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 19:01:26,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:26,956 INFO L82 PathProgramCache]: Analyzing trace with hash -560883528, now seen corresponding path program 462 times [2020-01-16 19:01:26,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:26,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418303858] [2020-01-16 19:01:26,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:27,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418303858] [2020-01-16 19:01:27,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:27,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:27,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664614856] [2020-01-16 19:01:27,242 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:27,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:27,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:27,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:27,243 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-01-16 19:01:27,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:27,315 INFO L93 Difference]: Finished difference Result 237 states and 554 transitions. [2020-01-16 19:01:27,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:27,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:27,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:27,316 INFO L225 Difference]: With dead ends: 237 [2020-01-16 19:01:27,316 INFO L226 Difference]: Without dead ends: 225 [2020-01-16 19:01:27,317 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-01-16 19:01:27,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 148. [2020-01-16 19:01:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-01-16 19:01:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 413 transitions. [2020-01-16 19:01:27,320 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 413 transitions. Word has length 19 [2020-01-16 19:01:27,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:27,321 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 413 transitions. [2020-01-16 19:01:27,321 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 413 transitions. [2020-01-16 19:01:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:27,321 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:27,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 19:01:27,321 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 19:01:27,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:27,322 INFO L82 PathProgramCache]: Analyzing trace with hash -695864712, now seen corresponding path program 463 times [2020-01-16 19:01:27,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:27,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606460933] [2020-01-16 19:01:27,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:27,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:27,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606460933] [2020-01-16 19:01:27,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:27,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:27,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382752897] [2020-01-16 19:01:27,501 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:27,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:27,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:27,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:27,502 INFO L87 Difference]: Start difference. First operand 148 states and 413 transitions. Second operand 8 states. [2020-01-16 19:01:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:27,586 INFO L93 Difference]: Finished difference Result 246 states and 577 transitions. [2020-01-16 19:01:27,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:27,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:27,586 INFO L225 Difference]: With dead ends: 246 [2020-01-16 19:01:27,587 INFO L226 Difference]: Without dead ends: 232 [2020-01-16 19:01:27,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 19:01:27,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-01-16 19:01:27,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 152. [2020-01-16 19:01:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 19:01:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 423 transitions. [2020-01-16 19:01:27,590 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 423 transitions. Word has length 19 [2020-01-16 19:01:27,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:27,591 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 423 transitions. [2020-01-16 19:01:27,591 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 423 transitions. [2020-01-16 19:01:27,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:27,591 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:27,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 19:01:27,591 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 19:01:27,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:27,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1570200038, now seen corresponding path program 464 times [2020-01-16 19:01:27,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:27,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155441157] [2020-01-16 19:01:27,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:27,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155441157] [2020-01-16 19:01:27,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:27,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:27,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673964582] [2020-01-16 19:01:27,774 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:27,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:27,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:27,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:27,774 INFO L87 Difference]: Start difference. First operand 152 states and 423 transitions. Second operand 8 states. [2020-01-16 19:01:27,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:27,860 INFO L93 Difference]: Finished difference Result 242 states and 566 transitions. [2020-01-16 19:01:27,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:27,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:27,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:27,860 INFO L225 Difference]: With dead ends: 242 [2020-01-16 19:01:27,860 INFO L226 Difference]: Without dead ends: 230 [2020-01-16 19:01:27,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:27,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-01-16 19:01:27,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 150. [2020-01-16 19:01:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 19:01:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 418 transitions. [2020-01-16 19:01:27,864 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 418 transitions. Word has length 19 [2020-01-16 19:01:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:27,864 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 418 transitions. [2020-01-16 19:01:27,864 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 418 transitions. [2020-01-16 19:01:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:27,865 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:27,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 19:01:27,865 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 19:01:27,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:27,865 INFO L82 PathProgramCache]: Analyzing trace with hash 793540284, now seen corresponding path program 465 times [2020-01-16 19:01:27,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:27,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990818793] [2020-01-16 19:01:27,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:28,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 19:01:28,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990818793] [2020-01-16 19:01:28,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:28,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:28,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590957231] [2020-01-16 19:01:28,049 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:28,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:28,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:28,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:28,049 INFO L87 Difference]: Start difference. First operand 150 states and 418 transitions. Second operand 8 states. [2020-01-16 19:01:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:28,133 INFO L93 Difference]: Finished difference Result 244 states and 575 transitions. [2020-01-16 19:01:28,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:28,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:28,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:28,134 INFO L225 Difference]: With dead ends: 244 [2020-01-16 19:01:28,134 INFO L226 Difference]: Without dead ends: 230 [2020-01-16 19:01:28,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 19:01:28,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-01-16 19:01:28,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 154. [2020-01-16 19:01:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-01-16 19:01:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 426 transitions. [2020-01-16 19:01:28,138 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 426 transitions. Word has length 19 [2020-01-16 19:01:28,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:28,138 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 426 transitions. [2020-01-16 19:01:28,138 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:28,138 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 426 transitions. [2020-01-16 19:01:28,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:28,138 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:28,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 19:01:28,138 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 19:01:28,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:28,139 INFO L82 PathProgramCache]: Analyzing trace with hash 48243140, now seen corresponding path program 466 times [2020-01-16 19:01:28,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:28,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949127282] [2020-01-16 19:01:28,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:28,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:28,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949127282] [2020-01-16 19:01:28,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:28,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:28,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843676982] [2020-01-16 19:01:28,322 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:28,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:28,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:28,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:28,322 INFO L87 Difference]: Start difference. First operand 154 states and 426 transitions. Second operand 8 states. [2020-01-16 19:01:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:28,401 INFO L93 Difference]: Finished difference Result 233 states and 558 transitions. [2020-01-16 19:01:28,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:28,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:28,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:28,403 INFO L225 Difference]: With dead ends: 233 [2020-01-16 19:01:28,403 INFO L226 Difference]: Without dead ends: 217 [2020-01-16 19:01:28,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 19:01:28,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-01-16 19:01:28,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 150. [2020-01-16 19:01:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 19:01:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-01-16 19:01:28,406 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-01-16 19:01:28,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:28,406 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-01-16 19:01:28,406 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:28,406 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-01-16 19:01:28,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:28,407 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:28,407 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:28,407 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 19:01:28,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:28,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2141654844, now seen corresponding path program 467 times [2020-01-16 19:01:28,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:28,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185761608] [2020-01-16 19:01:28,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:28,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:28,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185761608] [2020-01-16 19:01:28,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:28,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:28,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863357274] [2020-01-16 19:01:28,593 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:28,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:28,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:28,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:28,594 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-01-16 19:01:28,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:28,673 INFO L93 Difference]: Finished difference Result 238 states and 557 transitions. [2020-01-16 19:01:28,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:28,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:28,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:28,674 INFO L225 Difference]: With dead ends: 238 [2020-01-16 19:01:28,674 INFO L226 Difference]: Without dead ends: 228 [2020-01-16 19:01:28,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:28,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-01-16 19:01:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 152. [2020-01-16 19:01:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 19:01:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 419 transitions. [2020-01-16 19:01:28,678 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 419 transitions. Word has length 19 [2020-01-16 19:01:28,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:28,678 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 419 transitions. [2020-01-16 19:01:28,679 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:28,679 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 419 transitions. [2020-01-16 19:01:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:28,679 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:28,679 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:28,679 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 19:01:28,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:28,679 INFO L82 PathProgramCache]: Analyzing trace with hash -431041536, now seen corresponding path program 468 times [2020-01-16 19:01:28,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:28,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048524641] [2020-01-16 19:01:28,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:28,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:28,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048524641] [2020-01-16 19:01:28,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:28,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:28,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436298788] [2020-01-16 19:01:28,869 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:28,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:28,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:28,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:28,869 INFO L87 Difference]: Start difference. First operand 152 states and 419 transitions. Second operand 8 states. [2020-01-16 19:01:28,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:28,962 INFO L93 Difference]: Finished difference Result 231 states and 551 transitions. [2020-01-16 19:01:28,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:28,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:28,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:28,963 INFO L225 Difference]: With dead ends: 231 [2020-01-16 19:01:28,963 INFO L226 Difference]: Without dead ends: 215 [2020-01-16 19:01:28,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:28,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-01-16 19:01:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 148. [2020-01-16 19:01:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-01-16 19:01:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 412 transitions. [2020-01-16 19:01:28,968 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 412 transitions. Word has length 19 [2020-01-16 19:01:28,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:28,968 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 412 transitions. [2020-01-16 19:01:28,968 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:28,968 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 412 transitions. [2020-01-16 19:01:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:28,968 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:28,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 19:01:28,968 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 19:01:28,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:28,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1124777348, now seen corresponding path program 469 times [2020-01-16 19:01:28,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:28,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559581754] [2020-01-16 19:01:28,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:29,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559581754] [2020-01-16 19:01:29,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:29,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:29,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208125913] [2020-01-16 19:01:29,164 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:29,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:29,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:29,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:29,164 INFO L87 Difference]: Start difference. First operand 148 states and 412 transitions. Second operand 8 states. [2020-01-16 19:01:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:29,240 INFO L93 Difference]: Finished difference Result 236 states and 552 transitions. [2020-01-16 19:01:29,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:29,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:29,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:29,241 INFO L225 Difference]: With dead ends: 236 [2020-01-16 19:01:29,241 INFO L226 Difference]: Without dead ends: 222 [2020-01-16 19:01:29,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 19:01:29,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-01-16 19:01:29,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 152. [2020-01-16 19:01:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 19:01:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 422 transitions. [2020-01-16 19:01:29,245 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 422 transitions. Word has length 19 [2020-01-16 19:01:29,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:29,245 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 422 transitions. [2020-01-16 19:01:29,245 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:29,245 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 422 transitions. [2020-01-16 19:01:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:29,246 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:29,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 19:01:29,246 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 19:01:29,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:29,246 INFO L82 PathProgramCache]: Analyzing trace with hash -4647518, now seen corresponding path program 470 times [2020-01-16 19:01:29,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:29,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083268381] [2020-01-16 19:01:29,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:29,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083268381] [2020-01-16 19:01:29,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:29,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:29,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792360888] [2020-01-16 19:01:29,429 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:29,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:29,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:29,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:29,430 INFO L87 Difference]: Start difference. First operand 152 states and 422 transitions. Second operand 8 states. [2020-01-16 19:01:29,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:29,491 INFO L93 Difference]: Finished difference Result 232 states and 541 transitions. [2020-01-16 19:01:29,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:29,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:29,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:29,492 INFO L225 Difference]: With dead ends: 232 [2020-01-16 19:01:29,492 INFO L226 Difference]: Without dead ends: 220 [2020-01-16 19:01:29,492 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 19:01:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-01-16 19:01:29,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 150. [2020-01-16 19:01:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 19:01:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 417 transitions. [2020-01-16 19:01:29,496 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 417 transitions. Word has length 19 [2020-01-16 19:01:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:29,496 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 417 transitions. [2020-01-16 19:01:29,496 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 417 transitions. [2020-01-16 19:01:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:29,497 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:29,497 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:29,497 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 19:01:29,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:29,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1869479846, now seen corresponding path program 471 times [2020-01-16 19:01:29,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:29,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093062506] [2020-01-16 19:01:29,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:29,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 19:01:29,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093062506] [2020-01-16 19:01:29,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:29,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:29,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984717338] [2020-01-16 19:01:29,680 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:29,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:29,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:29,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:29,681 INFO L87 Difference]: Start difference. First operand 150 states and 417 transitions. Second operand 8 states. [2020-01-16 19:01:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:29,782 INFO L93 Difference]: Finished difference Result 230 states and 538 transitions. [2020-01-16 19:01:29,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:29,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:29,783 INFO L225 Difference]: With dead ends: 230 [2020-01-16 19:01:29,784 INFO L226 Difference]: Without dead ends: 216 [2020-01-16 19:01:29,784 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:29,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-01-16 19:01:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 154. [2020-01-16 19:01:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-01-16 19:01:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 425 transitions. [2020-01-16 19:01:29,788 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 425 transitions. Word has length 19 [2020-01-16 19:01:29,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:29,788 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 425 transitions. [2020-01-16 19:01:29,788 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:29,788 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 425 transitions. [2020-01-16 19:01:29,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:29,789 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:29,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 19:01:29,789 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 19:01:29,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:29,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1680190306, now seen corresponding path program 472 times [2020-01-16 19:01:29,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:29,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146828004] [2020-01-16 19:01:29,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:29,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146828004] [2020-01-16 19:01:29,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:29,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:29,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948079982] [2020-01-16 19:01:29,972 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:29,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:29,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:29,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:29,973 INFO L87 Difference]: Start difference. First operand 154 states and 425 transitions. Second operand 8 states. [2020-01-16 19:01:30,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:30,059 INFO L93 Difference]: Finished difference Result 219 states and 521 transitions. [2020-01-16 19:01:30,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:30,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:30,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:30,061 INFO L225 Difference]: With dead ends: 219 [2020-01-16 19:01:30,061 INFO L226 Difference]: Without dead ends: 203 [2020-01-16 19:01:30,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:30,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-01-16 19:01:30,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 150. [2020-01-16 19:01:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 19:01:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 415 transitions. [2020-01-16 19:01:30,064 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 415 transitions. Word has length 19 [2020-01-16 19:01:30,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:30,064 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 415 transitions. [2020-01-16 19:01:30,064 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:30,065 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 415 transitions. [2020-01-16 19:01:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:30,065 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:30,065 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:30,065 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 19:01:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:30,065 INFO L82 PathProgramCache]: Analyzing trace with hash -539877320, now seen corresponding path program 473 times [2020-01-16 19:01:30,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:30,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86978096] [2020-01-16 19:01:30,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:30,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86978096] [2020-01-16 19:01:30,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:30,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:30,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771320207] [2020-01-16 19:01:30,272 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:30,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:30,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:30,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:30,272 INFO L87 Difference]: Start difference. First operand 150 states and 415 transitions. Second operand 8 states. [2020-01-16 19:01:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:30,342 INFO L93 Difference]: Finished difference Result 215 states and 511 transitions. [2020-01-16 19:01:30,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:30,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:30,343 INFO L225 Difference]: With dead ends: 215 [2020-01-16 19:01:30,343 INFO L226 Difference]: Without dead ends: 205 [2020-01-16 19:01:30,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 19:01:30,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-01-16 19:01:30,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 152. [2020-01-16 19:01:30,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 19:01:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 418 transitions. [2020-01-16 19:01:30,347 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 418 transitions. Word has length 19 [2020-01-16 19:01:30,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:30,347 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 418 transitions. [2020-01-16 19:01:30,347 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:30,347 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 418 transitions. [2020-01-16 19:01:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:30,348 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:30,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 19:01:30,348 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 19:01:30,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:30,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1395183974, now seen corresponding path program 474 times [2020-01-16 19:01:30,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:30,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717250084] [2020-01-16 19:01:30,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:30,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 19:01:30,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717250084] [2020-01-16 19:01:30,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:30,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:30,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370480308] [2020-01-16 19:01:30,544 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:30,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:30,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:30,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:30,544 INFO L87 Difference]: Start difference. First operand 152 states and 418 transitions. Second operand 8 states. [2020-01-16 19:01:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:30,622 INFO L93 Difference]: Finished difference Result 204 states and 497 transitions. [2020-01-16 19:01:30,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:30,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:30,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:30,623 INFO L225 Difference]: With dead ends: 204 [2020-01-16 19:01:30,623 INFO L226 Difference]: Without dead ends: 188 [2020-01-16 19:01:30,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 19:01:30,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-01-16 19:01:30,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 148. [2020-01-16 19:01:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-01-16 19:01:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 411 transitions. [2020-01-16 19:01:30,627 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 411 transitions. Word has length 19 [2020-01-16 19:01:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:30,627 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 411 transitions. [2020-01-16 19:01:30,627 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 411 transitions. [2020-01-16 19:01:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:30,627 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:30,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:30,628 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 19:01:30,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:30,628 INFO L82 PathProgramCache]: Analyzing trace with hash 266504132, now seen corresponding path program 475 times [2020-01-16 19:01:30,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:30,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218295525] [2020-01-16 19:01:30,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:30,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 19:01:30,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218295525] [2020-01-16 19:01:30,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:30,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:30,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569387876] [2020-01-16 19:01:30,844 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:30,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:30,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:30,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:30,844 INFO L87 Difference]: Start difference. First operand 148 states and 411 transitions. Second operand 8 states. [2020-01-16 19:01:30,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:30,923 INFO L93 Difference]: Finished difference Result 213 states and 507 transitions. [2020-01-16 19:01:30,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:30,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:30,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:30,924 INFO L225 Difference]: With dead ends: 213 [2020-01-16 19:01:30,924 INFO L226 Difference]: Without dead ends: 203 [2020-01-16 19:01:30,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 19:01:30,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-01-16 19:01:30,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 150. [2020-01-16 19:01:30,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 19:01:30,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 415 transitions. [2020-01-16 19:01:30,928 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 415 transitions. Word has length 19 [2020-01-16 19:01:30,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:30,929 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 415 transitions. [2020-01-16 19:01:30,929 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 415 transitions. [2020-01-16 19:01:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:30,929 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01: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 19:01:30,929 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 19:01:30,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:30,929 INFO L82 PathProgramCache]: Analyzing trace with hash 26861794, now seen corresponding path program 476 times [2020-01-16 19:01:30,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:30,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793007727] [2020-01-16 19:01:30,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:31,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793007727] [2020-01-16 19:01:31,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:31,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:31,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822576383] [2020-01-16 19:01:31,146 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:31,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:31,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:31,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:31,146 INFO L87 Difference]: Start difference. First operand 150 states and 415 transitions. Second operand 8 states. [2020-01-16 19:01:31,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:31,212 INFO L93 Difference]: Finished difference Result 213 states and 506 transitions. [2020-01-16 19:01:31,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:31,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:31,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:31,213 INFO L225 Difference]: With dead ends: 213 [2020-01-16 19:01:31,213 INFO L226 Difference]: Without dead ends: 202 [2020-01-16 19:01:31,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-01-16 19:01:31,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 149. [2020-01-16 19:01:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 19:01:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 413 transitions. [2020-01-16 19:01:31,217 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 413 transitions. Word has length 19 [2020-01-16 19:01:31,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:31,217 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 413 transitions. [2020-01-16 19:01:31,217 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:31,217 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 413 transitions. [2020-01-16 19:01:31,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:31,218 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:31,218 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:31,218 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 19:01:31,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:31,218 INFO L82 PathProgramCache]: Analyzing trace with hash -478198366, now seen corresponding path program 477 times [2020-01-16 19:01:31,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:31,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124599714] [2020-01-16 19:01:31,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:31,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 19:01:31,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124599714] [2020-01-16 19:01:31,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:31,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:31,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041958060] [2020-01-16 19:01:31,422 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:31,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:31,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:31,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:31,422 INFO L87 Difference]: Start difference. First operand 149 states and 413 transitions. Second operand 8 states. [2020-01-16 19:01:31,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:31,505 INFO L93 Difference]: Finished difference Result 210 states and 501 transitions. [2020-01-16 19:01:31,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:31,505 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:31,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:31,506 INFO L225 Difference]: With dead ends: 210 [2020-01-16 19:01:31,506 INFO L226 Difference]: Without dead ends: 200 [2020-01-16 19:01:31,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 19:01:31,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-01-16 19:01:31,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 151. [2020-01-16 19:01:31,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 19:01:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 416 transitions. [2020-01-16 19:01:31,511 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 416 transitions. Word has length 19 [2020-01-16 19:01:31,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:31,511 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 416 transitions. [2020-01-16 19:01:31,511 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:31,511 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 416 transitions. [2020-01-16 19:01:31,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:31,511 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:31,511 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:31,511 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 19:01:31,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:31,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1232414942, now seen corresponding path program 478 times [2020-01-16 19:01:31,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:31,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394957583] [2020-01-16 19:01:31,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:31,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 19:01:31,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394957583] [2020-01-16 19:01:31,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:31,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:31,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888989582] [2020-01-16 19:01:31,720 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:31,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:31,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:31,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:31,721 INFO L87 Difference]: Start difference. First operand 151 states and 416 transitions. Second operand 8 states. [2020-01-16 19:01:31,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:31,803 INFO L93 Difference]: Finished difference Result 203 states and 495 transitions. [2020-01-16 19:01:31,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:31,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:31,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:31,805 INFO L225 Difference]: With dead ends: 203 [2020-01-16 19:01:31,805 INFO L226 Difference]: Without dead ends: 189 [2020-01-16 19:01:31,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 19:01:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-01-16 19:01:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 149. [2020-01-16 19:01:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 19:01:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 412 transitions. [2020-01-16 19:01:31,809 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 412 transitions. Word has length 19 [2020-01-16 19:01:31,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:31,809 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 412 transitions. [2020-01-16 19:01:31,809 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:31,809 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 412 transitions. [2020-01-16 19:01:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:31,809 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:31,809 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:31,809 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 19:01:31,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:31,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1046223586, now seen corresponding path program 479 times [2020-01-16 19:01:31,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:31,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859510821] [2020-01-16 19:01:31,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:32,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 19:01:32,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859510821] [2020-01-16 19:01:32,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:32,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:32,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301688435] [2020-01-16 19:01:32,023 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:32,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:32,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:32,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:32,024 INFO L87 Difference]: Start difference. First operand 149 states and 412 transitions. Second operand 8 states. [2020-01-16 19:01:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:32,090 INFO L93 Difference]: Finished difference Result 197 states and 483 transitions. [2020-01-16 19:01:32,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:32,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:32,091 INFO L225 Difference]: With dead ends: 197 [2020-01-16 19:01:32,091 INFO L226 Difference]: Without dead ends: 187 [2020-01-16 19:01:32,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-01-16 19:01:32,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 151. [2020-01-16 19:01:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-01-16 19:01:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 415 transitions. [2020-01-16 19:01:32,094 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 415 transitions. Word has length 19 [2020-01-16 19:01:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:32,094 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 415 transitions. [2020-01-16 19:01:32,094 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:32,094 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 415 transitions. [2020-01-16 19:01:32,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:32,095 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:32,095 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:32,095 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 19:01:32,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:32,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1901530240, now seen corresponding path program 480 times [2020-01-16 19:01:32,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:32,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057140983] [2020-01-16 19:01:32,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:32,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057140983] [2020-01-16 19:01:32,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:32,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:32,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411975542] [2020-01-16 19:01:32,304 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:32,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:32,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:32,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:32,305 INFO L87 Difference]: Start difference. First operand 151 states and 415 transitions. Second operand 8 states. [2020-01-16 19:01:32,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:32,380 INFO L93 Difference]: Finished difference Result 186 states and 469 transitions. [2020-01-16 19:01:32,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:32,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:32,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:32,381 INFO L225 Difference]: With dead ends: 186 [2020-01-16 19:01:32,381 INFO L226 Difference]: Without dead ends: 167 [2020-01-16 19:01:32,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 19:01:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2020-01-16 19:01:32,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 144. [2020-01-16 19:01:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-01-16 19:01:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 404 transitions. [2020-01-16 19:01:32,385 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 404 transitions. Word has length 19 [2020-01-16 19:01:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:32,385 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 404 transitions. [2020-01-16 19:01:32,385 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 404 transitions. [2020-01-16 19:01:32,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:32,386 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:32,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 19:01:32,386 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 19:01:32,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:32,386 INFO L82 PathProgramCache]: Analyzing trace with hash -700822424, now seen corresponding path program 481 times [2020-01-16 19:01:32,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:32,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251287218] [2020-01-16 19:01:32,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:32,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 19:01:32,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251287218] [2020-01-16 19:01:32,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:32,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:32,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796118521] [2020-01-16 19:01:32,615 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:32,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:32,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:32,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:32,616 INFO L87 Difference]: Start difference. First operand 144 states and 404 transitions. Second operand 8 states. [2020-01-16 19:01:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:32,678 INFO L93 Difference]: Finished difference Result 244 states and 560 transitions. [2020-01-16 19:01:32,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:32,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:32,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:32,680 INFO L225 Difference]: With dead ends: 244 [2020-01-16 19:01:32,680 INFO L226 Difference]: Without dead ends: 228 [2020-01-16 19:01:32,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-01-16 19:01:32,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-01-16 19:01:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 19:01:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 414 transitions. [2020-01-16 19:01:32,684 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 414 transitions. Word has length 19 [2020-01-16 19:01:32,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:32,684 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 414 transitions. [2020-01-16 19:01:32,684 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:32,684 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 414 transitions. [2020-01-16 19:01:32,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:32,685 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:32,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 19:01:32,685 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 19:01:32,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:32,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1442418326, now seen corresponding path program 482 times [2020-01-16 19:01:32,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:32,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153316213] [2020-01-16 19:01:32,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:32,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:32,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153316213] [2020-01-16 19:01:32,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:32,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:32,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274366487] [2020-01-16 19:01:32,912 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:32,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:32,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:32,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:32,913 INFO L87 Difference]: Start difference. First operand 149 states and 414 transitions. Second operand 8 states. [2020-01-16 19:01:32,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:32,994 INFO L93 Difference]: Finished difference Result 238 states and 545 transitions. [2020-01-16 19:01:32,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:32,994 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:32,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:32,995 INFO L225 Difference]: With dead ends: 238 [2020-01-16 19:01:32,995 INFO L226 Difference]: Without dead ends: 225 [2020-01-16 19:01:32,995 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-01-16 19:01:32,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 146. [2020-01-16 19:01:32,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-01-16 19:01:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 408 transitions. [2020-01-16 19:01:32,999 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 408 transitions. Word has length 19 [2020-01-16 19:01:32,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:32,999 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 408 transitions. [2020-01-16 19:01:32,999 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:32,999 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 408 transitions. [2020-01-16 19:01:33,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:33,000 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:33,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:33,000 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 19:01:33,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:33,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1993707018, now seen corresponding path program 483 times [2020-01-16 19:01:33,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:33,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199412065] [2020-01-16 19:01:33,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:33,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199412065] [2020-01-16 19:01:33,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:33,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:33,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107919395] [2020-01-16 19:01:33,208 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:33,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:33,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:33,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:33,208 INFO L87 Difference]: Start difference. First operand 146 states and 408 transitions. Second operand 8 states. [2020-01-16 19:01:33,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:33,268 INFO L93 Difference]: Finished difference Result 244 states and 558 transitions. [2020-01-16 19:01:33,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:33,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:33,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:33,269 INFO L225 Difference]: With dead ends: 244 [2020-01-16 19:01:33,269 INFO L226 Difference]: Without dead ends: 228 [2020-01-16 19:01:33,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 19:01:33,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-01-16 19:01:33,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-01-16 19:01:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 19:01:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 412 transitions. [2020-01-16 19:01:33,273 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 412 transitions. Word has length 19 [2020-01-16 19:01:33,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:33,273 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 412 transitions. [2020-01-16 19:01:33,273 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:33,274 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 412 transitions. [2020-01-16 19:01:33,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:33,274 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:33,274 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:33,274 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 19:01:33,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:33,274 INFO L82 PathProgramCache]: Analyzing trace with hash -2042202052, now seen corresponding path program 484 times [2020-01-16 19:01:33,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:33,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545568104] [2020-01-16 19:01:33,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:33,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545568104] [2020-01-16 19:01:33,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:33,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:33,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209840184] [2020-01-16 19:01:33,492 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:33,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:33,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:33,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:33,492 INFO L87 Difference]: Start difference. First operand 149 states and 412 transitions. Second operand 8 states. [2020-01-16 19:01:33,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:33,556 INFO L93 Difference]: Finished difference Result 238 states and 543 transitions. [2020-01-16 19:01:33,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:33,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:33,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:33,557 INFO L225 Difference]: With dead ends: 238 [2020-01-16 19:01:33,557 INFO L226 Difference]: Without dead ends: 225 [2020-01-16 19:01:33,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:33,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-01-16 19:01:33,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 146. [2020-01-16 19:01:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-01-16 19:01:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 406 transitions. [2020-01-16 19:01:33,560 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 406 transitions. Word has length 19 [2020-01-16 19:01:33,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:33,560 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 406 transitions. [2020-01-16 19:01:33,560 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 406 transitions. [2020-01-16 19:01:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:33,561 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:33,561 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:33,561 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 19:01:33,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:33,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1012326922, now seen corresponding path program 485 times [2020-01-16 19:01:33,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:33,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471567678] [2020-01-16 19:01:33,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:33,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471567678] [2020-01-16 19:01:33,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:33,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:33,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310779299] [2020-01-16 19:01:33,783 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:33,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:33,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:33,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:33,783 INFO L87 Difference]: Start difference. First operand 146 states and 406 transitions. Second operand 8 states. [2020-01-16 19:01:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:33,866 INFO L93 Difference]: Finished difference Result 230 states and 527 transitions. [2020-01-16 19:01:33,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:33,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:33,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:33,867 INFO L225 Difference]: With dead ends: 230 [2020-01-16 19:01:33,868 INFO L226 Difference]: Without dead ends: 220 [2020-01-16 19:01:33,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 19:01:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-01-16 19:01:33,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 147. [2020-01-16 19:01:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 19:01:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 407 transitions. [2020-01-16 19:01:33,872 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 407 transitions. Word has length 19 [2020-01-16 19:01:33,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:33,872 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 407 transitions. [2020-01-16 19:01:33,872 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:33,872 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 407 transitions. [2020-01-16 19:01:33,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:33,872 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:33,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 19:01:33,872 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 19:01:33,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:33,873 INFO L82 PathProgramCache]: Analyzing trace with hash 772684584, now seen corresponding path program 486 times [2020-01-16 19:01:33,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:33,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469603104] [2020-01-16 19:01:33,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:34,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:34,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469603104] [2020-01-16 19:01:34,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:34,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:34,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604487212] [2020-01-16 19:01:34,104 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:34,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:34,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:34,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:34,104 INFO L87 Difference]: Start difference. First operand 147 states and 407 transitions. Second operand 8 states. [2020-01-16 19:01:34,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:34,170 INFO L93 Difference]: Finished difference Result 230 states and 526 transitions. [2020-01-16 19:01:34,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:34,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:34,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:34,171 INFO L225 Difference]: With dead ends: 230 [2020-01-16 19:01:34,171 INFO L226 Difference]: Without dead ends: 217 [2020-01-16 19:01:34,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 19:01:34,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-01-16 19:01:34,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 144. [2020-01-16 19:01:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-01-16 19:01:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 402 transitions. [2020-01-16 19:01:34,175 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 402 transitions. Word has length 19 [2020-01-16 19:01:34,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:34,175 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 402 transitions. [2020-01-16 19:01:34,175 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 402 transitions. [2020-01-16 19:01:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:34,176 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:34,176 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:34,176 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 19:01:34,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:34,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1225211654, now seen corresponding path program 487 times [2020-01-16 19:01:34,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:34,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686159279] [2020-01-16 19:01:34,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:34,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:34,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686159279] [2020-01-16 19:01:34,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:34,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:34,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470537213] [2020-01-16 19:01:34,393 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:34,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:34,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:34,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:34,393 INFO L87 Difference]: Start difference. First operand 144 states and 402 transitions. Second operand 8 states. [2020-01-16 19:01:34,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:34,458 INFO L93 Difference]: Finished difference Result 250 states and 577 transitions. [2020-01-16 19:01:34,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:34,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:34,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:34,460 INFO L225 Difference]: With dead ends: 250 [2020-01-16 19:01:34,460 INFO L226 Difference]: Without dead ends: 234 [2020-01-16 19:01:34,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 19:01:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-01-16 19:01:34,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 150. [2020-01-16 19:01:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 19:01:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 416 transitions. [2020-01-16 19:01:34,464 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 416 transitions. Word has length 19 [2020-01-16 19:01:34,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:34,464 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 416 transitions. [2020-01-16 19:01:34,464 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:34,464 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 416 transitions. [2020-01-16 19:01:34,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:34,464 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:34,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 19:01:34,465 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 19:01:34,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:34,465 INFO L82 PathProgramCache]: Analyzing trace with hash -926514892, now seen corresponding path program 488 times [2020-01-16 19:01:34,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:34,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174986056] [2020-01-16 19:01:34,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:34,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174986056] [2020-01-16 19:01:34,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:34,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:34,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419436081] [2020-01-16 19:01:34,696 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:34,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:34,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:34,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:34,697 INFO L87 Difference]: Start difference. First operand 150 states and 416 transitions. Second operand 8 states. [2020-01-16 19:01:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:34,787 INFO L93 Difference]: Finished difference Result 244 states and 562 transitions. [2020-01-16 19:01:34,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:34,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:34,788 INFO L225 Difference]: With dead ends: 244 [2020-01-16 19:01:34,788 INFO L226 Difference]: Without dead ends: 231 [2020-01-16 19:01:34,788 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-01-16 19:01:34,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 147. [2020-01-16 19:01:34,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 19:01:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 409 transitions. [2020-01-16 19:01:34,792 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 409 transitions. Word has length 19 [2020-01-16 19:01:34,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:34,792 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 409 transitions. [2020-01-16 19:01:34,793 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 409 transitions. [2020-01-16 19:01:34,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:34,793 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:34,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 19:01:34,793 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 19:01:34,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:34,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1975664054, now seen corresponding path program 489 times [2020-01-16 19:01:34,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:34,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583892170] [2020-01-16 19:01:34,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:35,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 19:01:35,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583892170] [2020-01-16 19:01:35,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:35,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:35,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180071437] [2020-01-16 19:01:35,055 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:35,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:35,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:35,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:35,055 INFO L87 Difference]: Start difference. First operand 147 states and 409 transitions. Second operand 8 states. [2020-01-16 19:01:35,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:35,116 INFO L93 Difference]: Finished difference Result 254 states and 586 transitions. [2020-01-16 19:01:35,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:35,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:35,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:35,117 INFO L225 Difference]: With dead ends: 254 [2020-01-16 19:01:35,117 INFO L226 Difference]: Without dead ends: 238 [2020-01-16 19:01:35,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 19:01:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-01-16 19:01:35,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 152. [2020-01-16 19:01:35,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 19:01:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 418 transitions. [2020-01-16 19:01:35,120 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 418 transitions. Word has length 19 [2020-01-16 19:01:35,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:35,121 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 418 transitions. [2020-01-16 19:01:35,121 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:35,121 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 418 transitions. [2020-01-16 19:01:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:35,121 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:35,121 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:35,121 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 19:01:35,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:35,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1568241148, now seen corresponding path program 490 times [2020-01-16 19:01:35,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:35,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186391371] [2020-01-16 19:01:35,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:35,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186391371] [2020-01-16 19:01:35,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:35,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:35,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083218182] [2020-01-16 19:01:35,342 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:35,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:35,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:35,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:35,343 INFO L87 Difference]: Start difference. First operand 152 states and 418 transitions. Second operand 8 states. [2020-01-16 19:01:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:35,422 INFO L93 Difference]: Finished difference Result 250 states and 574 transitions. [2020-01-16 19:01:35,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:35,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:35,423 INFO L225 Difference]: With dead ends: 250 [2020-01-16 19:01:35,423 INFO L226 Difference]: Without dead ends: 233 [2020-01-16 19:01:35,423 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:35,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-01-16 19:01:35,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 147. [2020-01-16 19:01:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 19:01:35,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 406 transitions. [2020-01-16 19:01:35,426 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 406 transitions. Word has length 19 [2020-01-16 19:01:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:35,427 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 406 transitions. [2020-01-16 19:01:35,427 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 406 transitions. [2020-01-16 19:01:35,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:35,427 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:35,427 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:35,427 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 19:01:35,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:35,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1566078992, now seen corresponding path program 491 times [2020-01-16 19:01:35,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:35,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804099419] [2020-01-16 19:01:35,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:35,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804099419] [2020-01-16 19:01:35,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:35,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:35,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25533093] [2020-01-16 19:01:35,644 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:35,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:35,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:35,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:35,645 INFO L87 Difference]: Start difference. First operand 147 states and 406 transitions. Second operand 8 states. [2020-01-16 19:01:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:35,727 INFO L93 Difference]: Finished difference Result 239 states and 550 transitions. [2020-01-16 19:01:35,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:35,727 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:35,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:35,728 INFO L225 Difference]: With dead ends: 239 [2020-01-16 19:01:35,728 INFO L226 Difference]: Without dead ends: 229 [2020-01-16 19:01:35,728 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-01-16 19:01:35,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 149. [2020-01-16 19:01:35,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 19:01:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 409 transitions. [2020-01-16 19:01:35,731 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 409 transitions. Word has length 19 [2020-01-16 19:01:35,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:35,732 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 409 transitions. [2020-01-16 19:01:35,732 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:35,732 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 409 transitions. [2020-01-16 19:01:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:35,732 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:35,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 19:01:35,732 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 19:01:35,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:35,732 INFO L82 PathProgramCache]: Analyzing trace with hash 144534316, now seen corresponding path program 492 times [2020-01-16 19:01:35,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:35,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483711728] [2020-01-16 19:01:35,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:35,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 19:01:35,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483711728] [2020-01-16 19:01:35,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:35,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:35,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596119307] [2020-01-16 19:01:35,945 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:35,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:35,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:35,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:35,946 INFO L87 Difference]: Start difference. First operand 149 states and 409 transitions. Second operand 8 states. [2020-01-16 19:01:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:36,040 INFO L93 Difference]: Finished difference Result 241 states and 553 transitions. [2020-01-16 19:01:36,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:36,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:36,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:36,041 INFO L225 Difference]: With dead ends: 241 [2020-01-16 19:01:36,041 INFO L226 Difference]: Without dead ends: 224 [2020-01-16 19:01:36,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:36,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-01-16 19:01:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2020-01-16 19:01:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-01-16 19:01:36,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 400 transitions. [2020-01-16 19:01:36,045 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 400 transitions. Word has length 19 [2020-01-16 19:01:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:36,045 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 400 transitions. [2020-01-16 19:01:36,045 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 400 transitions. [2020-01-16 19:01:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:36,046 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:36,046 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:36,046 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 19:01:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:36,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1550807878, now seen corresponding path program 493 times [2020-01-16 19:01:36,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:36,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389831802] [2020-01-16 19:01:36,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:36,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389831802] [2020-01-16 19:01:36,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:36,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:36,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233662533] [2020-01-16 19:01:36,290 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:36,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:36,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:36,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:36,290 INFO L87 Difference]: Start difference. First operand 144 states and 400 transitions. Second operand 8 states. [2020-01-16 19:01:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:36,356 INFO L93 Difference]: Finished difference Result 250 states and 575 transitions. [2020-01-16 19:01:36,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:36,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:36,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:36,357 INFO L225 Difference]: With dead ends: 250 [2020-01-16 19:01:36,357 INFO L226 Difference]: Without dead ends: 234 [2020-01-16 19:01:36,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 19:01:36,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-01-16 19:01:36,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 150. [2020-01-16 19:01:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-01-16 19:01:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 414 transitions. [2020-01-16 19:01:36,361 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 414 transitions. Word has length 19 [2020-01-16 19:01:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:36,361 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 414 transitions. [2020-01-16 19:01:36,362 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:36,362 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 414 transitions. [2020-01-16 19:01:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:36,362 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:36,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 19:01:36,362 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 19:01:36,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:36,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1809866104, now seen corresponding path program 494 times [2020-01-16 19:01:36,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:36,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183846777] [2020-01-16 19:01:36,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:36,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183846777] [2020-01-16 19:01:36,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:36,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:36,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472367439] [2020-01-16 19:01:36,579 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:36,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:36,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:36,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:36,580 INFO L87 Difference]: Start difference. First operand 150 states and 414 transitions. Second operand 8 states. [2020-01-16 19:01:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:36,648 INFO L93 Difference]: Finished difference Result 244 states and 560 transitions. [2020-01-16 19:01:36,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:36,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:36,650 INFO L225 Difference]: With dead ends: 244 [2020-01-16 19:01:36,650 INFO L226 Difference]: Without dead ends: 231 [2020-01-16 19:01:36,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 19:01:36,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-01-16 19:01:36,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 147. [2020-01-16 19:01:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 19:01:36,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 407 transitions. [2020-01-16 19:01:36,653 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 407 transitions. Word has length 19 [2020-01-16 19:01:36,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:36,653 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 407 transitions. [2020-01-16 19:01:36,653 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 407 transitions. [2020-01-16 19:01:36,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:36,654 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:36,654 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:36,654 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 19:01:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash -49629976, now seen corresponding path program 495 times [2020-01-16 19:01:36,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:36,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369943105] [2020-01-16 19:01:36,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:36,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369943105] [2020-01-16 19:01:36,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:36,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:36,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29250096] [2020-01-16 19:01:36,879 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:36,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:36,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:36,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:36,880 INFO L87 Difference]: Start difference. First operand 147 states and 407 transitions. Second operand 8 states. [2020-01-16 19:01:36,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:36,946 INFO L93 Difference]: Finished difference Result 254 states and 584 transitions. [2020-01-16 19:01:36,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:36,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:36,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:36,948 INFO L225 Difference]: With dead ends: 254 [2020-01-16 19:01:36,948 INFO L226 Difference]: Without dead ends: 238 [2020-01-16 19:01:36,948 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:36,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-01-16 19:01:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 152. [2020-01-16 19:01:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-01-16 19:01:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 416 transitions. [2020-01-16 19:01:36,952 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 416 transitions. Word has length 19 [2020-01-16 19:01:36,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:36,952 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 416 transitions. [2020-01-16 19:01:36,952 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:36,952 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 416 transitions. [2020-01-16 19:01:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:36,952 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:36,952 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:36,952 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 19:01:36,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:36,953 INFO L82 PathProgramCache]: Analyzing trace with hash -800692070, now seen corresponding path program 496 times [2020-01-16 19:01:36,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:36,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374145144] [2020-01-16 19:01:36,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:37,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 19:01:37,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374145144] [2020-01-16 19:01:37,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:37,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:37,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503147567] [2020-01-16 19:01:37,178 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:37,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:37,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:37,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:37,178 INFO L87 Difference]: Start difference. First operand 152 states and 416 transitions. Second operand 8 states. [2020-01-16 19:01:37,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:37,271 INFO L93 Difference]: Finished difference Result 250 states and 572 transitions. [2020-01-16 19:01:37,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:37,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:37,272 INFO L225 Difference]: With dead ends: 250 [2020-01-16 19:01:37,272 INFO L226 Difference]: Without dead ends: 233 [2020-01-16 19:01:37,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 19:01:37,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-01-16 19:01:37,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 147. [2020-01-16 19:01:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 19:01:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 404 transitions. [2020-01-16 19:01:37,277 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 404 transitions. Word has length 19 [2020-01-16 19:01:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:37,277 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 404 transitions. [2020-01-16 19:01:37,277 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 404 transitions. [2020-01-16 19:01:37,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:37,278 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:37,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 19:01:37,278 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 19:01:37,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:37,278 INFO L82 PathProgramCache]: Analyzing trace with hash 350791652, now seen corresponding path program 497 times [2020-01-16 19:01:37,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:37,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360569844] [2020-01-16 19:01:37,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:37,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 19:01:37,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360569844] [2020-01-16 19:01:37,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:37,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:37,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186221373] [2020-01-16 19:01:37,511 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:37,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:37,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:37,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:37,511 INFO L87 Difference]: Start difference. First operand 147 states and 404 transitions. Second operand 8 states. [2020-01-16 19:01:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:37,585 INFO L93 Difference]: Finished difference Result 239 states and 548 transitions. [2020-01-16 19:01:37,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:37,585 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:37,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:37,586 INFO L225 Difference]: With dead ends: 239 [2020-01-16 19:01:37,586 INFO L226 Difference]: Without dead ends: 229 [2020-01-16 19:01:37,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-01-16 19:01:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 149. [2020-01-16 19:01:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 19:01:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 407 transitions. [2020-01-16 19:01:37,590 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 407 transitions. Word has length 19 [2020-01-16 19:01:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:37,590 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 407 transitions. [2020-01-16 19:01:37,591 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 407 transitions. [2020-01-16 19:01:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:37,591 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:37,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 19:01:37,591 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 19:01:37,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:37,591 INFO L82 PathProgramCache]: Analyzing trace with hash -504515002, now seen corresponding path program 498 times [2020-01-16 19:01:37,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:37,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638299515] [2020-01-16 19:01:37,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:37,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638299515] [2020-01-16 19:01:37,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:37,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:37,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364520548] [2020-01-16 19:01:37,808 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:37,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:37,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:37,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:37,809 INFO L87 Difference]: Start difference. First operand 149 states and 407 transitions. Second operand 8 states. [2020-01-16 19:01:37,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:37,896 INFO L93 Difference]: Finished difference Result 241 states and 551 transitions. [2020-01-16 19:01:37,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:37,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:37,897 INFO L225 Difference]: With dead ends: 241 [2020-01-16 19:01:37,897 INFO L226 Difference]: Without dead ends: 224 [2020-01-16 19:01:37,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 19:01:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-01-16 19:01:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2020-01-16 19:01:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-01-16 19:01:37,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 398 transitions. [2020-01-16 19:01:37,900 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 398 transitions. Word has length 19 [2020-01-16 19:01:37,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:37,900 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 398 transitions. [2020-01-16 19:01:37,900 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:37,901 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 398 transitions. [2020-01-16 19:01:37,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:37,901 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:37,901 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:37,901 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 19:01:37,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:37,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1269308130, now seen corresponding path program 499 times [2020-01-16 19:01:37,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:37,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790921856] [2020-01-16 19:01:37,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:38,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790921856] [2020-01-16 19:01:38,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:38,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:38,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288433936] [2020-01-16 19:01:38,128 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:38,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:38,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:38,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:38,128 INFO L87 Difference]: Start difference. First operand 144 states and 398 transitions. Second operand 8 states. [2020-01-16 19:01:38,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:38,220 INFO L93 Difference]: Finished difference Result 223 states and 511 transitions. [2020-01-16 19:01:38,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:38,221 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:38,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:38,221 INFO L225 Difference]: With dead ends: 223 [2020-01-16 19:01:38,222 INFO L226 Difference]: Without dead ends: 213 [2020-01-16 19:01:38,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 19:01:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-01-16 19:01:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 146. [2020-01-16 19:01:38,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-01-16 19:01:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 402 transitions. [2020-01-16 19:01:38,225 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 402 transitions. Word has length 19 [2020-01-16 19:01:38,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:38,225 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 402 transitions. [2020-01-16 19:01:38,225 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:38,225 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 402 transitions. [2020-01-16 19:01:38,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:38,225 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:38,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 19:01:38,226 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 19:01:38,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:38,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1508950468, now seen corresponding path program 500 times [2020-01-16 19:01:38,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:38,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38081208] [2020-01-16 19:01:38,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:38,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 19:01:38,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38081208] [2020-01-16 19:01:38,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:38,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:38,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554076994] [2020-01-16 19:01:38,457 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:38,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:38,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:38,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:38,458 INFO L87 Difference]: Start difference. First operand 146 states and 402 transitions. Second operand 8 states. [2020-01-16 19:01:38,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:38,534 INFO L93 Difference]: Finished difference Result 223 states and 510 transitions. [2020-01-16 19:01:38,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:38,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:38,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:38,535 INFO L225 Difference]: With dead ends: 223 [2020-01-16 19:01:38,535 INFO L226 Difference]: Without dead ends: 212 [2020-01-16 19:01:38,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-01-16 19:01:38,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 145. [2020-01-16 19:01:38,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-01-16 19:01:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 400 transitions. [2020-01-16 19:01:38,538 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 400 transitions. Word has length 19 [2020-01-16 19:01:38,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:38,538 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 400 transitions. [2020-01-16 19:01:38,539 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:38,539 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 400 transitions. [2020-01-16 19:01:38,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:38,539 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:38,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 19:01:38,539 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 19:01:38,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:38,539 INFO L82 PathProgramCache]: Analyzing trace with hash -2014010628, now seen corresponding path program 501 times [2020-01-16 19:01:38,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:38,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054462942] [2020-01-16 19:01:38,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:38,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:38,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054462942] [2020-01-16 19:01:38,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:38,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:38,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638544176] [2020-01-16 19:01:38,765 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:38,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:38,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:38,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:38,766 INFO L87 Difference]: Start difference. First operand 145 states and 400 transitions. Second operand 8 states. [2020-01-16 19:01:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:38,859 INFO L93 Difference]: Finished difference Result 226 states and 518 transitions. [2020-01-16 19:01:38,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:38,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:38,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:38,860 INFO L225 Difference]: With dead ends: 226 [2020-01-16 19:01:38,860 INFO L226 Difference]: Without dead ends: 216 [2020-01-16 19:01:38,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 19:01:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-01-16 19:01:38,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 147. [2020-01-16 19:01:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 19:01:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 403 transitions. [2020-01-16 19:01:38,864 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 403 transitions. Word has length 19 [2020-01-16 19:01:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:38,864 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 403 transitions. [2020-01-16 19:01:38,864 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 403 transitions. [2020-01-16 19:01:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:38,865 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:38,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 19:01:38,865 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 19:01:38,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:38,865 INFO L82 PathProgramCache]: Analyzing trace with hash -303397320, now seen corresponding path program 502 times [2020-01-16 19:01:38,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:38,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441601432] [2020-01-16 19:01:38,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:39,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 19:01:39,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441601432] [2020-01-16 19:01:39,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:39,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:39,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989372993] [2020-01-16 19:01:39,085 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:39,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:39,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:39,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:39,085 INFO L87 Difference]: Start difference. First operand 147 states and 403 transitions. Second operand 8 states. [2020-01-16 19:01:39,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:39,180 INFO L93 Difference]: Finished difference Result 228 states and 521 transitions. [2020-01-16 19:01:39,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:39,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:39,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:39,181 INFO L225 Difference]: With dead ends: 228 [2020-01-16 19:01:39,181 INFO L226 Difference]: Without dead ends: 214 [2020-01-16 19:01:39,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:39,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-01-16 19:01:39,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 145. [2020-01-16 19:01:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-01-16 19:01:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 399 transitions. [2020-01-16 19:01:39,185 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 399 transitions. Word has length 19 [2020-01-16 19:01:39,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:39,186 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 399 transitions. [2020-01-16 19:01:39,186 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 399 transitions. [2020-01-16 19:01:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:39,186 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:39,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 19:01:39,186 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 19:01:39,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:39,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1712931448, now seen corresponding path program 503 times [2020-01-16 19:01:39,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:39,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366449772] [2020-01-16 19:01:39,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:39,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 19:01:39,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366449772] [2020-01-16 19:01:39,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:39,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:39,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444924971] [2020-01-16 19:01:39,412 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:39,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:39,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:39,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:39,412 INFO L87 Difference]: Start difference. First operand 145 states and 399 transitions. Second operand 8 states. [2020-01-16 19:01:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:39,481 INFO L93 Difference]: Finished difference Result 226 states and 517 transitions. [2020-01-16 19:01:39,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:39,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:39,482 INFO L225 Difference]: With dead ends: 226 [2020-01-16 19:01:39,483 INFO L226 Difference]: Without dead ends: 216 [2020-01-16 19:01:39,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:39,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-01-16 19:01:39,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 147. [2020-01-16 19:01:39,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-01-16 19:01:39,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 402 transitions. [2020-01-16 19:01:39,486 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 402 transitions. Word has length 19 [2020-01-16 19:01:39,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:39,487 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 402 transitions. [2020-01-16 19:01:39,487 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:39,487 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 402 transitions. [2020-01-16 19:01:39,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:39,487 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:39,487 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:39,487 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 19:01:39,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:39,487 INFO L82 PathProgramCache]: Analyzing trace with hash 857624794, now seen corresponding path program 504 times [2020-01-16 19:01:39,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:39,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978584059] [2020-01-16 19:01:39,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:39,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 19:01:39,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978584059] [2020-01-16 19:01:39,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:39,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:39,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694243120] [2020-01-16 19:01:39,723 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:39,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:39,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:39,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:39,723 INFO L87 Difference]: Start difference. First operand 147 states and 402 transitions. Second operand 8 states. [2020-01-16 19:01:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:39,816 INFO L93 Difference]: Finished difference Result 228 states and 520 transitions. [2020-01-16 19:01:39,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:39,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:39,817 INFO L225 Difference]: With dead ends: 228 [2020-01-16 19:01:39,818 INFO L226 Difference]: Without dead ends: 211 [2020-01-16 19:01:39,818 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-01-16 19:01:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 142. [2020-01-16 19:01:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-01-16 19:01:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 394 transitions. [2020-01-16 19:01:39,821 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 394 transitions. Word has length 19 [2020-01-16 19:01:39,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:39,821 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 394 transitions. [2020-01-16 19:01:39,821 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 394 transitions. [2020-01-16 19:01:39,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:39,822 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:39,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 19:01:39,822 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 19:01:39,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:39,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1123308150, now seen corresponding path program 505 times [2020-01-16 19:01:39,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:39,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576758671] [2020-01-16 19:01:39,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:40,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576758671] [2020-01-16 19:01:40,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:40,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:40,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115464427] [2020-01-16 19:01:40,027 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:40,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:40,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:40,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:40,028 INFO L87 Difference]: Start difference. First operand 142 states and 394 transitions. Second operand 8 states. [2020-01-16 19:01:40,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:40,093 INFO L93 Difference]: Finished difference Result 241 states and 546 transitions. [2020-01-16 19:01:40,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:40,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:40,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:40,094 INFO L225 Difference]: With dead ends: 241 [2020-01-16 19:01:40,095 INFO L226 Difference]: Without dead ends: 225 [2020-01-16 19:01:40,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 19:01:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-01-16 19:01:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 145. [2020-01-16 19:01:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-01-16 19:01:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 398 transitions. [2020-01-16 19:01:40,098 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 398 transitions. Word has length 19 [2020-01-16 19:01:40,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:40,098 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 398 transitions. [2020-01-16 19:01:40,098 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:40,098 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 398 transitions. [2020-01-16 19:01:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:40,099 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:40,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 19:01:40,099 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 19:01:40,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:40,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1019932600, now seen corresponding path program 506 times [2020-01-16 19:01:40,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:40,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333374855] [2020-01-16 19:01:40,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:40,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333374855] [2020-01-16 19:01:40,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:40,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:40,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775896164] [2020-01-16 19:01:40,299 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:40,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:40,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:40,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:40,299 INFO L87 Difference]: Start difference. First operand 145 states and 398 transitions. Second operand 8 states. [2020-01-16 19:01:40,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:40,381 INFO L93 Difference]: Finished difference Result 235 states and 531 transitions. [2020-01-16 19:01:40,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:40,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:40,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:40,382 INFO L225 Difference]: With dead ends: 235 [2020-01-16 19:01:40,382 INFO L226 Difference]: Without dead ends: 222 [2020-01-16 19:01:40,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 19:01:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-01-16 19:01:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 142. [2020-01-16 19:01:40,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-01-16 19:01:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 392 transitions. [2020-01-16 19:01:40,386 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 392 transitions. Word has length 19 [2020-01-16 19:01:40,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:40,387 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 392 transitions. [2020-01-16 19:01:40,387 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 392 transitions. [2020-01-16 19:01:40,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:40,387 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:40,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:40,387 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 19:01:40,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:40,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1571221292, now seen corresponding path program 507 times [2020-01-16 19:01:40,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:40,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185644433] [2020-01-16 19:01:40,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:40,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 19:01:40,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185644433] [2020-01-16 19:01:40,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:40,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:40,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027395201] [2020-01-16 19:01:40,596 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:40,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:40,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:40,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:40,597 INFO L87 Difference]: Start difference. First operand 142 states and 392 transitions. Second operand 8 states. [2020-01-16 19:01:40,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:40,658 INFO L93 Difference]: Finished difference Result 241 states and 544 transitions. [2020-01-16 19:01:40,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:40,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:40,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:40,659 INFO L225 Difference]: With dead ends: 241 [2020-01-16 19:01:40,659 INFO L226 Difference]: Without dead ends: 225 [2020-01-16 19:01:40,660 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:40,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-01-16 19:01:40,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 145. [2020-01-16 19:01:40,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-01-16 19:01:40,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 396 transitions. [2020-01-16 19:01:40,663 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 396 transitions. Word has length 19 [2020-01-16 19:01:40,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:40,664 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 396 transitions. [2020-01-16 19:01:40,664 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 396 transitions. [2020-01-16 19:01:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:40,664 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:40,664 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:40,664 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 19:01:40,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:40,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1830279518, now seen corresponding path program 508 times [2020-01-16 19:01:40,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:40,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358305461] [2020-01-16 19:01:40,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:40,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358305461] [2020-01-16 19:01:40,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:40,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:40,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926829724] [2020-01-16 19:01:40,885 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:40,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:40,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:40,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:40,886 INFO L87 Difference]: Start difference. First operand 145 states and 396 transitions. Second operand 8 states. [2020-01-16 19:01:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:40,965 INFO L93 Difference]: Finished difference Result 235 states and 529 transitions. [2020-01-16 19:01:40,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:40,965 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:40,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:40,966 INFO L225 Difference]: With dead ends: 235 [2020-01-16 19:01:40,966 INFO L226 Difference]: Without dead ends: 222 [2020-01-16 19:01:40,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 19:01:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-01-16 19:01:40,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 142. [2020-01-16 19:01:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-01-16 19:01:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 390 transitions. [2020-01-16 19:01:40,972 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 390 transitions. Word has length 19 [2020-01-16 19:01:40,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:40,972 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 390 transitions. [2020-01-16 19:01:40,972 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:40,972 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 390 transitions. [2020-01-16 19:01:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:40,973 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:40,973 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:40,973 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 19:01:40,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:40,973 INFO L82 PathProgramCache]: Analyzing trace with hash 589841196, now seen corresponding path program 509 times [2020-01-16 19:01:40,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:40,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950823131] [2020-01-16 19:01:40,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:41,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 19:01:41,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950823131] [2020-01-16 19:01:41,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:41,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:41,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130550707] [2020-01-16 19:01:41,199 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:41,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:41,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:41,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:41,200 INFO L87 Difference]: Start difference. First operand 142 states and 390 transitions. Second operand 8 states. [2020-01-16 19:01:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:41,290 INFO L93 Difference]: Finished difference Result 227 states and 513 transitions. [2020-01-16 19:01:41,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:41,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:41,291 INFO L225 Difference]: With dead ends: 227 [2020-01-16 19:01:41,291 INFO L226 Difference]: Without dead ends: 217 [2020-01-16 19:01:41,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:41,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-01-16 19:01:41,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 143. [2020-01-16 19:01:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-01-16 19:01:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 391 transitions. [2020-01-16 19:01:41,296 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 391 transitions. Word has length 19 [2020-01-16 19:01:41,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:41,296 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 391 transitions. [2020-01-16 19:01:41,296 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 391 transitions. [2020-01-16 19:01:41,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:41,296 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:41,297 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:41,297 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 19:01:41,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:41,297 INFO L82 PathProgramCache]: Analyzing trace with hash 350198858, now seen corresponding path program 510 times [2020-01-16 19:01:41,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:41,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836295233] [2020-01-16 19:01:41,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:41,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 19:01:41,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836295233] [2020-01-16 19:01:41,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:41,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:41,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24055335] [2020-01-16 19:01:41,511 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:41,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:41,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:41,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:41,511 INFO L87 Difference]: Start difference. First operand 143 states and 391 transitions. Second operand 8 states. [2020-01-16 19:01:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:41,584 INFO L93 Difference]: Finished difference Result 227 states and 512 transitions. [2020-01-16 19:01:41,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:41,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:41,585 INFO L225 Difference]: With dead ends: 227 [2020-01-16 19:01:41,585 INFO L226 Difference]: Without dead ends: 214 [2020-01-16 19:01:41,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 19:01:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-01-16 19:01:41,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 140. [2020-01-16 19:01:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-01-16 19:01:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 386 transitions. [2020-01-16 19:01:41,588 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 386 transitions. Word has length 19 [2020-01-16 19:01:41,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:41,588 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 386 transitions. [2020-01-16 19:01:41,588 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 386 transitions. [2020-01-16 19:01:41,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:41,589 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:41,589 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:41,589 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 19:01:41,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:41,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1566207290, now seen corresponding path program 511 times [2020-01-16 19:01:41,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:41,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413076345] [2020-01-16 19:01:41,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:41,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413076345] [2020-01-16 19:01:41,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:41,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:41,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654947281] [2020-01-16 19:01:41,775 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:41,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:41,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:41,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:41,775 INFO L87 Difference]: Start difference. First operand 140 states and 386 transitions. Second operand 8 states. [2020-01-16 19:01:41,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:41,845 INFO L93 Difference]: Finished difference Result 246 states and 561 transitions. [2020-01-16 19:01:41,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:41,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:41,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:41,846 INFO L225 Difference]: With dead ends: 246 [2020-01-16 19:01:41,846 INFO L226 Difference]: Without dead ends: 230 [2020-01-16 19:01:41,846 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 19:01:41,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-01-16 19:01:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 146. [2020-01-16 19:01:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-01-16 19:01:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 400 transitions. [2020-01-16 19:01:41,851 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 400 transitions. Word has length 19 [2020-01-16 19:01:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:41,851 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 400 transitions. [2020-01-16 19:01:41,851 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 400 transitions. [2020-01-16 19:01:41,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:41,851 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:41,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 19:01:41,852 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 19:01:41,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:41,852 INFO L82 PathProgramCache]: Analyzing trace with hash 577033460, now seen corresponding path program 512 times [2020-01-16 19:01:41,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:41,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082614229] [2020-01-16 19:01:41,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:42,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082614229] [2020-01-16 19:01:42,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:42,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:42,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991296949] [2020-01-16 19:01:42,030 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:42,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:42,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:42,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:42,030 INFO L87 Difference]: Start difference. First operand 146 states and 400 transitions. Second operand 8 states. [2020-01-16 19:01:42,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:42,119 INFO L93 Difference]: Finished difference Result 240 states and 546 transitions. [2020-01-16 19:01:42,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:42,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:42,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:42,120 INFO L225 Difference]: With dead ends: 240 [2020-01-16 19:01:42,120 INFO L226 Difference]: Without dead ends: 227 [2020-01-16 19:01:42,121 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:42,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-01-16 19:01:42,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2020-01-16 19:01:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-01-16 19:01:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 393 transitions. [2020-01-16 19:01:42,124 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 393 transitions. Word has length 19 [2020-01-16 19:01:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:42,124 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 393 transitions. [2020-01-16 19:01:42,124 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 393 transitions. [2020-01-16 19:01:42,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:42,125 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:42,125 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:42,125 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 19:01:42,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:42,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2072553556, now seen corresponding path program 513 times [2020-01-16 19:01:42,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:42,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817423544] [2020-01-16 19:01:42,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:42,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817423544] [2020-01-16 19:01:42,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:42,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:42,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122769517] [2020-01-16 19:01:42,316 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:42,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:42,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:42,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:42,316 INFO L87 Difference]: Start difference. First operand 143 states and 393 transitions. Second operand 8 states. [2020-01-16 19:01:42,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:42,388 INFO L93 Difference]: Finished difference Result 244 states and 560 transitions. [2020-01-16 19:01:42,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:42,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:42,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:42,389 INFO L225 Difference]: With dead ends: 244 [2020-01-16 19:01:42,389 INFO L226 Difference]: Without dead ends: 228 [2020-01-16 19:01:42,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 19:01:42,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-01-16 19:01:42,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-01-16 19:01:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 19:01:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 404 transitions. [2020-01-16 19:01:42,394 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 404 transitions. Word has length 19 [2020-01-16 19:01:42,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:42,394 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 404 transitions. [2020-01-16 19:01:42,394 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 404 transitions. [2020-01-16 19:01:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:42,395 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:42,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 19:01:42,395 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 19:01:42,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:42,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1246208990, now seen corresponding path program 514 times [2020-01-16 19:01:42,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:42,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559543370] [2020-01-16 19:01:42,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:42,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559543370] [2020-01-16 19:01:42,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:42,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:42,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394991296] [2020-01-16 19:01:42,582 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:42,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:42,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:42,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:42,583 INFO L87 Difference]: Start difference. First operand 149 states and 404 transitions. Second operand 8 states. [2020-01-16 19:01:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:42,673 INFO L93 Difference]: Finished difference Result 232 states and 540 transitions. [2020-01-16 19:01:42,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:42,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:42,674 INFO L225 Difference]: With dead ends: 232 [2020-01-16 19:01:42,674 INFO L226 Difference]: Without dead ends: 213 [2020-01-16 19:01:42,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-01-16 19:01:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 143. [2020-01-16 19:01:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-01-16 19:01:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 390 transitions. [2020-01-16 19:01:42,678 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 390 transitions. Word has length 19 [2020-01-16 19:01:42,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:42,678 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 390 transitions. [2020-01-16 19:01:42,678 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 390 transitions. [2020-01-16 19:01:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:42,679 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:42,679 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:42,679 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 19:01:42,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:42,679 INFO L82 PathProgramCache]: Analyzing trace with hash 692674962, now seen corresponding path program 515 times [2020-01-16 19:01:42,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:42,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710794218] [2020-01-16 19:01:42,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:42,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710794218] [2020-01-16 19:01:42,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:42,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:42,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403678243] [2020-01-16 19:01:42,861 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:42,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:42,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:42,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:42,861 INFO L87 Difference]: Start difference. First operand 143 states and 390 transitions. Second operand 8 states. [2020-01-16 19:01:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:42,950 INFO L93 Difference]: Finished difference Result 234 states and 533 transitions. [2020-01-16 19:01:42,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:42,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:42,951 INFO L225 Difference]: With dead ends: 234 [2020-01-16 19:01:42,952 INFO L226 Difference]: Without dead ends: 224 [2020-01-16 19:01:42,952 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-01-16 19:01:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 145. [2020-01-16 19:01:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-01-16 19:01:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 393 transitions. [2020-01-16 19:01:42,956 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 393 transitions. Word has length 19 [2020-01-16 19:01:42,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:42,956 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 393 transitions. [2020-01-16 19:01:42,956 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 393 transitions. [2020-01-16 19:01:42,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:42,957 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:42,957 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:42,957 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 19:01:42,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:42,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1036372372, now seen corresponding path program 516 times [2020-01-16 19:01:42,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:42,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129019297] [2020-01-16 19:01:42,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:43,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129019297] [2020-01-16 19:01:43,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:43,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:43,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65614439] [2020-01-16 19:01:43,145 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:43,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:43,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:43,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:43,145 INFO L87 Difference]: Start difference. First operand 145 states and 393 transitions. Second operand 8 states. [2020-01-16 19:01:43,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:43,233 INFO L93 Difference]: Finished difference Result 228 states and 529 transitions. [2020-01-16 19:01:43,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:43,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:43,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:43,235 INFO L225 Difference]: With dead ends: 228 [2020-01-16 19:01:43,235 INFO L226 Difference]: Without dead ends: 210 [2020-01-16 19:01:43,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:43,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-01-16 19:01:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 140. [2020-01-16 19:01:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-01-16 19:01:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 384 transitions. [2020-01-16 19:01:43,238 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 384 transitions. Word has length 19 [2020-01-16 19:01:43,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:43,238 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 384 transitions. [2020-01-16 19:01:43,238 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 384 transitions. [2020-01-16 19:01:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:43,239 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:43,239 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:43,239 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 19:01:43,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:43,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1240611066, now seen corresponding path program 517 times [2020-01-16 19:01:43,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:43,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814402708] [2020-01-16 19:01:43,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:43,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814402708] [2020-01-16 19:01:43,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:43,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:43,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996303505] [2020-01-16 19:01:43,442 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:43,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:43,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:43,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:43,443 INFO L87 Difference]: Start difference. First operand 140 states and 384 transitions. Second operand 8 states. [2020-01-16 19:01:43,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:43,508 INFO L93 Difference]: Finished difference Result 246 states and 559 transitions. [2020-01-16 19:01:43,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:43,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:43,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:43,509 INFO L225 Difference]: With dead ends: 246 [2020-01-16 19:01:43,509 INFO L226 Difference]: Without dead ends: 230 [2020-01-16 19:01:43,509 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:43,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-01-16 19:01:43,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 146. [2020-01-16 19:01:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-01-16 19:01:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 398 transitions. [2020-01-16 19:01:43,513 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 398 transitions. Word has length 19 [2020-01-16 19:01:43,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:43,513 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 398 transitions. [2020-01-16 19:01:43,514 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 398 transitions. [2020-01-16 19:01:43,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:43,514 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:43,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 19:01:43,514 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 19:01:43,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:43,514 INFO L82 PathProgramCache]: Analyzing trace with hash -981552840, now seen corresponding path program 518 times [2020-01-16 19:01:43,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:43,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392159584] [2020-01-16 19:01:43,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:43,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392159584] [2020-01-16 19:01:43,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:43,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:43,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740922688] [2020-01-16 19:01:43,744 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:43,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:43,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:43,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:43,745 INFO L87 Difference]: Start difference. First operand 146 states and 398 transitions. Second operand 8 states. [2020-01-16 19:01:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:43,810 INFO L93 Difference]: Finished difference Result 240 states and 544 transitions. [2020-01-16 19:01:43,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:43,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:43,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:43,811 INFO L225 Difference]: With dead ends: 240 [2020-01-16 19:01:43,811 INFO L226 Difference]: Without dead ends: 227 [2020-01-16 19:01:43,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 19:01:43,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-01-16 19:01:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2020-01-16 19:01:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-01-16 19:01:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 391 transitions. [2020-01-16 19:01:43,815 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 391 transitions. Word has length 19 [2020-01-16 19:01:43,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:43,815 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 391 transitions. [2020-01-16 19:01:43,815 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:43,815 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 391 transitions. [2020-01-16 19:01:43,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:43,816 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:43,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 19:01:43,816 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 19:01:43,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:43,816 INFO L82 PathProgramCache]: Analyzing trace with hash -146519478, now seen corresponding path program 519 times [2020-01-16 19:01:43,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:43,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810302099] [2020-01-16 19:01:43,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:44,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 19:01:44,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810302099] [2020-01-16 19:01:44,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:44,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:44,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903951309] [2020-01-16 19:01:44,014 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:44,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:44,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:44,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:44,014 INFO L87 Difference]: Start difference. First operand 143 states and 391 transitions. Second operand 8 states. [2020-01-16 19:01:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:44,081 INFO L93 Difference]: Finished difference Result 244 states and 558 transitions. [2020-01-16 19:01:44,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:44,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:44,082 INFO L225 Difference]: With dead ends: 244 [2020-01-16 19:01:44,083 INFO L226 Difference]: Without dead ends: 228 [2020-01-16 19:01:44,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 19:01:44,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-01-16 19:01:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2020-01-16 19:01:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-01-16 19:01:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 402 transitions. [2020-01-16 19:01:44,086 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 402 transitions. Word has length 19 [2020-01-16 19:01:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:44,086 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 402 transitions. [2020-01-16 19:01:44,087 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 402 transitions. [2020-01-16 19:01:44,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:44,087 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:44,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 19:01:44,087 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 19:01:44,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:44,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1122724228, now seen corresponding path program 520 times [2020-01-16 19:01:44,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:44,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860397966] [2020-01-16 19:01:44,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:44,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 19:01:44,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860397966] [2020-01-16 19:01:44,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:44,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:44,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23497638] [2020-01-16 19:01:44,288 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:44,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:44,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:44,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:44,288 INFO L87 Difference]: Start difference. First operand 149 states and 402 transitions. Second operand 8 states. [2020-01-16 19:01:44,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:44,373 INFO L93 Difference]: Finished difference Result 232 states and 538 transitions. [2020-01-16 19:01:44,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:44,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:44,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:44,374 INFO L225 Difference]: With dead ends: 232 [2020-01-16 19:01:44,375 INFO L226 Difference]: Without dead ends: 213 [2020-01-16 19:01:44,375 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-01-16 19:01:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 143. [2020-01-16 19:01:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-01-16 19:01:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 388 transitions. [2020-01-16 19:01:44,379 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 388 transitions. Word has length 19 [2020-01-16 19:01:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:44,379 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 388 transitions. [2020-01-16 19:01:44,379 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 388 transitions. [2020-01-16 19:01:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:44,379 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:44,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 19:01:44,380 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 19:01:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:44,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1864843108, now seen corresponding path program 521 times [2020-01-16 19:01:44,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:44,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474026093] [2020-01-16 19:01:44,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:44,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:44,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474026093] [2020-01-16 19:01:44,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:44,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:44,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777053430] [2020-01-16 19:01:44,578 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:44,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:44,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:44,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:44,579 INFO L87 Difference]: Start difference. First operand 143 states and 388 transitions. Second operand 8 states. [2020-01-16 19:01:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:44,649 INFO L93 Difference]: Finished difference Result 234 states and 531 transitions. [2020-01-16 19:01:44,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:44,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:44,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:44,650 INFO L225 Difference]: With dead ends: 234 [2020-01-16 19:01:44,650 INFO L226 Difference]: Without dead ends: 224 [2020-01-16 19:01:44,651 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:44,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-01-16 19:01:44,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 145. [2020-01-16 19:01:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-01-16 19:01:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 391 transitions. [2020-01-16 19:01:44,654 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 391 transitions. Word has length 19 [2020-01-16 19:01:44,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:44,655 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 391 transitions. [2020-01-16 19:01:44,655 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 391 transitions. [2020-01-16 19:01:44,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:44,655 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:44,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:44,655 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 19:01:44,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:44,656 INFO L82 PathProgramCache]: Analyzing trace with hash -940719192, now seen corresponding path program 522 times [2020-01-16 19:01:44,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:44,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708154183] [2020-01-16 19:01:44,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:44,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 19:01:44,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708154183] [2020-01-16 19:01:44,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:44,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:44,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706520814] [2020-01-16 19:01:44,850 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:44,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:44,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:44,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:44,850 INFO L87 Difference]: Start difference. First operand 145 states and 391 transitions. Second operand 8 states. [2020-01-16 19:01:44,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:44,943 INFO L93 Difference]: Finished difference Result 228 states and 527 transitions. [2020-01-16 19:01:44,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:44,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:44,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:44,944 INFO L225 Difference]: With dead ends: 228 [2020-01-16 19:01:44,944 INFO L226 Difference]: Without dead ends: 210 [2020-01-16 19:01:44,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 19:01:44,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-01-16 19:01:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 140. [2020-01-16 19:01:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-01-16 19:01:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 382 transitions. [2020-01-16 19:01:44,949 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 382 transitions. Word has length 19 [2020-01-16 19:01:44,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:44,949 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 382 transitions. [2020-01-16 19:01:44,949 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:44,949 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 382 transitions. [2020-01-16 19:01:44,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:44,949 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:44,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:44,949 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 19:01:44,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:44,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1366197632, now seen corresponding path program 523 times [2020-01-16 19:01:44,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:44,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60076454] [2020-01-16 19:01:44,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:45,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 19:01:45,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60076454] [2020-01-16 19:01:45,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:45,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:45,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641785611] [2020-01-16 19:01:45,162 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:45,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:45,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:45,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:45,162 INFO L87 Difference]: Start difference. First operand 140 states and 382 transitions. Second operand 8 states. [2020-01-16 19:01:45,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:45,255 INFO L93 Difference]: Finished difference Result 220 states and 497 transitions. [2020-01-16 19:01:45,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:45,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:45,255 INFO L225 Difference]: With dead ends: 220 [2020-01-16 19:01:45,255 INFO L226 Difference]: Without dead ends: 210 [2020-01-16 19:01:45,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 19:01:45,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-01-16 19:01:45,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 142. [2020-01-16 19:01:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-01-16 19:01:45,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 386 transitions. [2020-01-16 19:01:45,258 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 386 transitions. Word has length 19 [2020-01-16 19:01:45,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:45,259 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 386 transitions. [2020-01-16 19:01:45,259 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:45,259 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 386 transitions. [2020-01-16 19:01:45,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:45,259 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:45,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 19:01:45,260 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 19:01:45,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:45,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1605839970, now seen corresponding path program 524 times [2020-01-16 19:01:45,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:45,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826837228] [2020-01-16 19:01:45,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:45,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826837228] [2020-01-16 19:01:45,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:45,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:45,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102330795] [2020-01-16 19:01:45,485 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:45,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:45,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:45,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:45,485 INFO L87 Difference]: Start difference. First operand 142 states and 386 transitions. Second operand 8 states. [2020-01-16 19:01:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:45,544 INFO L93 Difference]: Finished difference Result 220 states and 496 transitions. [2020-01-16 19:01:45,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:45,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:45,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:45,545 INFO L225 Difference]: With dead ends: 220 [2020-01-16 19:01:45,545 INFO L226 Difference]: Without dead ends: 209 [2020-01-16 19:01:45,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 19:01:45,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-01-16 19:01:45,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 141. [2020-01-16 19:01:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-01-16 19:01:45,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 384 transitions. [2020-01-16 19:01:45,549 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 384 transitions. Word has length 19 [2020-01-16 19:01:45,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:45,549 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 384 transitions. [2020-01-16 19:01:45,549 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 384 transitions. [2020-01-16 19:01:45,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:45,550 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:45,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 19:01:45,550 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 19:01:45,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:45,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1855684284, now seen corresponding path program 525 times [2020-01-16 19:01:45,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:45,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631069315] [2020-01-16 19:01:45,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:45,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631069315] [2020-01-16 19:01:45,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:45,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:45,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091929286] [2020-01-16 19:01:45,730 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:45,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:45,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:45,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:45,730 INFO L87 Difference]: Start difference. First operand 141 states and 384 transitions. Second operand 8 states. [2020-01-16 19:01:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:45,813 INFO L93 Difference]: Finished difference Result 222 states and 503 transitions. [2020-01-16 19:01:45,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:45,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:45,815 INFO L225 Difference]: With dead ends: 222 [2020-01-16 19:01:45,815 INFO L226 Difference]: Without dead ends: 212 [2020-01-16 19:01:45,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-01-16 19:01:45,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2020-01-16 19:01:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-01-16 19:01:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 387 transitions. [2020-01-16 19:01:45,819 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 387 transitions. Word has length 19 [2020-01-16 19:01:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:45,819 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 387 transitions. [2020-01-16 19:01:45,819 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 387 transitions. [2020-01-16 19:01:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:45,819 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:45,819 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:45,820 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 19:01:45,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:45,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1484304008, now seen corresponding path program 526 times [2020-01-16 19:01:45,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:45,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225710253] [2020-01-16 19:01:45,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:46,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225710253] [2020-01-16 19:01:46,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:46,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:46,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802268076] [2020-01-16 19:01:46,020 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:46,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:46,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:46,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:46,020 INFO L87 Difference]: Start difference. First operand 143 states and 387 transitions. Second operand 8 states. [2020-01-16 19:01:46,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:46,111 INFO L93 Difference]: Finished difference Result 216 states and 499 transitions. [2020-01-16 19:01:46,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:46,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:46,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:46,111 INFO L225 Difference]: With dead ends: 216 [2020-01-16 19:01:46,112 INFO L226 Difference]: Without dead ends: 201 [2020-01-16 19:01:46,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 19:01:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-01-16 19:01:46,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 141. [2020-01-16 19:01:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-01-16 19:01:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 383 transitions. [2020-01-16 19:01:46,115 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 383 transitions. Word has length 19 [2020-01-16 19:01:46,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:46,115 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 383 transitions. [2020-01-16 19:01:46,115 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:46,115 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 383 transitions. [2020-01-16 19:01:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:46,115 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:46,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 19:01:46,116 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 19:01:46,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:46,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1067984392, now seen corresponding path program 527 times [2020-01-16 19:01:46,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:46,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992836206] [2020-01-16 19:01:46,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:46,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992836206] [2020-01-16 19:01:46,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:46,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:46,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676746879] [2020-01-16 19:01:46,318 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:46,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:46,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:46,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:46,318 INFO L87 Difference]: Start difference. First operand 141 states and 383 transitions. Second operand 8 states. [2020-01-16 19:01:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:46,387 INFO L93 Difference]: Finished difference Result 222 states and 502 transitions. [2020-01-16 19:01:46,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:46,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:46,388 INFO L225 Difference]: With dead ends: 222 [2020-01-16 19:01:46,388 INFO L226 Difference]: Without dead ends: 212 [2020-01-16 19:01:46,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:46,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-01-16 19:01:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2020-01-16 19:01:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-01-16 19:01:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 386 transitions. [2020-01-16 19:01:46,393 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 386 transitions. Word has length 19 [2020-01-16 19:01:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:46,393 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 386 transitions. [2020-01-16 19:01:46,393 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 386 transitions. [2020-01-16 19:01:46,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:46,393 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:46,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 19:01:46,393 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 19:01:46,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:46,394 INFO L82 PathProgramCache]: Analyzing trace with hash 421420604, now seen corresponding path program 528 times [2020-01-16 19:01:46,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:46,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049075035] [2020-01-16 19:01:46,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:46,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 19:01:46,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049075035] [2020-01-16 19:01:46,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:46,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:46,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19352542] [2020-01-16 19:01:46,591 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:46,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:46,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:46,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:46,592 INFO L87 Difference]: Start difference. First operand 143 states and 386 transitions. Second operand 8 states. [2020-01-16 19:01:46,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:46,683 INFO L93 Difference]: Finished difference Result 216 states and 498 transitions. [2020-01-16 19:01:46,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:46,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:46,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:46,684 INFO L225 Difference]: With dead ends: 216 [2020-01-16 19:01:46,684 INFO L226 Difference]: Without dead ends: 198 [2020-01-16 19:01:46,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:46,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-01-16 19:01:46,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 138. [2020-01-16 19:01:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-01-16 19:01:46,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 378 transitions. [2020-01-16 19:01:46,687 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 378 transitions. Word has length 19 [2020-01-16 19:01:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:46,687 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 378 transitions. [2020-01-16 19:01:46,687 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 378 transitions. [2020-01-16 19:01:46,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:46,687 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:46,687 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:46,688 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 19:01:46,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:46,688 INFO L82 PathProgramCache]: Analyzing trace with hash 380240202, now seen corresponding path program 529 times [2020-01-16 19:01:46,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:46,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264594857] [2020-01-16 19:01:46,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:46,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264594857] [2020-01-16 19:01:46,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:46,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:46,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679756735] [2020-01-16 19:01:46,897 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:46,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:46,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:46,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:46,897 INFO L87 Difference]: Start difference. First operand 138 states and 378 transitions. Second operand 8 states. [2020-01-16 19:01:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:46,960 INFO L93 Difference]: Finished difference Result 245 states and 557 transitions. [2020-01-16 19:01:46,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:46,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:46,961 INFO L225 Difference]: With dead ends: 245 [2020-01-16 19:01:46,961 INFO L226 Difference]: Without dead ends: 229 [2020-01-16 19:01:46,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:46,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-01-16 19:01:46,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 141. [2020-01-16 19:01:46,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-01-16 19:01:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 382 transitions. [2020-01-16 19:01:46,964 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 382 transitions. Word has length 19 [2020-01-16 19:01:46,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:46,965 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 382 transitions. [2020-01-16 19:01:46,965 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:46,965 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 382 transitions. [2020-01-16 19:01:46,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:46,965 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:46,965 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:46,965 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 19:01:46,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:46,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1771486344, now seen corresponding path program 530 times [2020-01-16 19:01:46,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:46,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254956718] [2020-01-16 19:01:46,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:47,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254956718] [2020-01-16 19:01:47,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:47,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:47,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355061809] [2020-01-16 19:01:47,168 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:47,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:47,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:47,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:47,168 INFO L87 Difference]: Start difference. First operand 141 states and 382 transitions. Second operand 8 states. [2020-01-16 19:01:47,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:47,254 INFO L93 Difference]: Finished difference Result 239 states and 542 transitions. [2020-01-16 19:01:47,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:47,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:47,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:47,256 INFO L225 Difference]: With dead ends: 239 [2020-01-16 19:01:47,256 INFO L226 Difference]: Without dead ends: 226 [2020-01-16 19:01:47,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 19:01:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-01-16 19:01:47,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 138. [2020-01-16 19:01:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-01-16 19:01:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 375 transitions. [2020-01-16 19:01:47,260 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 375 transitions. Word has length 19 [2020-01-16 19:01:47,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:47,260 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 375 transitions. [2020-01-16 19:01:47,260 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 375 transitions. [2020-01-16 19:01:47,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:47,260 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:47,260 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:47,260 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 19:01:47,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:47,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1474331790, now seen corresponding path program 531 times [2020-01-16 19:01:47,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:47,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856960288] [2020-01-16 19:01:47,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:47,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 19:01:47,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856960288] [2020-01-16 19:01:47,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:47,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:47,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450497220] [2020-01-16 19:01:47,472 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:47,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:47,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:47,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:47,473 INFO L87 Difference]: Start difference. First operand 138 states and 375 transitions. Second operand 8 states. [2020-01-16 19:01:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:47,538 INFO L93 Difference]: Finished difference Result 249 states and 566 transitions. [2020-01-16 19:01:47,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:47,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:47,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:47,539 INFO L225 Difference]: With dead ends: 249 [2020-01-16 19:01:47,539 INFO L226 Difference]: Without dead ends: 233 [2020-01-16 19:01:47,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 19:01:47,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-01-16 19:01:47,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 143. [2020-01-16 19:01:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-01-16 19:01:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 384 transitions. [2020-01-16 19:01:47,544 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 384 transitions. Word has length 19 [2020-01-16 19:01:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:47,544 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 384 transitions. [2020-01-16 19:01:47,544 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 384 transitions. [2020-01-16 19:01:47,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:47,544 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:47,544 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:47,545 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 19:01:47,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:47,545 INFO L82 PathProgramCache]: Analyzing trace with hash 723269696, now seen corresponding path program 532 times [2020-01-16 19:01:47,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:47,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262281879] [2020-01-16 19:01:47,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:47,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 19:01:47,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262281879] [2020-01-16 19:01:47,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:47,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:47,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529044810] [2020-01-16 19:01:47,750 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:47,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:47,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:47,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:47,750 INFO L87 Difference]: Start difference. First operand 143 states and 384 transitions. Second operand 8 states. [2020-01-16 19:01:47,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:47,840 INFO L93 Difference]: Finished difference Result 245 states and 554 transitions. [2020-01-16 19:01:47,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:47,841 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:47,842 INFO L225 Difference]: With dead ends: 245 [2020-01-16 19:01:47,842 INFO L226 Difference]: Without dead ends: 228 [2020-01-16 19:01:47,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 19:01:47,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-01-16 19:01:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 138. [2020-01-16 19:01:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-01-16 19:01:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 372 transitions. [2020-01-16 19:01:47,846 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 372 transitions. Word has length 19 [2020-01-16 19:01:47,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:47,846 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 372 transitions. [2020-01-16 19:01:47,846 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:47,846 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 372 transitions. [2020-01-16 19:01:47,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:47,847 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:47,847 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:47,847 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 19:01:47,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:47,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1883916852, now seen corresponding path program 533 times [2020-01-16 19:01:47,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:47,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347506441] [2020-01-16 19:01:47,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:48,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 19:01:48,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347506441] [2020-01-16 19:01:48,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:48,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:48,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946335953] [2020-01-16 19:01:48,049 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:48,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:48,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:48,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:48,049 INFO L87 Difference]: Start difference. First operand 138 states and 372 transitions. Second operand 8 states. [2020-01-16 19:01:48,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:48,134 INFO L93 Difference]: Finished difference Result 234 states and 530 transitions. [2020-01-16 19:01:48,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:48,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:48,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:48,135 INFO L225 Difference]: With dead ends: 234 [2020-01-16 19:01:48,136 INFO L226 Difference]: Without dead ends: 224 [2020-01-16 19:01:48,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:48,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-01-16 19:01:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 140. [2020-01-16 19:01:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-01-16 19:01:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 375 transitions. [2020-01-16 19:01:48,139 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 375 transitions. Word has length 19 [2020-01-16 19:01:48,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:48,140 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 375 transitions. [2020-01-16 19:01:48,140 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:48,140 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 375 transitions. [2020-01-16 19:01:48,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:48,140 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:48,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:48,140 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 19:01:48,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:48,140 INFO L82 PathProgramCache]: Analyzing trace with hash -700437136, now seen corresponding path program 534 times [2020-01-16 19:01:48,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:48,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844303841] [2020-01-16 19:01:48,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:48,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:48,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844303841] [2020-01-16 19:01:48,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:48,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:48,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956409135] [2020-01-16 19:01:48,363 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:48,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:48,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:48,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:48,363 INFO L87 Difference]: Start difference. First operand 140 states and 375 transitions. Second operand 8 states. [2020-01-16 19:01:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:48,454 INFO L93 Difference]: Finished difference Result 236 states and 533 transitions. [2020-01-16 19:01:48,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:48,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:48,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:48,455 INFO L225 Difference]: With dead ends: 236 [2020-01-16 19:01:48,455 INFO L226 Difference]: Without dead ends: 219 [2020-01-16 19:01:48,455 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-01-16 19:01:48,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 135. [2020-01-16 19:01:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-01-16 19:01:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 365 transitions. [2020-01-16 19:01:48,458 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 365 transitions. Word has length 19 [2020-01-16 19:01:48,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:48,459 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 365 transitions. [2020-01-16 19:01:48,459 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 365 transitions. [2020-01-16 19:01:48,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:48,459 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:48,459 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:48,459 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 19:01:48,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:48,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1988693016, now seen corresponding path program 535 times [2020-01-16 19:01:48,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:48,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931568624] [2020-01-16 19:01:48,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:48,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931568624] [2020-01-16 19:01:48,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:48,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:48,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604810477] [2020-01-16 19:01:48,649 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:48,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:48,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:48,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:48,650 INFO L87 Difference]: Start difference. First operand 135 states and 365 transitions. Second operand 8 states. [2020-01-16 19:01:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:48,718 INFO L93 Difference]: Finished difference Result 241 states and 542 transitions. [2020-01-16 19:01:48,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:48,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:48,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:48,719 INFO L225 Difference]: With dead ends: 241 [2020-01-16 19:01:48,719 INFO L226 Difference]: Without dead ends: 225 [2020-01-16 19:01:48,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 19:01:48,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-01-16 19:01:48,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 135. [2020-01-16 19:01:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-01-16 19:01:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 362 transitions. [2020-01-16 19:01:48,723 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 362 transitions. Word has length 19 [2020-01-16 19:01:48,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:48,723 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 362 transitions. [2020-01-16 19:01:48,723 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:48,723 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 362 transitions. [2020-01-16 19:01:48,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:48,724 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:48,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 19:01:48,724 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 19:01:48,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:48,724 INFO L82 PathProgramCache]: Analyzing trace with hash 154547734, now seen corresponding path program 536 times [2020-01-16 19:01:48,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:48,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197235764] [2020-01-16 19:01:48,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:48,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 19:01:48,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197235764] [2020-01-16 19:01:48,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:48,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:48,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054202710] [2020-01-16 19:01:48,909 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:48,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:48,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:48,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:48,909 INFO L87 Difference]: Start difference. First operand 135 states and 362 transitions. Second operand 8 states. [2020-01-16 19:01:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:48,990 INFO L93 Difference]: Finished difference Result 235 states and 527 transitions. [2020-01-16 19:01:48,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:48,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:48,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:48,991 INFO L225 Difference]: With dead ends: 235 [2020-01-16 19:01:48,991 INFO L226 Difference]: Without dead ends: 222 [2020-01-16 19:01:48,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:48,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-01-16 19:01:48,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 132. [2020-01-16 19:01:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-01-16 19:01:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 355 transitions. [2020-01-16 19:01:48,995 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 355 transitions. Word has length 19 [2020-01-16 19:01:48,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:48,995 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 355 transitions. [2020-01-16 19:01:48,995 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 355 transitions. [2020-01-16 19:01:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:48,996 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:48,996 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:48,996 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 19:01:48,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:48,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1799928014, now seen corresponding path program 537 times [2020-01-16 19:01:48,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:48,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894964741] [2020-01-16 19:01:48,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:49,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894964741] [2020-01-16 19:01:49,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:49,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:49,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701317428] [2020-01-16 19:01:49,190 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:49,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:49,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:49,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:49,190 INFO L87 Difference]: Start difference. First operand 132 states and 355 transitions. Second operand 8 states. [2020-01-16 19:01:49,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:49,258 INFO L93 Difference]: Finished difference Result 239 states and 541 transitions. [2020-01-16 19:01:49,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:49,258 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:49,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:49,259 INFO L225 Difference]: With dead ends: 239 [2020-01-16 19:01:49,259 INFO L226 Difference]: Without dead ends: 223 [2020-01-16 19:01:49,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 19:01:49,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-01-16 19:01:49,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 138. [2020-01-16 19:01:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-01-16 19:01:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 366 transitions. [2020-01-16 19:01:49,262 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 366 transitions. Word has length 19 [2020-01-16 19:01:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:49,262 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 366 transitions. [2020-01-16 19:01:49,262 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:49,262 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 366 transitions. [2020-01-16 19:01:49,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:49,263 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:49,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 19:01:49,263 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 19:01:49,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:49,263 INFO L82 PathProgramCache]: Analyzing trace with hash 823723264, now seen corresponding path program 538 times [2020-01-16 19:01:49,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:49,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511634063] [2020-01-16 19:01:49,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:49,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:49,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511634063] [2020-01-16 19:01:49,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:49,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:49,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870461434] [2020-01-16 19:01:49,449 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:49,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:49,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:49,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:49,449 INFO L87 Difference]: Start difference. First operand 138 states and 366 transitions. Second operand 8 states. [2020-01-16 19:01:49,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:49,537 INFO L93 Difference]: Finished difference Result 227 states and 521 transitions. [2020-01-16 19:01:49,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:49,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:49,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:49,538 INFO L225 Difference]: With dead ends: 227 [2020-01-16 19:01:49,538 INFO L226 Difference]: Without dead ends: 208 [2020-01-16 19:01:49,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:49,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-01-16 19:01:49,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 132. [2020-01-16 19:01:49,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-01-16 19:01:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 352 transitions. [2020-01-16 19:01:49,542 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 352 transitions. Word has length 19 [2020-01-16 19:01:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:49,542 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 352 transitions. [2020-01-16 19:01:49,542 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 352 transitions. [2020-01-16 19:01:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:49,542 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:49,542 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:49,543 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 19:01:49,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:49,543 INFO L82 PathProgramCache]: Analyzing trace with hash 270189236, now seen corresponding path program 539 times [2020-01-16 19:01:49,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:49,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410649622] [2020-01-16 19:01:49,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:49,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 19:01:49,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410649622] [2020-01-16 19:01:49,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:49,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:49,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657628559] [2020-01-16 19:01:49,728 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:49,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:49,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:49,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:49,728 INFO L87 Difference]: Start difference. First operand 132 states and 352 transitions. Second operand 8 states. [2020-01-16 19:01:49,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:49,806 INFO L93 Difference]: Finished difference Result 229 states and 514 transitions. [2020-01-16 19:01:49,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:49,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:49,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:49,807 INFO L225 Difference]: With dead ends: 229 [2020-01-16 19:01:49,807 INFO L226 Difference]: Without dead ends: 219 [2020-01-16 19:01:49,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 19:01:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-01-16 19:01:49,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 134. [2020-01-16 19:01:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-01-16 19:01:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2020-01-16 19:01:49,811 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 19 [2020-01-16 19:01:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:49,811 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2020-01-16 19:01:49,812 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2020-01-16 19:01:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:49,812 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:49,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 19:01:49,812 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 19:01:49,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:49,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1458858098, now seen corresponding path program 540 times [2020-01-16 19:01:49,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:49,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693013502] [2020-01-16 19:01:49,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:49,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693013502] [2020-01-16 19:01:49,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:49,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:49,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257221507] [2020-01-16 19:01:49,989 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:49,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:49,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:49,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:49,990 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 8 states. [2020-01-16 19:01:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:50,078 INFO L93 Difference]: Finished difference Result 223 states and 510 transitions. [2020-01-16 19:01:50,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:50,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:50,079 INFO L225 Difference]: With dead ends: 223 [2020-01-16 19:01:50,079 INFO L226 Difference]: Without dead ends: 205 [2020-01-16 19:01:50,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-01-16 19:01:50,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 129. [2020-01-16 19:01:50,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-01-16 19:01:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 345 transitions. [2020-01-16 19:01:50,082 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 345 transitions. Word has length 19 [2020-01-16 19:01:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:50,082 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 345 transitions. [2020-01-16 19:01:50,082 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 345 transitions. [2020-01-16 19:01:50,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:50,083 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:50,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 19:01:50,083 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 19:01:50,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:50,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1337500568, now seen corresponding path program 541 times [2020-01-16 19:01:50,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:50,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329769049] [2020-01-16 19:01:50,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:50,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:50,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329769049] [2020-01-16 19:01:50,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:50,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:50,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110197939] [2020-01-16 19:01:50,293 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:50,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:50,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:50,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:50,293 INFO L87 Difference]: Start difference. First operand 129 states and 345 transitions. Second operand 8 states. [2020-01-16 19:01:50,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:50,357 INFO L93 Difference]: Finished difference Result 243 states and 557 transitions. [2020-01-16 19:01:50,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:50,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:50,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:50,358 INFO L225 Difference]: With dead ends: 243 [2020-01-16 19:01:50,358 INFO L226 Difference]: Without dead ends: 227 [2020-01-16 19:01:50,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:50,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-01-16 19:01:50,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 139. [2020-01-16 19:01:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-01-16 19:01:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 373 transitions. [2020-01-16 19:01:50,363 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 373 transitions. Word has length 19 [2020-01-16 19:01:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:50,363 INFO L478 AbstractCegarLoop]: Abstraction has 139 states and 373 transitions. [2020-01-16 19:01:50,363 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 373 transitions. [2020-01-16 19:01:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:50,363 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:50,363 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:50,364 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 19:01:50,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:50,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2088562662, now seen corresponding path program 542 times [2020-01-16 19:01:50,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:50,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323830575] [2020-01-16 19:01:50,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:50,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323830575] [2020-01-16 19:01:50,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:50,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:50,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773670426] [2020-01-16 19:01:50,565 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:50,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:50,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:50,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:50,565 INFO L87 Difference]: Start difference. First operand 139 states and 373 transitions. Second operand 8 states. [2020-01-16 19:01:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:50,653 INFO L93 Difference]: Finished difference Result 239 states and 545 transitions. [2020-01-16 19:01:50,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:50,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:50,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:50,654 INFO L225 Difference]: With dead ends: 239 [2020-01-16 19:01:50,654 INFO L226 Difference]: Without dead ends: 222 [2020-01-16 19:01: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 19:01:50,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-01-16 19:01:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 134. [2020-01-16 19:01:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-01-16 19:01:50,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 359 transitions. [2020-01-16 19:01:50,658 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 359 transitions. Word has length 19 [2020-01-16 19:01:50,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:50,659 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 359 transitions. [2020-01-16 19:01:50,659 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 359 transitions. [2020-01-16 19:01:50,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:50,659 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:50,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 19:01:50,659 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 19:01:50,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:50,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1357028874, now seen corresponding path program 543 times [2020-01-16 19:01:50,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:50,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206944300] [2020-01-16 19:01:50,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:50,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206944300] [2020-01-16 19:01:50,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:50,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:50,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232958455] [2020-01-16 19:01:50,863 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:50,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:50,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:50,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:50,864 INFO L87 Difference]: Start difference. First operand 134 states and 359 transitions. Second operand 8 states. [2020-01-16 19:01:50,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:50,930 INFO L93 Difference]: Finished difference Result 231 states and 525 transitions. [2020-01-16 19:01:50,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:50,931 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:50,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:50,931 INFO L225 Difference]: With dead ends: 231 [2020-01-16 19:01:50,931 INFO L226 Difference]: Without dead ends: 215 [2020-01-16 19:01:50,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:50,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-01-16 19:01:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 140. [2020-01-16 19:01:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-01-16 19:01:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 370 transitions. [2020-01-16 19:01:50,934 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 370 transitions. Word has length 19 [2020-01-16 19:01:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:50,935 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 370 transitions. [2020-01-16 19:01:50,935 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:50,935 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 370 transitions. [2020-01-16 19:01:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:50,935 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:50,935 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:50,935 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 19:01:50,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:50,935 INFO L82 PathProgramCache]: Analyzing trace with hash 380824124, now seen corresponding path program 544 times [2020-01-16 19:01:50,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:50,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276284464] [2020-01-16 19:01:50,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01: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 19:01:51,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276284464] [2020-01-16 19:01:51,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:51,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:51,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753652719] [2020-01-16 19:01:51,137 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:51,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:51,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:51,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:51,137 INFO L87 Difference]: Start difference. First operand 140 states and 370 transitions. Second operand 8 states. [2020-01-16 19:01:51,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:51,227 INFO L93 Difference]: Finished difference Result 219 states and 505 transitions. [2020-01-16 19:01:51,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:51,228 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:51,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:51,228 INFO L225 Difference]: With dead ends: 219 [2020-01-16 19:01:51,229 INFO L226 Difference]: Without dead ends: 200 [2020-01-16 19:01:51,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:51,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-01-16 19:01:51,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 134. [2020-01-16 19:01:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-01-16 19:01:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 354 transitions. [2020-01-16 19:01:51,233 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 354 transitions. Word has length 19 [2020-01-16 19:01:51,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:51,233 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 354 transitions. [2020-01-16 19:01:51,233 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:51,233 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 354 transitions. [2020-01-16 19:01:51,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:51,233 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:51,233 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:51,233 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 19:01:51,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:51,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2008828456, now seen corresponding path program 545 times [2020-01-16 19:01:51,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:51,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559658484] [2020-01-16 19:01:51,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:51,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559658484] [2020-01-16 19:01:51,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:51,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:51,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048510485] [2020-01-16 19:01:51,441 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:51,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:51,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:51,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:51,441 INFO L87 Difference]: Start difference. First operand 134 states and 354 transitions. Second operand 8 states. [2020-01-16 19:01:51,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:51,530 INFO L93 Difference]: Finished difference Result 216 states and 499 transitions. [2020-01-16 19:01:51,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:51,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:51,531 INFO L225 Difference]: With dead ends: 216 [2020-01-16 19:01:51,531 INFO L226 Difference]: Without dead ends: 204 [2020-01-16 19:01:51,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 19:01:51,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-01-16 19:01:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 138. [2020-01-16 19:01:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-01-16 19:01:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 362 transitions. [2020-01-16 19:01:51,535 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 362 transitions. Word has length 19 [2020-01-16 19:01:51,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:51,535 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 362 transitions. [2020-01-16 19:01:51,535 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:51,535 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 362 transitions. [2020-01-16 19:01:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:51,536 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:51,536 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:51,536 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 19:01:51,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:51,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1427264310, now seen corresponding path program 546 times [2020-01-16 19:01:51,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:51,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142112850] [2020-01-16 19:01:51,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:51,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 19:01:51,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142112850] [2020-01-16 19:01:51,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:51,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:51,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312632986] [2020-01-16 19:01:51,736 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:51,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:51,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:51,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:51,737 INFO L87 Difference]: Start difference. First operand 138 states and 362 transitions. Second operand 8 states. [2020-01-16 19:01:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:51,829 INFO L93 Difference]: Finished difference Result 203 states and 478 transitions. [2020-01-16 19:01:51,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:51,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:51,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:51,830 INFO L225 Difference]: With dead ends: 203 [2020-01-16 19:01:51,830 INFO L226 Difference]: Without dead ends: 181 [2020-01-16 19:01:51,830 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:51,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-01-16 19:01:51,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 129. [2020-01-16 19:01:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-01-16 19:01:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 342 transitions. [2020-01-16 19:01:51,833 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 342 transitions. Word has length 19 [2020-01-16 19:01:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:51,833 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 342 transitions. [2020-01-16 19:01:51,833 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 342 transitions. [2020-01-16 19:01:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:51,834 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:51,834 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:51,834 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 19:01:51,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:51,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1173836118, now seen corresponding path program 547 times [2020-01-16 19:01:51,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:51,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308689310] [2020-01-16 19:01:51,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:52,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 19:01:52,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308689310] [2020-01-16 19:01:52,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:52,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:52,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205304174] [2020-01-16 19:01:52,034 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:52,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:52,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:52,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:52,034 INFO L87 Difference]: Start difference. First operand 129 states and 342 transitions. Second operand 8 states. [2020-01-16 19:01:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:52,126 INFO L93 Difference]: Finished difference Result 221 states and 497 transitions. [2020-01-16 19:01:52,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:52,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:52,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:52,127 INFO L225 Difference]: With dead ends: 221 [2020-01-16 19:01:52,127 INFO L226 Difference]: Without dead ends: 211 [2020-01-16 19:01:52,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 19:01:52,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-01-16 19:01:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 133. [2020-01-16 19:01:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-01-16 19:01:52,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 352 transitions. [2020-01-16 19:01:52,131 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 352 transitions. Word has length 19 [2020-01-16 19:01:52,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:52,131 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 352 transitions. [2020-01-16 19:01:52,131 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 352 transitions. [2020-01-16 19:01:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:52,132 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:52,132 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:52,132 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 19:01:52,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:52,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1410517870, now seen corresponding path program 548 times [2020-01-16 19:01:52,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:52,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233218365] [2020-01-16 19:01:52,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:52,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 19:01:52,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233218365] [2020-01-16 19:01:52,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:52,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:52,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528532436] [2020-01-16 19:01:52,348 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:52,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:52,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:52,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:52,349 INFO L87 Difference]: Start difference. First operand 133 states and 352 transitions. Second operand 8 states. [2020-01-16 19:01:52,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:52,441 INFO L93 Difference]: Finished difference Result 223 states and 500 transitions. [2020-01-16 19:01:52,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:52,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:52,442 INFO L225 Difference]: With dead ends: 223 [2020-01-16 19:01:52,443 INFO L226 Difference]: Without dead ends: 209 [2020-01-16 19:01:52,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-01-16 19:01:52,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 131. [2020-01-16 19:01:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-01-16 19:01:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 347 transitions. [2020-01-16 19:01:52,446 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 347 transitions. Word has length 19 [2020-01-16 19:01:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:52,446 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 347 transitions. [2020-01-16 19:01:52,446 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:52,446 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 347 transitions. [2020-01-16 19:01:52,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:52,446 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:52,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 19:01:52,447 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 19:01:52,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:52,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1918538616, now seen corresponding path program 549 times [2020-01-16 19:01:52,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:52,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381241152] [2020-01-16 19:01:52,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:52,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381241152] [2020-01-16 19:01:52,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:52,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:52,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519659958] [2020-01-16 19:01:52,642 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:52,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:52,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:52,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:52,643 INFO L87 Difference]: Start difference. First operand 131 states and 347 transitions. Second operand 8 states. [2020-01-16 19:01:52,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:52,733 INFO L93 Difference]: Finished difference Result 218 states and 489 transitions. [2020-01-16 19:01:52,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:52,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:52,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:52,734 INFO L225 Difference]: With dead ends: 218 [2020-01-16 19:01:52,734 INFO L226 Difference]: Without dead ends: 208 [2020-01-16 19:01:52,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-01-16 19:01:52,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 133. [2020-01-16 19:01:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-01-16 19:01:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 350 transitions. [2020-01-16 19:01:52,738 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 350 transitions. Word has length 19 [2020-01-16 19:01:52,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:52,739 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 350 transitions. [2020-01-16 19:01:52,739 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:52,739 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 350 transitions. [2020-01-16 19:01:52,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:52,739 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:52,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 19:01:52,739 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 19:01:52,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:52,739 INFO L82 PathProgramCache]: Analyzing trace with hash 189491282, now seen corresponding path program 550 times [2020-01-16 19:01:52,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:52,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444820920] [2020-01-16 19:01:52,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:52,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 19:01:52,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444820920] [2020-01-16 19:01:52,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:52,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:52,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911416745] [2020-01-16 19:01:52,941 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:52,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:52,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:52,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:52,942 INFO L87 Difference]: Start difference. First operand 133 states and 350 transitions. Second operand 8 states. [2020-01-16 19:01:53,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:53,032 INFO L93 Difference]: Finished difference Result 212 states and 485 transitions. [2020-01-16 19:01:53,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:53,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:53,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:53,034 INFO L225 Difference]: With dead ends: 212 [2020-01-16 19:01:53,034 INFO L226 Difference]: Without dead ends: 197 [2020-01-16 19:01:53,034 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-01-16 19:01:53,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 131. [2020-01-16 19:01:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-01-16 19:01:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 345 transitions. [2020-01-16 19:01:53,037 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 345 transitions. Word has length 19 [2020-01-16 19:01:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:53,038 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 345 transitions. [2020-01-16 19:01:53,038 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 345 transitions. [2020-01-16 19:01:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:53,038 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:53,038 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:53,038 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 19:01:53,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:53,038 INFO L82 PathProgramCache]: Analyzing trace with hash 823589624, now seen corresponding path program 551 times [2020-01-16 19:01:53,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:53,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93339117] [2020-01-16 19:01:53,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:53,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93339117] [2020-01-16 19:01:53,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:53,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:53,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662885314] [2020-01-16 19:01:53,243 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:53,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:53,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:53,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:53,244 INFO L87 Difference]: Start difference. First operand 131 states and 345 transitions. Second operand 8 states. [2020-01-16 19:01:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:53,331 INFO L93 Difference]: Finished difference Result 213 states and 490 transitions. [2020-01-16 19:01:53,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:53,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:53,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:53,332 INFO L225 Difference]: With dead ends: 213 [2020-01-16 19:01:53,332 INFO L226 Difference]: Without dead ends: 201 [2020-01-16 19:01:53,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 19:01:53,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-01-16 19:01:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 135. [2020-01-16 19:01:53,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-01-16 19:01:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 353 transitions. [2020-01-16 19:01:53,336 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 353 transitions. Word has length 19 [2020-01-16 19:01:53,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:53,337 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 353 transitions. [2020-01-16 19:01:53,337 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 353 transitions. [2020-01-16 19:01:53,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:53,337 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:53,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:53,337 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 19:01:53,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:53,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1678896278, now seen corresponding path program 552 times [2020-01-16 19:01:53,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:53,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134208242] [2020-01-16 19:01:53,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:53,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 19:01:53,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134208242] [2020-01-16 19:01:53,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:53,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:53,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506541700] [2020-01-16 19:01:53,542 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:53,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:53,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:53,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:53,543 INFO L87 Difference]: Start difference. First operand 135 states and 353 transitions. Second operand 8 states. [2020-01-16 19:01:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:53,631 INFO L93 Difference]: Finished difference Result 200 states and 469 transitions. [2020-01-16 19:01:53,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:53,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:53,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:53,632 INFO L225 Difference]: With dead ends: 200 [2020-01-16 19:01:53,632 INFO L226 Difference]: Without dead ends: 178 [2020-01-16 19:01:53,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 19:01:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-01-16 19:01:53,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 126. [2020-01-16 19:01:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-01-16 19:01:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 336 transitions. [2020-01-16 19:01:53,636 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 336 transitions. Word has length 19 [2020-01-16 19:01:53,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:53,636 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 336 transitions. [2020-01-16 19:01:53,636 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 336 transitions. [2020-01-16 19:01:53,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:53,637 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:53,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 19:01:53,637 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 19:01:53,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:53,637 INFO L82 PathProgramCache]: Analyzing trace with hash 283350700, now seen corresponding path program 553 times [2020-01-16 19:01:53,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:53,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991684401] [2020-01-16 19:01:53,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:53,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991684401] [2020-01-16 19:01:53,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:53,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:53,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59069317] [2020-01-16 19:01:53,849 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:53,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:53,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:53,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:53,849 INFO L87 Difference]: Start difference. First operand 126 states and 336 transitions. Second operand 8 states. [2020-01-16 19:01:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:53,915 INFO L93 Difference]: Finished difference Result 220 states and 486 transitions. [2020-01-16 19:01:53,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:53,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:53,916 INFO L225 Difference]: With dead ends: 220 [2020-01-16 19:01:53,917 INFO L226 Difference]: Without dead ends: 204 [2020-01-16 19:01:53,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 19:01:53,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-01-16 19:01:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 129. [2020-01-16 19:01:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-01-16 19:01:53,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 340 transitions. [2020-01-16 19:01:53,920 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 340 transitions. Word has length 19 [2020-01-16 19:01:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:53,920 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 340 transitions. [2020-01-16 19:01:53,921 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:53,921 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 340 transitions. [2020-01-16 19:01:53,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:53,921 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:53,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 19:01:53,921 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 19:01:53,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:53,921 INFO L82 PathProgramCache]: Analyzing trace with hash 542408926, now seen corresponding path program 554 times [2020-01-16 19:01:53,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:53,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947256866] [2020-01-16 19:01:53,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:54,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947256866] [2020-01-16 19:01:54,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:54,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:54,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84810242] [2020-01-16 19:01:54,128 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:54,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:54,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:54,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:54,129 INFO L87 Difference]: Start difference. First operand 129 states and 340 transitions. Second operand 8 states. [2020-01-16 19:01:54,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:54,194 INFO L93 Difference]: Finished difference Result 214 states and 471 transitions. [2020-01-16 19:01:54,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:54,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:54,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:54,195 INFO L225 Difference]: With dead ends: 214 [2020-01-16 19:01:54,195 INFO L226 Difference]: Without dead ends: 201 [2020-01-16 19:01:54,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 19:01:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-01-16 19:01:54,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 126. [2020-01-16 19:01:54,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-01-16 19:01:54,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 333 transitions. [2020-01-16 19:01:54,199 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 333 transitions. Word has length 19 [2020-01-16 19:01:54,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:54,199 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 333 transitions. [2020-01-16 19:01:54,199 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:54,199 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 333 transitions. [2020-01-16 19:01:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:54,200 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:54,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 19:01:54,200 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 19:01:54,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:54,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1317087154, now seen corresponding path program 555 times [2020-01-16 19:01:54,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:54,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185777296] [2020-01-16 19:01:54,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:54,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185777296] [2020-01-16 19:01:54,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:54,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:54,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050738904] [2020-01-16 19:01:54,410 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:54,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:54,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:54,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:54,411 INFO L87 Difference]: Start difference. First operand 126 states and 333 transitions. Second operand 8 states. [2020-01-16 19:01:54,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:54,476 INFO L93 Difference]: Finished difference Result 224 states and 495 transitions. [2020-01-16 19:01:54,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:54,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:54,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:54,477 INFO L225 Difference]: With dead ends: 224 [2020-01-16 19:01:54,477 INFO L226 Difference]: Without dead ends: 208 [2020-01-16 19:01:54,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 19:01:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-01-16 19:01:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 131. [2020-01-16 19:01:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-01-16 19:01:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 342 transitions. [2020-01-16 19:01:54,480 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 342 transitions. Word has length 19 [2020-01-16 19:01:54,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:54,480 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 342 transitions. [2020-01-16 19:01:54,480 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:54,480 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 342 transitions. [2020-01-16 19:01:54,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:54,481 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:54,481 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:54,481 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 19:01:54,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:54,481 INFO L82 PathProgramCache]: Analyzing trace with hash -2068149248, now seen corresponding path program 556 times [2020-01-16 19:01:54,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:54,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755794960] [2020-01-16 19:01:54,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:54,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755794960] [2020-01-16 19:01:54,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:54,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:54,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520317256] [2020-01-16 19:01:54,686 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:54,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:54,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:54,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:54,686 INFO L87 Difference]: Start difference. First operand 131 states and 342 transitions. Second operand 8 states. [2020-01-16 19:01:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:54,776 INFO L93 Difference]: Finished difference Result 220 states and 483 transitions. [2020-01-16 19:01:54,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:54,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:54,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:54,777 INFO L225 Difference]: With dead ends: 220 [2020-01-16 19:01:54,777 INFO L226 Difference]: Without dead ends: 203 [2020-01-16 19:01:54,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 19:01:54,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-01-16 19:01:54,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2020-01-16 19:01:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-01-16 19:01:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 330 transitions. [2020-01-16 19:01:54,781 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 330 transitions. Word has length 19 [2020-01-16 19:01:54,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:54,781 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 330 transitions. [2020-01-16 19:01:54,781 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 330 transitions. [2020-01-16 19:01:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:54,782 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:54,782 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:54,782 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 19:01:54,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:54,782 INFO L82 PathProgramCache]: Analyzing trace with hash -916665526, now seen corresponding path program 557 times [2020-01-16 19:01:54,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:54,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094234477] [2020-01-16 19:01:54,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:54,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 19:01:54,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094234477] [2020-01-16 19:01:54,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:54,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:54,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166306721] [2020-01-16 19:01:54,989 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:54,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:54,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:54,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:54,989 INFO L87 Difference]: Start difference. First operand 126 states and 330 transitions. Second operand 8 states. [2020-01-16 19:01:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:55,055 INFO L93 Difference]: Finished difference Result 209 states and 459 transitions. [2020-01-16 19:01:55,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:55,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:55,056 INFO L225 Difference]: With dead ends: 209 [2020-01-16 19:01:55,056 INFO L226 Difference]: Without dead ends: 199 [2020-01-16 19:01:55,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-01-16 19:01:55,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 128. [2020-01-16 19:01:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-01-16 19:01:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 333 transitions. [2020-01-16 19:01:55,060 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 333 transitions. Word has length 19 [2020-01-16 19:01:55,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:55,060 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 333 transitions. [2020-01-16 19:01:55,060 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 333 transitions. [2020-01-16 19:01:55,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:55,061 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:55,061 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:55,061 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 19:01:55,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:55,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1771972180, now seen corresponding path program 558 times [2020-01-16 19:01:55,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:55,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292983313] [2020-01-16 19:01:55,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:55,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292983313] [2020-01-16 19:01:55,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:55,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:55,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692736186] [2020-01-16 19:01:55,265 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:55,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:55,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:55,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:55,265 INFO L87 Difference]: Start difference. First operand 128 states and 333 transitions. Second operand 8 states. [2020-01-16 19:01:55,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:55,354 INFO L93 Difference]: Finished difference Result 211 states and 462 transitions. [2020-01-16 19:01:55,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:55,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:55,355 INFO L225 Difference]: With dead ends: 211 [2020-01-16 19:01:55,355 INFO L226 Difference]: Without dead ends: 194 [2020-01-16 19:01:55,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:55,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-01-16 19:01:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 123. [2020-01-16 19:01:55,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-01-16 19:01:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 323 transitions. [2020-01-16 19:01:55,359 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 323 transitions. Word has length 19 [2020-01-16 19:01:55,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:55,359 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 323 transitions. [2020-01-16 19:01:55,359 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:55,359 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 323 transitions. [2020-01-16 19:01:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:55,359 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:55,360 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:55,360 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 19:01:55,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:55,360 INFO L82 PathProgramCache]: Analyzing trace with hash -2085582518, now seen corresponding path program 559 times [2020-01-16 19:01:55,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:55,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304648423] [2020-01-16 19:01:55,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:55,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 19:01:55,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304648423] [2020-01-16 19:01:55,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:55,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:55,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869113909] [2020-01-16 19:01:55,555 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:55,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:55,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:55,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:55,556 INFO L87 Difference]: Start difference. First operand 123 states and 323 transitions. Second operand 8 states. [2020-01-16 19:01:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:55,620 INFO L93 Difference]: Finished difference Result 215 states and 468 transitions. [2020-01-16 19:01:55,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:55,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:55,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:55,621 INFO L225 Difference]: With dead ends: 215 [2020-01-16 19:01:55,621 INFO L226 Difference]: Without dead ends: 199 [2020-01-16 19:01:55,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:55,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-01-16 19:01:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 123. [2020-01-16 19:01:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-01-16 19:01:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 320 transitions. [2020-01-16 19:01:55,624 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 320 transitions. Word has length 19 [2020-01-16 19:01:55,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:55,624 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 320 transitions. [2020-01-16 19:01:55,624 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 320 transitions. [2020-01-16 19:01:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:55,625 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:55,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 19:01:55,625 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 19:01:55,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:55,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1826524292, now seen corresponding path program 560 times [2020-01-16 19:01:55,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:55,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063579245] [2020-01-16 19:01:55,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:55,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063579245] [2020-01-16 19:01:55,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:55,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:55,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255070947] [2020-01-16 19:01:55,823 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:55,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:55,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:55,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:55,823 INFO L87 Difference]: Start difference. First operand 123 states and 320 transitions. Second operand 8 states. [2020-01-16 19:01:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:55,891 INFO L93 Difference]: Finished difference Result 209 states and 453 transitions. [2020-01-16 19:01:55,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:55,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:55,892 INFO L225 Difference]: With dead ends: 209 [2020-01-16 19:01:55,892 INFO L226 Difference]: Without dead ends: 196 [2020-01-16 19:01:55,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 19:01:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-01-16 19:01:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 120. [2020-01-16 19:01:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-01-16 19:01:55,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 313 transitions. [2020-01-16 19:01:55,895 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 313 transitions. Word has length 19 [2020-01-16 19:01:55,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:55,895 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 313 transitions. [2020-01-16 19:01:55,895 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:55,896 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 313 transitions. [2020-01-16 19:01:55,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:55,896 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:55,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 19:01:55,896 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 19:01:55,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:55,896 INFO L82 PathProgramCache]: Analyzing trace with hash -991490930, now seen corresponding path program 561 times [2020-01-16 19:01:55,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:55,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942837] [2020-01-16 19:01:55,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:56,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942837] [2020-01-16 19:01:56,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:56,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:56,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106300548] [2020-01-16 19:01:56,104 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:56,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:56,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:56,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:56,104 INFO L87 Difference]: Start difference. First operand 120 states and 313 transitions. Second operand 8 states. [2020-01-16 19:01:56,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:56,170 INFO L93 Difference]: Finished difference Result 213 states and 467 transitions. [2020-01-16 19:01:56,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:56,171 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:56,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:56,171 INFO L225 Difference]: With dead ends: 213 [2020-01-16 19:01:56,171 INFO L226 Difference]: Without dead ends: 197 [2020-01-16 19:01:56,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 19:01:56,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-01-16 19:01:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 126. [2020-01-16 19:01:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-01-16 19:01:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 324 transitions. [2020-01-16 19:01:56,175 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 324 transitions. Word has length 19 [2020-01-16 19:01:56,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:56,175 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 324 transitions. [2020-01-16 19:01:56,175 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 324 transitions. [2020-01-16 19:01:56,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:56,175 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:56,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 19:01:56,175 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 19:01:56,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:56,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1967695680, now seen corresponding path program 562 times [2020-01-16 19:01:56,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:56,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059681034] [2020-01-16 19:01:56,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:56,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 19:01:56,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059681034] [2020-01-16 19:01:56,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:56,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:56,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671719811] [2020-01-16 19:01:56,375 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:56,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:56,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:56,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:56,376 INFO L87 Difference]: Start difference. First operand 126 states and 324 transitions. Second operand 8 states. [2020-01-16 19:01:56,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:56,465 INFO L93 Difference]: Finished difference Result 201 states and 447 transitions. [2020-01-16 19:01:56,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:56,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:56,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:56,466 INFO L225 Difference]: With dead ends: 201 [2020-01-16 19:01:56,466 INFO L226 Difference]: Without dead ends: 182 [2020-01-16 19:01:56,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:56,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-01-16 19:01:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 120. [2020-01-16 19:01:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-01-16 19:01:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 310 transitions. [2020-01-16 19:01:56,470 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 310 transitions. Word has length 19 [2020-01-16 19:01:56,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:56,470 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 310 transitions. [2020-01-16 19:01:56,470 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:56,471 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 310 transitions. [2020-01-16 19:01:56,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:56,471 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:56,471 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:56,471 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 19:01:56,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:56,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1019871656, now seen corresponding path program 563 times [2020-01-16 19:01:56,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:56,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016866621] [2020-01-16 19:01:56,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:56,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016866621] [2020-01-16 19:01:56,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:56,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:56,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414114495] [2020-01-16 19:01:56,675 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:56,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:56,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:56,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:56,675 INFO L87 Difference]: Start difference. First operand 120 states and 310 transitions. Second operand 8 states. [2020-01-16 19:01:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:56,743 INFO L93 Difference]: Finished difference Result 203 states and 440 transitions. [2020-01-16 19:01:56,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:56,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:56,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:56,744 INFO L225 Difference]: With dead ends: 203 [2020-01-16 19:01:56,744 INFO L226 Difference]: Without dead ends: 193 [2020-01-16 19:01:56,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-01-16 19:01:56,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 122. [2020-01-16 19:01:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-01-16 19:01:56,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 313 transitions. [2020-01-16 19:01:56,746 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 313 transitions. Word has length 19 [2020-01-16 19:01:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:56,746 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 313 transitions. [2020-01-16 19:01:56,746 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 313 transitions. [2020-01-16 19:01:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:56,747 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:56,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 19:01:56,747 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 19:01:56,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:56,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1785690644, now seen corresponding path program 564 times [2020-01-16 19:01:56,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:56,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721283432] [2020-01-16 19:01:56,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:56,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721283432] [2020-01-16 19:01:56,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:56,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:56,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491730420] [2020-01-16 19:01:56,943 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:56,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:56,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:56,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:56,944 INFO L87 Difference]: Start difference. First operand 122 states and 313 transitions. Second operand 8 states. [2020-01-16 19:01:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:57,023 INFO L93 Difference]: Finished difference Result 197 states and 436 transitions. [2020-01-16 19:01:57,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:57,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:57,024 INFO L225 Difference]: With dead ends: 197 [2020-01-16 19:01:57,024 INFO L226 Difference]: Without dead ends: 179 [2020-01-16 19:01:57,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 19:01:57,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-01-16 19:01:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2020-01-16 19:01:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-01-16 19:01:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 303 transitions. [2020-01-16 19:01:57,026 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 303 transitions. Word has length 19 [2020-01-16 19:01:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:57,026 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 303 transitions. [2020-01-16 19:01:57,026 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 303 transitions. [2020-01-16 19:01:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:57,027 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:57,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 19:01:57,027 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 19:01:57,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:57,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1759986294, now seen corresponding path program 565 times [2020-01-16 19:01:57,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:57,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693470728] [2020-01-16 19:01:57,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:57,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693470728] [2020-01-16 19:01:57,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:57,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:57,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557617186] [2020-01-16 19:01:57,237 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:57,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:57,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:57,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:57,238 INFO L87 Difference]: Start difference. First operand 117 states and 303 transitions. Second operand 8 states. [2020-01-16 19:01:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:57,305 INFO L93 Difference]: Finished difference Result 207 states and 450 transitions. [2020-01-16 19:01:57,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:57,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:57,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:57,306 INFO L225 Difference]: With dead ends: 207 [2020-01-16 19:01:57,306 INFO L226 Difference]: Without dead ends: 191 [2020-01-16 19:01:57,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 19:01:57,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-01-16 19:01:57,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 117. [2020-01-16 19:01:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-01-16 19:01:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 298 transitions. [2020-01-16 19:01:57,309 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 298 transitions. Word has length 19 [2020-01-16 19:01:57,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:57,309 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 298 transitions. [2020-01-16 19:01:57,310 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 298 transitions. [2020-01-16 19:01:57,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:57,310 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:57,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 19:01:57,310 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 19:01:57,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:57,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1783918908, now seen corresponding path program 566 times [2020-01-16 19:01:57,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:57,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236482506] [2020-01-16 19:01:57,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:57,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 19:01:57,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236482506] [2020-01-16 19:01:57,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:57,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:57,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953827883] [2020-01-16 19:01:57,518 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:57,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:57,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:57,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:57,518 INFO L87 Difference]: Start difference. First operand 117 states and 298 transitions. Second operand 8 states. [2020-01-16 19:01:57,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:57,608 INFO L93 Difference]: Finished difference Result 203 states and 438 transitions. [2020-01-16 19:01:57,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:57,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:57,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:57,609 INFO L225 Difference]: With dead ends: 203 [2020-01-16 19:01:57,609 INFO L226 Difference]: Without dead ends: 186 [2020-01-16 19:01:57,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:57,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-01-16 19:01:57,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 112. [2020-01-16 19:01:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-01-16 19:01:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 284 transitions. [2020-01-16 19:01:57,612 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 284 transitions. Word has length 19 [2020-01-16 19:01:57,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:57,612 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 284 transitions. [2020-01-16 19:01:57,612 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 284 transitions. [2020-01-16 19:01:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:57,612 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:57,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 19:01:57,612 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 19:01:57,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:57,613 INFO L82 PathProgramCache]: Analyzing trace with hash 934543148, now seen corresponding path program 567 times [2020-01-16 19:01:57,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:57,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40141641] [2020-01-16 19:01:57,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:57,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40141641] [2020-01-16 19:01:57,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:57,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:57,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302657554] [2020-01-16 19:01:57,819 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:57,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:57,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:57,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:57,819 INFO L87 Difference]: Start difference. First operand 112 states and 284 transitions. Second operand 8 states. [2020-01-16 19:01:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:57,877 INFO L93 Difference]: Finished difference Result 195 states and 418 transitions. [2020-01-16 19:01:57,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:57,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:57,878 INFO L225 Difference]: With dead ends: 195 [2020-01-16 19:01:57,878 INFO L226 Difference]: Without dead ends: 179 [2020-01-16 19:01:57,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-01-16 19:01:57,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 104. [2020-01-16 19:01:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-01-16 19:01:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 263 transitions. [2020-01-16 19:01:57,880 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 263 transitions. Word has length 19 [2020-01-16 19:01:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:57,881 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 263 transitions. [2020-01-16 19:01:57,881 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:57,881 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 263 transitions. [2020-01-16 19:01:57,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:57,881 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:57,881 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:57,881 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 19:01:57,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:57,881 INFO L82 PathProgramCache]: Analyzing trace with hash -41661602, now seen corresponding path program 568 times [2020-01-16 19:01:57,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:57,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173822770] [2020-01-16 19:01:57,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:58,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 19:01:58,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173822770] [2020-01-16 19:01:58,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:58,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:58,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347954537] [2020-01-16 19:01:58,083 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:58,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:58,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:58,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:58,083 INFO L87 Difference]: Start difference. First operand 104 states and 263 transitions. Second operand 8 states. [2020-01-16 19:01:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:58,174 INFO L93 Difference]: Finished difference Result 183 states and 398 transitions. [2020-01-16 19:01:58,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:58,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:58,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:58,175 INFO L225 Difference]: With dead ends: 183 [2020-01-16 19:01:58,175 INFO L226 Difference]: Without dead ends: 164 [2020-01-16 19:01:58,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:58,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-01-16 19:01:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 98. [2020-01-16 19:01:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-01-16 19:01:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 247 transitions. [2020-01-16 19:01:58,178 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 247 transitions. Word has length 19 [2020-01-16 19:01:58,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:58,179 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 247 transitions. [2020-01-16 19:01:58,179 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:58,179 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 247 transitions. [2020-01-16 19:01:58,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:58,179 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:58,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 19:01:58,179 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 19:01:58,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:58,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1586342730, now seen corresponding path program 569 times [2020-01-16 19:01:58,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:58,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577845443] [2020-01-16 19:01:58,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:58,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 19:01:58,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577845443] [2020-01-16 19:01:58,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:58,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:58,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530156600] [2020-01-16 19:01:58,381 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:58,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:58,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:58,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:58,382 INFO L87 Difference]: Start difference. First operand 98 states and 247 transitions. Second operand 8 states. [2020-01-16 19:01:58,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:58,471 INFO L93 Difference]: Finished difference Result 180 states and 392 transitions. [2020-01-16 19:01:58,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:58,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:58,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:58,472 INFO L225 Difference]: With dead ends: 180 [2020-01-16 19:01:58,472 INFO L226 Difference]: Without dead ends: 168 [2020-01-16 19:01:58,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:58,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-01-16 19:01:58,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 102. [2020-01-16 19:01:58,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-01-16 19:01:58,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 255 transitions. [2020-01-16 19:01:58,475 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 255 transitions. Word has length 19 [2020-01-16 19:01:58,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:58,476 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 255 transitions. [2020-01-16 19:01:58,476 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:58,476 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 255 transitions. [2020-01-16 19:01:58,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:58,476 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:58,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 19:01:58,476 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 19:01:58,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:58,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1849750036, now seen corresponding path program 570 times [2020-01-16 19:01:58,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:58,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641843552] [2020-01-16 19:01:58,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:58,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 19:01:58,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641843552] [2020-01-16 19:01:58,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:58,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:58,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673627670] [2020-01-16 19:01:58,673 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:58,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:58,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:58,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:58,673 INFO L87 Difference]: Start difference. First operand 102 states and 255 transitions. Second operand 8 states. [2020-01-16 19:01:58,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:58,763 INFO L93 Difference]: Finished difference Result 167 states and 371 transitions. [2020-01-16 19:01:58,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:58,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:58,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:58,764 INFO L225 Difference]: With dead ends: 167 [2020-01-16 19:01:58,764 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 19:01:58,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 19:01:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 19:01:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2020-01-16 19:01:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 19:01:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 235 transitions. [2020-01-16 19:01:58,768 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 235 transitions. Word has length 19 [2020-01-16 19:01:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:58,768 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 235 transitions. [2020-01-16 19:01:58,768 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 235 transitions. [2020-01-16 19:01:58,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:58,768 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:58,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 19:01:58,769 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 19:01:58,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:58,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1422262942, now seen corresponding path program 571 times [2020-01-16 19:01:58,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:58,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651378204] [2020-01-16 19:01:58,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:58,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 19:01:58,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651378204] [2020-01-16 19:01:58,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:58,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:58,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649121698] [2020-01-16 19:01:58,977 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:58,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:58,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:58,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:58,978 INFO L87 Difference]: Start difference. First operand 93 states and 235 transitions. Second operand 8 states. [2020-01-16 19:01:59,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:59,052 INFO L93 Difference]: Finished difference Result 172 states and 373 transitions. [2020-01-16 19:01:59,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:59,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:59,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:59,053 INFO L225 Difference]: With dead ends: 172 [2020-01-16 19:01:59,053 INFO L226 Difference]: Without dead ends: 162 [2020-01-16 19:01:59,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:59,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-01-16 19:01:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 97. [2020-01-16 19:01:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-01-16 19:01:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 245 transitions. [2020-01-16 19:01:59,056 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 245 transitions. Word has length 19 [2020-01-16 19:01:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:59,057 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 245 transitions. [2020-01-16 19:01:59,057 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 245 transitions. [2020-01-16 19:01:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:59,057 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:59,057 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:59,058 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 19:01:59,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:59,058 INFO L82 PathProgramCache]: Analyzing trace with hash 566956288, now seen corresponding path program 572 times [2020-01-16 19:01:59,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:59,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603555085] [2020-01-16 19:01:59,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:59,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 19:01:59,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603555085] [2020-01-16 19:01:59,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:59,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:59,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318931095] [2020-01-16 19:01:59,284 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:59,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:59,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:59,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:59,285 INFO L87 Difference]: Start difference. First operand 97 states and 245 transitions. Second operand 8 states. [2020-01-16 19:01:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:59,378 INFO L93 Difference]: Finished difference Result 174 states and 376 transitions. [2020-01-16 19:01:59,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:59,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:59,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:59,379 INFO L225 Difference]: With dead ends: 174 [2020-01-16 19:01:59,379 INFO L226 Difference]: Without dead ends: 160 [2020-01-16 19:01:59,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:59,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-01-16 19:01:59,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 95. [2020-01-16 19:01:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-01-16 19:01:59,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 240 transitions. [2020-01-16 19:01:59,383 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 240 transitions. Word has length 19 [2020-01-16 19:01:59,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:59,383 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 240 transitions. [2020-01-16 19:01:59,383 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 240 transitions. [2020-01-16 19:01:59,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:59,383 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:59,383 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:59,383 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 19:01:59,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:59,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1261763396, now seen corresponding path program 573 times [2020-01-16 19:01:59,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:59,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640920433] [2020-01-16 19:01:59,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:01:59,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640920433] [2020-01-16 19:01:59,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:59,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:59,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111481914] [2020-01-16 19:01:59,592 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:59,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:59,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:59,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:59,592 INFO L87 Difference]: Start difference. First operand 95 states and 240 transitions. Second operand 8 states. [2020-01-16 19:01:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:59,668 INFO L93 Difference]: Finished difference Result 168 states and 363 transitions. [2020-01-16 19:01:59,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:59,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:59,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:59,669 INFO L225 Difference]: With dead ends: 168 [2020-01-16 19:01:59,669 INFO L226 Difference]: Without dead ends: 158 [2020-01-16 19:01:59,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:01:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-01-16 19:01:59,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 97. [2020-01-16 19:01:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-01-16 19:01:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 243 transitions. [2020-01-16 19:01:59,672 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 243 transitions. Word has length 19 [2020-01-16 19:01:59,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:59,672 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 243 transitions. [2020-01-16 19:01:59,672 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 243 transitions. [2020-01-16 19:01:59,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:59,673 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:59,673 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:59,673 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 19:01:59,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:59,673 INFO L82 PathProgramCache]: Analyzing trace with hash 227641600, now seen corresponding path program 574 times [2020-01-16 19:01:59,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:59,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779280930] [2020-01-16 19:01:59,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:01:59,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 19:01:59,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779280930] [2020-01-16 19:01:59,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:01:59,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:01:59,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781272359] [2020-01-16 19:01:59,872 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:01:59,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:01:59,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:01:59,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:01:59,873 INFO L87 Difference]: Start difference. First operand 97 states and 243 transitions. Second operand 8 states. [2020-01-16 19:01:59,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:01:59,968 INFO L93 Difference]: Finished difference Result 162 states and 359 transitions. [2020-01-16 19:01:59,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:01:59,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:01:59,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:01:59,969 INFO L225 Difference]: With dead ends: 162 [2020-01-16 19:01:59,969 INFO L226 Difference]: Without dead ends: 147 [2020-01-16 19:01:59,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 19:01:59,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-01-16 19:01:59,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 95. [2020-01-16 19:01:59,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-01-16 19:01:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 238 transitions. [2020-01-16 19:01:59,972 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 238 transitions. Word has length 19 [2020-01-16 19:01:59,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:01:59,972 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 238 transitions. [2020-01-16 19:01:59,972 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:01:59,972 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 238 transitions. [2020-01-16 19:01:59,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:01:59,973 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:01:59,973 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:01:59,973 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 19:01:59,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:01:59,973 INFO L82 PathProgramCache]: Analyzing trace with hash -506129092, now seen corresponding path program 575 times [2020-01-16 19:01:59,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:01:59,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841176065] [2020-01-16 19:01:59,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:01:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:00,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:00,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841176065] [2020-01-16 19:02:00,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:00,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:00,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778203543] [2020-01-16 19:02:00,174 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:00,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:00,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:00,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:00,174 INFO L87 Difference]: Start difference. First operand 95 states and 238 transitions. Second operand 8 states. [2020-01-16 19:02:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:00,268 INFO L93 Difference]: Finished difference Result 155 states and 344 transitions. [2020-01-16 19:02:00,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:00,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:00,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:00,269 INFO L225 Difference]: With dead ends: 155 [2020-01-16 19:02:00,269 INFO L226 Difference]: Without dead ends: 143 [2020-01-16 19:02:00,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 19:02:00,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-01-16 19:02:00,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 99. [2020-01-16 19:02:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-01-16 19:02:00,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 246 transitions. [2020-01-16 19:02:00,272 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 246 transitions. Word has length 19 [2020-01-16 19:02:00,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:00,272 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 246 transitions. [2020-01-16 19:02:00,272 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:00,272 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 246 transitions. [2020-01-16 19:02:00,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:00,272 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:00,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 19:02:00,273 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 19:02:00,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:00,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1261763396, now seen corresponding path program 576 times [2020-01-16 19:02:00,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:00,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293089388] [2020-01-16 19:02:00,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:00,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 19:02:00,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293089388] [2020-01-16 19:02:00,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:00,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:00,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747079740] [2020-01-16 19:02:00,473 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:00,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:00,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:00,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:00,473 INFO L87 Difference]: Start difference. First operand 99 states and 246 transitions. Second operand 8 states. [2020-01-16 19:02:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:00,561 INFO L93 Difference]: Finished difference Result 142 states and 323 transitions. [2020-01-16 19:02:00,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:00,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:00,562 INFO L225 Difference]: With dead ends: 142 [2020-01-16 19:02:00,562 INFO L226 Difference]: Without dead ends: 120 [2020-01-16 19:02:00,562 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-01-16 19:02:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 90. [2020-01-16 19:02:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 19:02:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 229 transitions. [2020-01-16 19:02:00,564 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 229 transitions. Word has length 19 [2020-01-16 19:02:00,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:00,564 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 229 transitions. [2020-01-16 19:02:00,564 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 229 transitions. [2020-01-16 19:02:00,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:00,565 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:00,565 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:00,565 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 19:02:00,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:00,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1776969654, now seen corresponding path program 577 times [2020-01-16 19:02:00,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:00,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462217347] [2020-01-16 19:02:00,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:00,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462217347] [2020-01-16 19:02:00,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:00,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:00,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655613119] [2020-01-16 19:02:00,790 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:00,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:00,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:00,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:00,790 INFO L87 Difference]: Start difference. First operand 90 states and 229 transitions. Second operand 8 states. [2020-01-16 19:02:00,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:00,883 INFO L93 Difference]: Finished difference Result 165 states and 357 transitions. [2020-01-16 19:02:00,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:00,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:00,884 INFO L225 Difference]: With dead ends: 165 [2020-01-16 19:02:00,884 INFO L226 Difference]: Without dead ends: 155 [2020-01-16 19:02:00,884 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-01-16 19:02:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 93. [2020-01-16 19:02:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 19:02:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 237 transitions. [2020-01-16 19:02:00,887 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 237 transitions. Word has length 19 [2020-01-16 19:02:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:00,887 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 237 transitions. [2020-01-16 19:02:00,888 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:00,888 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 237 transitions. [2020-01-16 19:02:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:00,888 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:00,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 19:02:00,888 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 19:02:00,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:00,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2016611992, now seen corresponding path program 578 times [2020-01-16 19:02:00,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:00,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688450706] [2020-01-16 19:02:00,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:01,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688450706] [2020-01-16 19:02:01,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:01,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:01,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537843428] [2020-01-16 19:02:01,115 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:01,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:01,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:01,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:01,116 INFO L87 Difference]: Start difference. First operand 93 states and 237 transitions. Second operand 8 states. [2020-01-16 19:02:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:01,192 INFO L93 Difference]: Finished difference Result 165 states and 356 transitions. [2020-01-16 19:02:01,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:01,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:01,193 INFO L225 Difference]: With dead ends: 165 [2020-01-16 19:02:01,193 INFO L226 Difference]: Without dead ends: 154 [2020-01-16 19:02:01,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:01,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-01-16 19:02:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 92. [2020-01-16 19:02:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-01-16 19:02:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 235 transitions. [2020-01-16 19:02:01,196 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 235 transitions. Word has length 19 [2020-01-16 19:02:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:01,197 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 235 transitions. [2020-01-16 19:02:01,197 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:01,197 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 235 transitions. [2020-01-16 19:02:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:01,197 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02: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 19:02:01,197 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 19:02:01,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:01,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1773295144, now seen corresponding path program 579 times [2020-01-16 19:02:01,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:01,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052287384] [2020-01-16 19:02:01,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:01,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052287384] [2020-01-16 19:02:01,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:01,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:01,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611512348] [2020-01-16 19:02:01,416 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:01,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:01,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:01,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:01,417 INFO L87 Difference]: Start difference. First operand 92 states and 235 transitions. Second operand 8 states. [2020-01-16 19:02:01,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:01,510 INFO L93 Difference]: Finished difference Result 168 states and 364 transitions. [2020-01-16 19:02:01,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:01,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:01,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:01,511 INFO L225 Difference]: With dead ends: 168 [2020-01-16 19:02:01,511 INFO L226 Difference]: Without dead ends: 158 [2020-01-16 19:02:01,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 19:02:01,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-01-16 19:02:01,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 94. [2020-01-16 19:02:01,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-01-16 19:02:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 238 transitions. [2020-01-16 19:02:01,514 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 238 transitions. Word has length 19 [2020-01-16 19:02:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:01,514 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 238 transitions. [2020-01-16 19:02:01,514 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 238 transitions. [2020-01-16 19:02:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:01,515 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:01,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 19:02:01,515 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 19:02:01,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:01,515 INFO L82 PathProgramCache]: Analyzing trace with hash -811058844, now seen corresponding path program 580 times [2020-01-16 19:02:01,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:01,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985951826] [2020-01-16 19:02:01,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:01,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 19:02:01,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985951826] [2020-01-16 19:02:01,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:01,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:01,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120399481] [2020-01-16 19:02:01,736 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:01,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:01,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:01,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:01,736 INFO L87 Difference]: Start difference. First operand 94 states and 238 transitions. Second operand 8 states. [2020-01-16 19:02:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:01,830 INFO L93 Difference]: Finished difference Result 170 states and 367 transitions. [2020-01-16 19:02:01,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:01,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:01,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:01,831 INFO L225 Difference]: With dead ends: 170 [2020-01-16 19:02:01,831 INFO L226 Difference]: Without dead ends: 156 [2020-01-16 19:02:01,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 19:02:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-01-16 19:02:01,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 92. [2020-01-16 19:02:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-01-16 19:02:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 234 transitions. [2020-01-16 19:02:01,834 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 234 transitions. Word has length 19 [2020-01-16 19:02:01,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:01,834 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 234 transitions. [2020-01-16 19:02:01,835 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:01,835 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 234 transitions. [2020-01-16 19:02:01,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:01,835 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:01,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 19:02:01,835 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 19:02:01,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:01,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1205269924, now seen corresponding path program 581 times [2020-01-16 19:02:01,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:01,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896284247] [2020-01-16 19:02:01,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:02,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 19:02:02,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896284247] [2020-01-16 19:02:02,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:02,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:02,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755510971] [2020-01-16 19:02:02,054 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:02,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:02,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:02,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:02,054 INFO L87 Difference]: Start difference. First operand 92 states and 234 transitions. Second operand 8 states. [2020-01-16 19:02:02,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:02,124 INFO L93 Difference]: Finished difference Result 168 states and 363 transitions. [2020-01-16 19:02:02,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:02,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:02,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:02,125 INFO L225 Difference]: With dead ends: 168 [2020-01-16 19:02:02,126 INFO L226 Difference]: Without dead ends: 158 [2020-01-16 19:02:02,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 19:02:02,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-01-16 19:02:02,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 94. [2020-01-16 19:02:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-01-16 19:02:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 237 transitions. [2020-01-16 19:02:02,129 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 237 transitions. Word has length 19 [2020-01-16 19:02:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:02,129 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 237 transitions. [2020-01-16 19:02:02,129 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 237 transitions. [2020-01-16 19:02:02,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:02,129 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:02,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 19:02:02,129 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 19:02:02,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:02,130 INFO L82 PathProgramCache]: Analyzing trace with hash 349963270, now seen corresponding path program 582 times [2020-01-16 19:02:02,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:02,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783024085] [2020-01-16 19:02:02,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:02,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 19:02:02,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783024085] [2020-01-16 19:02:02,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:02,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:02,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707455022] [2020-01-16 19:02:02,353 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:02,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:02,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:02,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:02,354 INFO L87 Difference]: Start difference. First operand 94 states and 237 transitions. Second operand 8 states. [2020-01-16 19:02:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:02,440 INFO L93 Difference]: Finished difference Result 170 states and 366 transitions. [2020-01-16 19:02:02,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:02,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:02,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:02,441 INFO L225 Difference]: With dead ends: 170 [2020-01-16 19:02:02,441 INFO L226 Difference]: Without dead ends: 155 [2020-01-16 19:02:02,441 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-01-16 19:02:02,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 91. [2020-01-16 19:02:02,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-01-16 19:02:02,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 232 transitions. [2020-01-16 19:02:02,444 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 232 transitions. Word has length 19 [2020-01-16 19:02:02,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:02,445 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 232 transitions. [2020-01-16 19:02:02,445 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:02,445 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 232 transitions. [2020-01-16 19:02:02,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:02,445 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:02,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 19:02:02,445 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 19:02:02,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:02,445 INFO L82 PathProgramCache]: Analyzing trace with hash 917559788, now seen corresponding path program 583 times [2020-01-16 19:02:02,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:02,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653290108] [2020-01-16 19:02:02,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:02,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653290108] [2020-01-16 19:02:02,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:02,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:02,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858568261] [2020-01-16 19:02:02,662 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:02,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:02,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:02,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:02,663 INFO L87 Difference]: Start difference. First operand 91 states and 232 transitions. Second operand 8 states. [2020-01-16 19:02:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:02,759 INFO L93 Difference]: Finished difference Result 163 states and 351 transitions. [2020-01-16 19:02:02,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:02,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:02,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:02,760 INFO L225 Difference]: With dead ends: 163 [2020-01-16 19:02:02,760 INFO L226 Difference]: Without dead ends: 153 [2020-01-16 19:02:02,761 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:02,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-01-16 19:02:02,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 93. [2020-01-16 19:02:02,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 19:02:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 236 transitions. [2020-01-16 19:02:02,763 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 236 transitions. Word has length 19 [2020-01-16 19:02:02,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:02,763 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 236 transitions. [2020-01-16 19:02:02,763 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:02,763 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 236 transitions. [2020-01-16 19:02:02,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:02,764 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:02,764 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:02,764 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 19:02:02,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:02,764 INFO L82 PathProgramCache]: Analyzing trace with hash 677917450, now seen corresponding path program 584 times [2020-01-16 19:02:02,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:02,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378747098] [2020-01-16 19:02:02,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:02,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378747098] [2020-01-16 19:02:02,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:02,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:02,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124126737] [2020-01-16 19:02:02,992 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:02,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:02,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:02,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:02,993 INFO L87 Difference]: Start difference. First operand 93 states and 236 transitions. Second operand 8 states. [2020-01-16 19:02:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:03,067 INFO L93 Difference]: Finished difference Result 163 states and 350 transitions. [2020-01-16 19:02:03,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:03,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:03,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:03,068 INFO L225 Difference]: With dead ends: 163 [2020-01-16 19:02:03,068 INFO L226 Difference]: Without dead ends: 152 [2020-01-16 19:02: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 19:02:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-01-16 19:02:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 92. [2020-01-16 19:02:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-01-16 19:02:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 234 transitions. [2020-01-16 19:02:03,071 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 234 transitions. Word has length 19 [2020-01-16 19:02:03,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:03,071 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 234 transitions. [2020-01-16 19:02:03,071 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 234 transitions. [2020-01-16 19:02:03,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:03,071 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:03,071 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:03,071 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 19:02:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:03,071 INFO L82 PathProgramCache]: Analyzing trace with hash -155525592, now seen corresponding path program 585 times [2020-01-16 19:02:03,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:03,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062577140] [2020-01-16 19:02:03,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:03,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062577140] [2020-01-16 19:02:03,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:03,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:03,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59048750] [2020-01-16 19:02:03,278 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:03,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:03,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:03,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:03,279 INFO L87 Difference]: Start difference. First operand 92 states and 234 transitions. Second operand 8 states. [2020-01-16 19:02:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:03,391 INFO L93 Difference]: Finished difference Result 165 states and 357 transitions. [2020-01-16 19:02:03,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:03,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:03,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:03,392 INFO L225 Difference]: With dead ends: 165 [2020-01-16 19:02:03,393 INFO L226 Difference]: Without dead ends: 155 [2020-01-16 19:02:03,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 19:02:03,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-01-16 19:02:03,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 94. [2020-01-16 19:02:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-01-16 19:02:03,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 237 transitions. [2020-01-16 19:02:03,396 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 237 transitions. Word has length 19 [2020-01-16 19:02:03,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:03,396 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 237 transitions. [2020-01-16 19:02:03,396 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 237 transitions. [2020-01-16 19:02:03,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:03,396 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:03,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 19:02:03,396 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 19:02:03,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:03,397 INFO L82 PathProgramCache]: Analyzing trace with hash 799453412, now seen corresponding path program 586 times [2020-01-16 19:02:03,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:03,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751765339] [2020-01-16 19:02:03,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:03,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 19:02:03,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751765339] [2020-01-16 19:02:03,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:03,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:03,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144306506] [2020-01-16 19:02:03,604 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:03,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:03,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:03,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:03,604 INFO L87 Difference]: Start difference. First operand 94 states and 237 transitions. Second operand 8 states. [2020-01-16 19:02:03,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:03,700 INFO L93 Difference]: Finished difference Result 159 states and 353 transitions. [2020-01-16 19:02:03,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:03,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:03,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:03,701 INFO L225 Difference]: With dead ends: 159 [2020-01-16 19:02:03,701 INFO L226 Difference]: Without dead ends: 144 [2020-01-16 19:02:03,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 19:02:03,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-01-16 19:02:03,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 92. [2020-01-16 19:02:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-01-16 19:02:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 233 transitions. [2020-01-16 19:02:03,703 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 233 transitions. Word has length 19 [2020-01-16 19:02:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:03,704 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 233 transitions. [2020-01-16 19:02:03,704 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 233 transitions. [2020-01-16 19:02:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:03,704 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:03,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 19:02:03,704 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 19:02:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:03,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1215773028, now seen corresponding path program 587 times [2020-01-16 19:02:03,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:03,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051819706] [2020-01-16 19:02:03,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:03,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 19:02:03,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051819706] [2020-01-16 19:02:03,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:03,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:03,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928012529] [2020-01-16 19:02:03,918 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:03,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:03,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:03,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:03,918 INFO L87 Difference]: Start difference. First operand 92 states and 233 transitions. Second operand 8 states. [2020-01-16 19:02:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:03,992 INFO L93 Difference]: Finished difference Result 165 states and 356 transitions. [2020-01-16 19:02:03,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:03,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:03,993 INFO L225 Difference]: With dead ends: 165 [2020-01-16 19:02:03,994 INFO L226 Difference]: Without dead ends: 155 [2020-01-16 19:02:03,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:03,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-01-16 19:02:03,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 94. [2020-01-16 19:02:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-01-16 19:02:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 236 transitions. [2020-01-16 19:02:03,997 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 236 transitions. Word has length 19 [2020-01-16 19:02:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:03,997 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 236 transitions. [2020-01-16 19:02:03,997 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 236 transitions. [2020-01-16 19:02:03,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:03,997 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:03,997 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:03,997 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 19:02:03,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:03,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1589789272, now seen corresponding path program 588 times [2020-01-16 19:02:03,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:03,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570321990] [2020-01-16 19:02:03,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:04,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 19:02:04,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570321990] [2020-01-16 19:02:04,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:04,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:04,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197281876] [2020-01-16 19:02:04,211 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:04,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:04,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:04,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:04,211 INFO L87 Difference]: Start difference. First operand 94 states and 236 transitions. Second operand 8 states. [2020-01-16 19:02:04,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:04,295 INFO L93 Difference]: Finished difference Result 159 states and 352 transitions. [2020-01-16 19:02:04,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:04,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:04,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:04,296 INFO L225 Difference]: With dead ends: 159 [2020-01-16 19:02:04,296 INFO L226 Difference]: Without dead ends: 143 [2020-01-16 19:02:04,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 19:02:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-01-16 19:02:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 91. [2020-01-16 19:02:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-01-16 19:02:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 231 transitions. [2020-01-16 19:02:04,300 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 231 transitions. Word has length 19 [2020-01-16 19:02:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:04,300 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 231 transitions. [2020-01-16 19:02:04,300 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 231 transitions. [2020-01-16 19:02:04,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:04,300 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:04,300 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:04,301 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 19:02:04,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:04,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1427580564, now seen corresponding path program 589 times [2020-01-16 19:02:04,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:04,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817161045] [2020-01-16 19:02:04,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:04,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 19:02:04,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817161045] [2020-01-16 19:02:04,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:04,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:04,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763711747] [2020-01-16 19:02:04,513 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:04,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:04,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:04,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:04,513 INFO L87 Difference]: Start difference. First operand 91 states and 231 transitions. Second operand 8 states. [2020-01-16 19:02:04,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:04,607 INFO L93 Difference]: Finished difference Result 161 states and 347 transitions. [2020-01-16 19:02:04,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:04,607 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:04,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:04,608 INFO L225 Difference]: With dead ends: 161 [2020-01-16 19:02:04,608 INFO L226 Difference]: Without dead ends: 151 [2020-01-16 19:02:04,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:04,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-01-16 19:02:04,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 95. [2020-01-16 19:02:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-01-16 19:02:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 241 transitions. [2020-01-16 19:02:04,611 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 241 transitions. Word has length 19 [2020-01-16 19:02:04,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:04,611 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 241 transitions. [2020-01-16 19:02:04,611 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 241 transitions. [2020-01-16 19:02:04,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:04,611 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:04,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 19:02:04,611 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 19:02:04,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:04,612 INFO L82 PathProgramCache]: Analyzing trace with hash 283032744, now seen corresponding path program 590 times [2020-01-16 19:02:04,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:04,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907846] [2020-01-16 19:02:04,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:04,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 19:02:04,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907846] [2020-01-16 19:02:04,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:04,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:04,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191346275] [2020-01-16 19:02:04,827 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:04,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:04,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:04,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:04,828 INFO L87 Difference]: Start difference. First operand 95 states and 241 transitions. Second operand 8 states. [2020-01-16 19:02:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:04,924 INFO L93 Difference]: Finished difference Result 163 states and 350 transitions. [2020-01-16 19:02:04,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:04,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:04,926 INFO L225 Difference]: With dead ends: 163 [2020-01-16 19:02:04,926 INFO L226 Difference]: Without dead ends: 149 [2020-01-16 19:02:04,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:04,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-01-16 19:02:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 93. [2020-01-16 19:02:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 19:02:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 236 transitions. [2020-01-16 19:02:04,928 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 236 transitions. Word has length 19 [2020-01-16 19:02:04,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:04,928 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 236 transitions. [2020-01-16 19:02:04,929 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:04,929 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 236 transitions. [2020-01-16 19:02:04,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:04,929 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:04,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 19:02:04,929 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 19:02:04,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:04,929 INFO L82 PathProgramCache]: Analyzing trace with hash 917559788, now seen corresponding path program 591 times [2020-01-16 19:02:04,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:04,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961353203] [2020-01-16 19:02:04,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:05,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 19:02:05,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961353203] [2020-01-16 19:02:05,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:05,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:05,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012181181] [2020-01-16 19:02:05,134 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:05,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:05,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:05,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:05,134 INFO L87 Difference]: Start difference. First operand 93 states and 236 transitions. Second operand 8 states. [2020-01-16 19:02:05,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:05,231 INFO L93 Difference]: Finished difference Result 158 states and 339 transitions. [2020-01-16 19:02:05,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:05,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:05,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:05,232 INFO L225 Difference]: With dead ends: 158 [2020-01-16 19:02:05,232 INFO L226 Difference]: Without dead ends: 148 [2020-01-16 19:02:05,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 19:02:05,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-01-16 19:02:05,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 95. [2020-01-16 19:02:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-01-16 19:02:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 239 transitions. [2020-01-16 19:02:05,234 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 239 transitions. Word has length 19 [2020-01-16 19:02:05,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:05,234 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 239 transitions. [2020-01-16 19:02:05,234 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 239 transitions. [2020-01-16 19:02:05,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:05,235 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:05,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 19:02:05,235 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 19:02:05,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:05,235 INFO L82 PathProgramCache]: Analyzing trace with hash -811487546, now seen corresponding path program 592 times [2020-01-16 19:02:05,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:05,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859111643] [2020-01-16 19:02:05,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:05,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859111643] [2020-01-16 19:02:05,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:05,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:05,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77897639] [2020-01-16 19:02:05,438 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:05,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:05,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:05,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:05,439 INFO L87 Difference]: Start difference. First operand 95 states and 239 transitions. Second operand 8 states. [2020-01-16 19:02:05,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:05,536 INFO L93 Difference]: Finished difference Result 152 states and 335 transitions. [2020-01-16 19:02:05,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:05,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:05,537 INFO L225 Difference]: With dead ends: 152 [2020-01-16 19:02:05,537 INFO L226 Difference]: Without dead ends: 137 [2020-01-16 19:02:05,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:05,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-01-16 19:02:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 93. [2020-01-16 19:02:05,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 19:02:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 234 transitions. [2020-01-16 19:02:05,540 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 234 transitions. Word has length 19 [2020-01-16 19:02:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:05,541 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 234 transitions. [2020-01-16 19:02:05,541 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 234 transitions. [2020-01-16 19:02:05,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:05,541 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:05,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 19:02:05,541 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 19:02:05,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:05,541 INFO L82 PathProgramCache]: Analyzing trace with hash -177389204, now seen corresponding path program 593 times [2020-01-16 19:02:05,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:05,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090312262] [2020-01-16 19:02:05,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02: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 19:02:05,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090312262] [2020-01-16 19:02:05,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:05,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:05,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42990401] [2020-01-16 19:02:05,752 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:05,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:05,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:05,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:05,753 INFO L87 Difference]: Start difference. First operand 93 states and 234 transitions. Second operand 8 states. [2020-01-16 19:02:05,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:05,834 INFO L93 Difference]: Finished difference Result 153 states and 340 transitions. [2020-01-16 19:02:05,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:05,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:05,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:05,835 INFO L225 Difference]: With dead ends: 153 [2020-01-16 19:02:05,835 INFO L226 Difference]: Without dead ends: 141 [2020-01-16 19:02:05,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 19:02:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-01-16 19:02:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 97. [2020-01-16 19:02:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-01-16 19:02:05,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 242 transitions. [2020-01-16 19:02:05,838 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 242 transitions. Word has length 19 [2020-01-16 19:02:05,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:05,838 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 242 transitions. [2020-01-16 19:02:05,838 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:05,838 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 242 transitions. [2020-01-16 19:02:05,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:05,839 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:05,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 19:02:05,839 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 19:02:05,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:05,839 INFO L82 PathProgramCache]: Analyzing trace with hash 677917450, now seen corresponding path program 594 times [2020-01-16 19:02:05,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:05,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45000133] [2020-01-16 19:02:05,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:06,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45000133] [2020-01-16 19:02:06,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:06,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:06,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638722441] [2020-01-16 19:02:06,067 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:06,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:06,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:06,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:06,067 INFO L87 Difference]: Start difference. First operand 97 states and 242 transitions. Second operand 8 states. [2020-01-16 19:02:06,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:06,156 INFO L93 Difference]: Finished difference Result 140 states and 319 transitions. [2020-01-16 19:02:06,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:06,157 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:06,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:06,157 INFO L225 Difference]: With dead ends: 140 [2020-01-16 19:02:06,157 INFO L226 Difference]: Without dead ends: 121 [2020-01-16 19:02:06,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 19:02:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-01-16 19:02:06,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 91. [2020-01-16 19:02:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-01-16 19:02:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 230 transitions. [2020-01-16 19:02:06,160 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 230 transitions. Word has length 19 [2020-01-16 19:02:06,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:06,160 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 230 transitions. [2020-01-16 19:02:06,160 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:06,160 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 230 transitions. [2020-01-16 19:02:06,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:06,161 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:06,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 19:02:06,161 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 19:02:06,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:06,161 INFO L82 PathProgramCache]: Analyzing trace with hash 698923658, now seen corresponding path program 595 times [2020-01-16 19:02:06,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:06,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459794017] [2020-01-16 19:02:06,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:06,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 19:02:06,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459794017] [2020-01-16 19:02:06,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:06,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:06,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193395293] [2020-01-16 19:02:06,385 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:06,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:06,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:06,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:06,386 INFO L87 Difference]: Start difference. First operand 91 states and 230 transitions. Second operand 8 states. [2020-01-16 19:02:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:06,445 INFO L93 Difference]: Finished difference Result 140 states and 309 transitions. [2020-01-16 19:02:06,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:06,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:06,446 INFO L225 Difference]: With dead ends: 140 [2020-01-16 19:02:06,446 INFO L226 Difference]: Without dead ends: 130 [2020-01-16 19:02:06,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 19:02:06,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-01-16 19:02:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 95. [2020-01-16 19:02:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-01-16 19:02:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 240 transitions. [2020-01-16 19:02:06,450 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 240 transitions. Word has length 19 [2020-01-16 19:02:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:06,450 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 240 transitions. [2020-01-16 19:02:06,450 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 240 transitions. [2020-01-16 19:02:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:06,450 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:06,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 19:02:06,451 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 19:02:06,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:06,451 INFO L82 PathProgramCache]: Analyzing trace with hash -156382996, now seen corresponding path program 596 times [2020-01-16 19:02:06,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:06,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020248866] [2020-01-16 19:02:06,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:06,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 19:02:06,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020248866] [2020-01-16 19:02:06,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:06,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:06,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632915304] [2020-01-16 19:02:06,665 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:06,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:06,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:06,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:06,665 INFO L87 Difference]: Start difference. First operand 95 states and 240 transitions. Second operand 8 states. [2020-01-16 19:02:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:06,762 INFO L93 Difference]: Finished difference Result 142 states and 312 transitions. [2020-01-16 19:02:06,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:06,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:06,763 INFO L225 Difference]: With dead ends: 142 [2020-01-16 19:02:06,763 INFO L226 Difference]: Without dead ends: 128 [2020-01-16 19:02:06,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 19:02:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-01-16 19:02:06,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2020-01-16 19:02:06,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 19:02:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 235 transitions. [2020-01-16 19:02:06,766 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 235 transitions. Word has length 19 [2020-01-16 19:02:06,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:06,766 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 235 transitions. [2020-01-16 19:02:06,766 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 235 transitions. [2020-01-16 19:02:06,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:06,766 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:06,766 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:06,766 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 19:02:06,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:06,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1985102680, now seen corresponding path program 597 times [2020-01-16 19:02:06,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:06,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696509621] [2020-01-16 19:02:06,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:06,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696509621] [2020-01-16 19:02:06,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:06,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:06,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161698237] [2020-01-16 19:02:06,979 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:06,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:06,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:06,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:06,980 INFO L87 Difference]: Start difference. First operand 93 states and 235 transitions. Second operand 8 states. [2020-01-16 19:02:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:07,048 INFO L93 Difference]: Finished difference Result 136 states and 299 transitions. [2020-01-16 19:02:07,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:07,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:07,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:07,049 INFO L225 Difference]: With dead ends: 136 [2020-01-16 19:02:07,049 INFO L226 Difference]: Without dead ends: 126 [2020-01-16 19:02:07,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-01-16 19:02:07,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 95. [2020-01-16 19:02:07,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-01-16 19:02:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 238 transitions. [2020-01-16 19:02:07,052 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 238 transitions. Word has length 19 [2020-01-16 19:02:07,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:07,053 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 238 transitions. [2020-01-16 19:02:07,053 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:07,053 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 238 transitions. [2020-01-16 19:02:07,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:07,053 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:07,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 19:02:07,053 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 19:02:07,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:07,053 INFO L82 PathProgramCache]: Analyzing trace with hash -495697684, now seen corresponding path program 598 times [2020-01-16 19:02:07,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:07,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237484833] [2020-01-16 19:02:07,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:07,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:07,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237484833] [2020-01-16 19:02:07,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:07,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:07,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315007407] [2020-01-16 19:02:07,265 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:07,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:07,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:07,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:07,265 INFO L87 Difference]: Start difference. First operand 95 states and 238 transitions. Second operand 8 states. [2020-01-16 19:02:07,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:07,356 INFO L93 Difference]: Finished difference Result 130 states and 295 transitions. [2020-01-16 19:02:07,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:07,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:07,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:07,357 INFO L225 Difference]: With dead ends: 130 [2020-01-16 19:02:07,357 INFO L226 Difference]: Without dead ends: 115 [2020-01-16 19:02:07,358 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:07,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-01-16 19:02:07,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 93. [2020-01-16 19:02:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 19:02:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 233 transitions. [2020-01-16 19:02:07,360 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 233 transitions. Word has length 19 [2020-01-16 19:02:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:07,360 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 233 transitions. [2020-01-16 19:02:07,361 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 233 transitions. [2020-01-16 19:02:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:07,361 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:07,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 19:02:07,364 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 19:02:07,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:07,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1229468376, now seen corresponding path program 599 times [2020-01-16 19:02:07,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:07,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347509934] [2020-01-16 19:02:07,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:07,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347509934] [2020-01-16 19:02:07,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:07,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:07,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616251901] [2020-01-16 19:02:07,579 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:07,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:07,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:07,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:07,579 INFO L87 Difference]: Start difference. First operand 93 states and 233 transitions. Second operand 8 states. [2020-01-16 19:02:07,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:07,663 INFO L93 Difference]: Finished difference Result 123 states and 280 transitions. [2020-01-16 19:02:07,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:07,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:07,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:07,664 INFO L225 Difference]: With dead ends: 123 [2020-01-16 19:02:07,664 INFO L226 Difference]: Without dead ends: 111 [2020-01-16 19:02:07,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:07,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-01-16 19:02:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2020-01-16 19:02:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-01-16 19:02:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 241 transitions. [2020-01-16 19:02:07,667 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 241 transitions. Word has length 19 [2020-01-16 19:02:07,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:07,667 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 241 transitions. [2020-01-16 19:02:07,667 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 241 transitions. [2020-01-16 19:02:07,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:07,668 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:07,668 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:07,668 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 19:02:07,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:07,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1985102680, now seen corresponding path program 600 times [2020-01-16 19:02:07,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:07,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682450006] [2020-01-16 19:02:07,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:07,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682450006] [2020-01-16 19:02:07,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:07,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:07,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952379431] [2020-01-16 19:02:07,881 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:07,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:07,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:07,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:07,881 INFO L87 Difference]: Start difference. First operand 97 states and 241 transitions. Second operand 8 states. [2020-01-16 19:02:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:07,966 INFO L93 Difference]: Finished difference Result 110 states and 259 transitions. [2020-01-16 19:02:07,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:07,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:07,967 INFO L225 Difference]: With dead ends: 110 [2020-01-16 19:02:07,967 INFO L226 Difference]: Without dead ends: 88 [2020-01-16 19:02:07,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:07,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-01-16 19:02:07,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-01-16 19:02:07,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 19:02:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 225 transitions. [2020-01-16 19:02:07,970 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 225 transitions. Word has length 19 [2020-01-16 19:02:07,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:07,970 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 225 transitions. [2020-01-16 19:02:07,970 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:07,971 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 225 transitions. [2020-01-16 19:02:07,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:07,971 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:07,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 19:02:07,971 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 19:02:07,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:07,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1155542588, now seen corresponding path program 601 times [2020-01-16 19:02:07,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:07,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354615255] [2020-01-16 19:02:07,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:08,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 19:02:08,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354615255] [2020-01-16 19:02:08,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:08,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:08,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559254685] [2020-01-16 19:02:08,171 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:08,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:08,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:08,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:08,172 INFO L87 Difference]: Start difference. First operand 88 states and 225 transitions. Second operand 8 states. [2020-01-16 19:02:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:08,256 INFO L93 Difference]: Finished difference Result 155 states and 325 transitions. [2020-01-16 19:02:08,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:08,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:08,257 INFO L225 Difference]: With dead ends: 155 [2020-01-16 19:02:08,258 INFO L226 Difference]: Without dead ends: 141 [2020-01-16 19:02:08,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 19:02:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-01-16 19:02:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 91. [2020-01-16 19:02:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-01-16 19:02:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 231 transitions. [2020-01-16 19:02:08,261 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 231 transitions. Word has length 19 [2020-01-16 19:02:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:08,261 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 231 transitions. [2020-01-16 19:02:08,261 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 231 transitions. [2020-01-16 19:02:08,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:08,261 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:08,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 19:02:08,262 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 19:02:08,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:08,262 INFO L82 PathProgramCache]: Analyzing trace with hash 281207262, now seen corresponding path program 602 times [2020-01-16 19:02:08,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:08,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216726870] [2020-01-16 19:02:08,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:08,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 19:02:08,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216726870] [2020-01-16 19:02:08,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:08,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:08,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730908233] [2020-01-16 19:02:08,455 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:08,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:08,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:08,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:08,456 INFO L87 Difference]: Start difference. First operand 91 states and 231 transitions. Second operand 8 states. [2020-01-16 19:02:08,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:08,542 INFO L93 Difference]: Finished difference Result 151 states and 314 transitions. [2020-01-16 19:02:08,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:08,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:08,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:08,543 INFO L225 Difference]: With dead ends: 151 [2020-01-16 19:02:08,543 INFO L226 Difference]: Without dead ends: 139 [2020-01-16 19:02:08,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 19:02:08,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-01-16 19:02:08,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-01-16 19:02:08,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 19:02:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 227 transitions. [2020-01-16 19:02:08,546 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 227 transitions. Word has length 19 [2020-01-16 19:02:08,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:08,546 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 227 transitions. [2020-01-16 19:02:08,546 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:08,546 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 227 transitions. [2020-01-16 19:02:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:08,546 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:08,546 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:08,546 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 19:02:08,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:08,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1978402594, now seen corresponding path program 603 times [2020-01-16 19:02:08,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:08,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819424374] [2020-01-16 19:02:08,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:08,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819424374] [2020-01-16 19:02:08,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:08,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:08,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12255827] [2020-01-16 19:02:08,761 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:08,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:08,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:08,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:08,762 INFO L87 Difference]: Start difference. First operand 89 states and 227 transitions. Second operand 8 states. [2020-01-16 19:02:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:08,846 INFO L93 Difference]: Finished difference Result 155 states and 324 transitions. [2020-01-16 19:02:08,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:08,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:08,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:08,847 INFO L225 Difference]: With dead ends: 155 [2020-01-16 19:02:08,847 INFO L226 Difference]: Without dead ends: 141 [2020-01-16 19:02:08,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-01-16 19:02:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 91. [2020-01-16 19:02:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-01-16 19:02:08,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 230 transitions. [2020-01-16 19:02:08,850 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 230 transitions. Word has length 19 [2020-01-16 19:02:08,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:08,850 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 230 transitions. [2020-01-16 19:02:08,850 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 230 transitions. [2020-01-16 19:02:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:08,851 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:08,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 19:02:08,851 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 19:02:08,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:08,851 INFO L82 PathProgramCache]: Analyzing trace with hash -858272764, now seen corresponding path program 604 times [2020-01-16 19:02:08,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:08,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712463978] [2020-01-16 19:02:08,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:09,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 19:02:09,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712463978] [2020-01-16 19:02:09,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:09,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:09,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873138440] [2020-01-16 19:02:09,055 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:09,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:09,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:09,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:09,055 INFO L87 Difference]: Start difference. First operand 91 states and 230 transitions. Second operand 8 states. [2020-01-16 19:02:09,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:09,123 INFO L93 Difference]: Finished difference Result 151 states and 313 transitions. [2020-01-16 19:02:09,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:09,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:09,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:09,124 INFO L225 Difference]: With dead ends: 151 [2020-01-16 19:02:09,124 INFO L226 Difference]: Without dead ends: 139 [2020-01-16 19:02:09,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 19:02:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-01-16 19:02:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-01-16 19:02:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 19:02:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 226 transitions. [2020-01-16 19:02:09,127 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 226 transitions. Word has length 19 [2020-01-16 19:02:09,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:09,127 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 226 transitions. [2020-01-16 19:02:09,127 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 226 transitions. [2020-01-16 19:02:09,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:09,127 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:09,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 19:02:09,127 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 19:02:09,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:09,128 INFO L82 PathProgramCache]: Analyzing trace with hash -80774848, now seen corresponding path program 605 times [2020-01-16 19:02:09,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:09,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360790777] [2020-01-16 19:02:09,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:09,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 19:02:09,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360790777] [2020-01-16 19:02:09,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:09,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:09,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513163691] [2020-01-16 19:02:09,333 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:09,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:09,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:09,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:09,333 INFO L87 Difference]: Start difference. First operand 89 states and 226 transitions. Second operand 8 states. [2020-01-16 19:02:09,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:09,416 INFO L93 Difference]: Finished difference Result 146 states and 302 transitions. [2020-01-16 19:02:09,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:09,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:09,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:09,417 INFO L225 Difference]: With dead ends: 146 [2020-01-16 19:02:09,417 INFO L226 Difference]: Without dead ends: 136 [2020-01-16 19:02:09,417 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-01-16 19:02:09,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 90. [2020-01-16 19:02:09,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 19:02:09,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 227 transitions. [2020-01-16 19:02:09,420 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 227 transitions. Word has length 19 [2020-01-16 19:02:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:09,420 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 227 transitions. [2020-01-16 19:02:09,421 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:09,421 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 227 transitions. [2020-01-16 19:02:09,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:09,421 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:09,421 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:09,421 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 19:02:09,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:09,421 INFO L82 PathProgramCache]: Analyzing trace with hash -320417186, now seen corresponding path program 606 times [2020-01-16 19:02:09,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:09,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033618228] [2020-01-16 19:02:09,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:09,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:09,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033618228] [2020-01-16 19:02:09,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:09,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:09,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227739397] [2020-01-16 19:02:09,634 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:09,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:09,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:09,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:09,635 INFO L87 Difference]: Start difference. First operand 90 states and 227 transitions. Second operand 8 states. [2020-01-16 19:02:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:09,700 INFO L93 Difference]: Finished difference Result 146 states and 301 transitions. [2020-01-16 19:02:09,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:09,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:09,701 INFO L225 Difference]: With dead ends: 146 [2020-01-16 19:02:09,701 INFO L226 Difference]: Without dead ends: 134 [2020-01-16 19:02: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 19:02:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-01-16 19:02:09,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 88. [2020-01-16 19:02:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 19:02:09,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 224 transitions. [2020-01-16 19:02:09,703 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 224 transitions. Word has length 19 [2020-01-16 19:02:09,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:09,704 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 224 transitions. [2020-01-16 19:02:09,704 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 224 transitions. [2020-01-16 19:02:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:09,704 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:09,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 19:02:09,704 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 19:02:09,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:09,704 INFO L82 PathProgramCache]: Analyzing trace with hash -455398370, now seen corresponding path program 607 times [2020-01-16 19:02:09,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:09,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390554089] [2020-01-16 19:02:09,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:09,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390554089] [2020-01-16 19:02:09,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:09,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:09,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504884552] [2020-01-16 19:02:09,887 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:09,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:09,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:09,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:09,888 INFO L87 Difference]: Start difference. First operand 88 states and 224 transitions. Second operand 8 states. [2020-01-16 19:02:09,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:09,971 INFO L93 Difference]: Finished difference Result 161 states and 343 transitions. [2020-01-16 19:02:09,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:09,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:09,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:09,972 INFO L225 Difference]: With dead ends: 161 [2020-01-16 19:02:09,972 INFO L226 Difference]: Without dead ends: 147 [2020-01-16 19:02:09,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 19:02:09,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-01-16 19:02:09,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 92. [2020-01-16 19:02:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-01-16 19:02:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 234 transitions. [2020-01-16 19:02:09,974 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 234 transitions. Word has length 19 [2020-01-16 19:02:09,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:09,974 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 234 transitions. [2020-01-16 19:02:09,974 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 234 transitions. [2020-01-16 19:02:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:09,975 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:09,975 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:09,975 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 19:02:09,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:09,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1329733696, now seen corresponding path program 608 times [2020-01-16 19:02:09,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:09,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721005733] [2020-01-16 19:02:09,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:10,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 19:02:10,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721005733] [2020-01-16 19:02:10,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:10,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:10,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298008204] [2020-01-16 19:02:10,163 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:10,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:10,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:10,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:10,163 INFO L87 Difference]: Start difference. First operand 92 states and 234 transitions. Second operand 8 states. [2020-01-16 19:02:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:10,247 INFO L93 Difference]: Finished difference Result 157 states and 332 transitions. [2020-01-16 19:02:10,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:10,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:10,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:10,248 INFO L225 Difference]: With dead ends: 157 [2020-01-16 19:02:10,248 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 19:02:10,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 19:02:10,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-01-16 19:02:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 19:02:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 229 transitions. [2020-01-16 19:02:10,252 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 229 transitions. Word has length 19 [2020-01-16 19:02:10,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:10,252 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 229 transitions. [2020-01-16 19:02:10,252 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 229 transitions. [2020-01-16 19:02:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:10,253 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:10,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 19:02:10,253 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 19:02:10,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:10,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1034006626, now seen corresponding path program 609 times [2020-01-16 19:02:10,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:10,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988443172] [2020-01-16 19:02:10,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:10,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988443172] [2020-01-16 19:02:10,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:10,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:10,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192331215] [2020-01-16 19:02:10,467 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:10,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:10,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:10,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:10,468 INFO L87 Difference]: Start difference. First operand 90 states and 229 transitions. Second operand 8 states. [2020-01-16 19:02:10,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:10,553 INFO L93 Difference]: Finished difference Result 165 states and 353 transitions. [2020-01-16 19:02:10,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:10,554 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:10,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:10,554 INFO L225 Difference]: With dead ends: 165 [2020-01-16 19:02:10,554 INFO L226 Difference]: Without dead ends: 151 [2020-01-16 19:02:10,555 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:10,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-01-16 19:02:10,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 94. [2020-01-16 19:02:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-01-16 19:02:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 237 transitions. [2020-01-16 19:02:10,557 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 237 transitions. Word has length 19 [2020-01-16 19:02:10,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:10,557 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 237 transitions. [2020-01-16 19:02:10,557 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:10,557 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 237 transitions. [2020-01-16 19:02:10,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:10,558 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:10,558 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:10,558 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 19:02:10,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:10,558 INFO L82 PathProgramCache]: Analyzing trace with hash 288709482, now seen corresponding path program 610 times [2020-01-16 19:02:10,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:10,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51604475] [2020-01-16 19:02:10,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:10,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 19:02:10,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51604475] [2020-01-16 19:02:10,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:10,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:10,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924796179] [2020-01-16 19:02:10,739 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:10,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:10,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:10,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:10,740 INFO L87 Difference]: Start difference. First operand 94 states and 237 transitions. Second operand 8 states. [2020-01-16 19:02:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:10,827 INFO L93 Difference]: Finished difference Result 163 states and 345 transitions. [2020-01-16 19:02:10,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:10,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:10,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:10,828 INFO L225 Difference]: With dead ends: 163 [2020-01-16 19:02:10,829 INFO L226 Difference]: Without dead ends: 147 [2020-01-16 19:02:10,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:10,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-01-16 19:02:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 90. [2020-01-16 19:02:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 19:02:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 227 transitions. [2020-01-16 19:02:10,832 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 227 transitions. Word has length 19 [2020-01-16 19:02:10,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:10,832 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 227 transitions. [2020-01-16 19:02:10,832 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 227 transitions. [2020-01-16 19:02:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:10,832 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:10,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 19:02:10,833 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 19:02:10,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:10,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1901188502, now seen corresponding path program 611 times [2020-01-16 19:02:10,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:10,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630063065] [2020-01-16 19:02:10,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:11,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 19:02:11,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630063065] [2020-01-16 19:02:11,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:11,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:11,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213296917] [2020-01-16 19:02:11,021 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:11,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:11,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:11,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:11,022 INFO L87 Difference]: Start difference. First operand 90 states and 227 transitions. Second operand 8 states. [2020-01-16 19:02:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:11,104 INFO L93 Difference]: Finished difference Result 155 states and 326 transitions. [2020-01-16 19:02:11,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:11,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:11,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:11,105 INFO L225 Difference]: With dead ends: 155 [2020-01-16 19:02:11,105 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 19:02:11,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 19:02:11,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 19:02:11,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 92. [2020-01-16 19:02:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-01-16 19:02:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 230 transitions. [2020-01-16 19:02:11,108 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 230 transitions. Word has length 19 [2020-01-16 19:02:11,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:11,108 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 230 transitions. [2020-01-16 19:02:11,108 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:11,108 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 230 transitions. [2020-01-16 19:02:11,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:11,109 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:11,109 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:11,109 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 19:02:11,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:11,109 INFO L82 PathProgramCache]: Analyzing trace with hash -190575194, now seen corresponding path program 612 times [2020-01-16 19:02:11,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:11,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595400446] [2020-01-16 19:02:11,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:11,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595400446] [2020-01-16 19:02:11,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:11,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:11,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994771961] [2020-01-16 19:02:11,297 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:11,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:11,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:11,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:11,297 INFO L87 Difference]: Start difference. First operand 92 states and 230 transitions. Second operand 8 states. [2020-01-16 19:02:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:11,381 INFO L93 Difference]: Finished difference Result 157 states and 329 transitions. [2020-01-16 19:02:11,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:11,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:11,382 INFO L225 Difference]: With dead ends: 157 [2020-01-16 19:02:11,383 INFO L226 Difference]: Without dead ends: 141 [2020-01-16 19:02:11,383 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-01-16 19:02:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 88. [2020-01-16 19:02:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 19:02:11,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 223 transitions. [2020-01-16 19:02:11,385 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 223 transitions. Word has length 19 [2020-01-16 19:02:11,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:11,385 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 223 transitions. [2020-01-16 19:02:11,385 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 223 transitions. [2020-01-16 19:02:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:11,386 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:11,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 19:02:11,386 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 19:02:11,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:11,386 INFO L82 PathProgramCache]: Analyzing trace with hash -884311006, now seen corresponding path program 613 times [2020-01-16 19:02:11,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:11,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382406751] [2020-01-16 19:02:11,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:11,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382406751] [2020-01-16 19:02:11,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:11,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:11,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020504867] [2020-01-16 19:02:11,571 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:11,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:11,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:11,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:11,572 INFO L87 Difference]: Start difference. First operand 88 states and 223 transitions. Second operand 8 states. [2020-01-16 19:02:11,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:11,652 INFO L93 Difference]: Finished difference Result 161 states and 342 transitions. [2020-01-16 19:02:11,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:11,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:11,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:11,653 INFO L225 Difference]: With dead ends: 161 [2020-01-16 19:02:11,654 INFO L226 Difference]: Without dead ends: 147 [2020-01-16 19:02:11,654 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:11,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-01-16 19:02:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 92. [2020-01-16 19:02:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-01-16 19:02:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 233 transitions. [2020-01-16 19:02:11,656 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 233 transitions. Word has length 19 [2020-01-16 19:02:11,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:11,656 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 233 transitions. [2020-01-16 19:02:11,656 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 233 transitions. [2020-01-16 19:02:11,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:11,657 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:11,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 19:02:11,657 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 19:02:11,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:11,657 INFO L82 PathProgramCache]: Analyzing trace with hash 235818824, now seen corresponding path program 614 times [2020-01-16 19:02:11,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:11,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80335969] [2020-01-16 19:02:11,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:11,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:11,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80335969] [2020-01-16 19:02:11,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:11,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:11,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939775845] [2020-01-16 19:02:11,843 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:11,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:11,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:11,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:11,843 INFO L87 Difference]: Start difference. First operand 92 states and 233 transitions. Second operand 8 states. [2020-01-16 19:02:11,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:11,905 INFO L93 Difference]: Finished difference Result 157 states and 331 transitions. [2020-01-16 19:02:11,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:11,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:11,906 INFO L225 Difference]: With dead ends: 157 [2020-01-16 19:02:11,906 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 19:02:11,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:11,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 19:02:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-01-16 19:02:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 19:02:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 228 transitions. [2020-01-16 19:02:11,908 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 228 transitions. Word has length 19 [2020-01-16 19:02:11,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:11,909 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 228 transitions. [2020-01-16 19:02:11,909 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:11,909 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 228 transitions. [2020-01-16 19:02:11,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:11,909 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:11,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 19:02:11,909 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 19:02:11,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:11,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1629013504, now seen corresponding path program 615 times [2020-01-16 19:02:11,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:11,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916132910] [2020-01-16 19:02:11,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:12,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 19:02:12,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916132910] [2020-01-16 19:02:12,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:12,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:12,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766051474] [2020-01-16 19:02:12,090 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:12,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:12,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:12,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:12,090 INFO L87 Difference]: Start difference. First operand 90 states and 228 transitions. Second operand 8 states. [2020-01-16 19:02:12,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:12,164 INFO L93 Difference]: Finished difference Result 165 states and 352 transitions. [2020-01-16 19:02:12,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:12,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:12,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:12,165 INFO L225 Difference]: With dead ends: 165 [2020-01-16 19:02:12,166 INFO L226 Difference]: Without dead ends: 151 [2020-01-16 19:02:12,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 19:02:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-01-16 19:02:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 94. [2020-01-16 19:02:12,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-01-16 19:02:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 236 transitions. [2020-01-16 19:02:12,168 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 236 transitions. Word has length 19 [2020-01-16 19:02:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:12,168 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 236 transitions. [2020-01-16 19:02:12,168 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 236 transitions. [2020-01-16 19:02:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:12,169 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:12,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 19:02:12,169 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 19:02:12,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:12,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1920656648, now seen corresponding path program 616 times [2020-01-16 19:02:12,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:12,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832427180] [2020-01-16 19:02:12,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:12,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 19:02:12,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832427180] [2020-01-16 19:02:12,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:12,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:12,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698291820] [2020-01-16 19:02:12,351 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:12,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:12,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:12,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:12,351 INFO L87 Difference]: Start difference. First operand 94 states and 236 transitions. Second operand 8 states. [2020-01-16 19:02:12,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:12,434 INFO L93 Difference]: Finished difference Result 163 states and 344 transitions. [2020-01-16 19:02:12,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:12,435 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:12,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:12,435 INFO L225 Difference]: With dead ends: 163 [2020-01-16 19:02:12,435 INFO L226 Difference]: Without dead ends: 147 [2020-01-16 19:02:12,436 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:12,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-01-16 19:02:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 90. [2020-01-16 19:02:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 19:02:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 226 transitions. [2020-01-16 19:02:12,438 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 226 transitions. Word has length 19 [2020-01-16 19:02:12,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:12,438 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 226 transitions. [2020-01-16 19:02:12,438 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:12,438 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 226 transitions. [2020-01-16 19:02:12,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:12,439 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:12,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 19:02:12,439 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 19:02:12,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:12,439 INFO L82 PathProgramCache]: Analyzing trace with hash -299410978, now seen corresponding path program 617 times [2020-01-16 19:02:12,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:12,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763820237] [2020-01-16 19:02:12,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:12,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 19:02:12,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763820237] [2020-01-16 19:02:12,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:12,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:12,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502833447] [2020-01-16 19:02:12,631 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:12,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:12,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:12,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:12,632 INFO L87 Difference]: Start difference. First operand 90 states and 226 transitions. Second operand 8 states. [2020-01-16 19:02:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:12,697 INFO L93 Difference]: Finished difference Result 155 states and 325 transitions. [2020-01-16 19:02:12,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:12,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:12,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:12,698 INFO L225 Difference]: With dead ends: 155 [2020-01-16 19:02:12,698 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 19:02:12,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:12,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 19:02:12,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 92. [2020-01-16 19:02:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-01-16 19:02:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 229 transitions. [2020-01-16 19:02:12,700 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 229 transitions. Word has length 19 [2020-01-16 19:02:12,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:12,700 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 229 transitions. [2020-01-16 19:02:12,700 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:12,700 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 229 transitions. [2020-01-16 19:02:12,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:12,701 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:12,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 19:02:12,701 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 19:02:12,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:12,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1154717632, now seen corresponding path program 618 times [2020-01-16 19:02:12,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:12,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294405974] [2020-01-16 19:02:12,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:12,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294405974] [2020-01-16 19:02:12,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:12,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:12,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541929954] [2020-01-16 19:02:12,886 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:12,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:12,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:12,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:12,887 INFO L87 Difference]: Start difference. First operand 92 states and 229 transitions. Second operand 8 states. [2020-01-16 19:02:12,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:12,974 INFO L93 Difference]: Finished difference Result 157 states and 328 transitions. [2020-01-16 19:02:12,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:12,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:12,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:12,975 INFO L225 Difference]: With dead ends: 157 [2020-01-16 19:02:12,975 INFO L226 Difference]: Without dead ends: 141 [2020-01-16 19:02:12,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 19:02:12,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-01-16 19:02:12,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 88. [2020-01-16 19:02:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 19:02:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 222 transitions. [2020-01-16 19:02:12,978 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 222 transitions. Word has length 19 [2020-01-16 19:02:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:12,979 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 222 transitions. [2020-01-16 19:02:12,979 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:12,979 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 222 transitions. [2020-01-16 19:02:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:12,979 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:12,979 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:12,980 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 19:02:12,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash 506970474, now seen corresponding path program 619 times [2020-01-16 19:02:12,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:12,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929192478] [2020-01-16 19:02:12,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:13,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 19:02:13,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929192478] [2020-01-16 19:02:13,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:13,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:13,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554265745] [2020-01-16 19:02:13,189 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:13,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:13,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:13,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:13,189 INFO L87 Difference]: Start difference. First operand 88 states and 222 transitions. Second operand 8 states. [2020-01-16 19:02:13,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:13,259 INFO L93 Difference]: Finished difference Result 144 states and 297 transitions. [2020-01-16 19:02:13,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:13,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:13,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:13,259 INFO L225 Difference]: With dead ends: 144 [2020-01-16 19:02:13,259 INFO L226 Difference]: Without dead ends: 134 [2020-01-16 19:02:13,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 19:02:13,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-01-16 19:02:13,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 90. [2020-01-16 19:02:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 19:02:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 226 transitions. [2020-01-16 19:02:13,261 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 226 transitions. Word has length 19 [2020-01-16 19:02:13,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:13,262 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 226 transitions. [2020-01-16 19:02:13,262 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:13,262 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 226 transitions. [2020-01-16 19:02:13,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:13,262 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:13,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 19:02:13,263 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 19:02:13,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:13,263 INFO L82 PathProgramCache]: Analyzing trace with hash 267328136, now seen corresponding path program 620 times [2020-01-16 19:02:13,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:13,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199477011] [2020-01-16 19:02:13,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:13,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199477011] [2020-01-16 19:02:13,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:13,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:13,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870893237] [2020-01-16 19:02:13,480 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:13,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:13,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:13,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:13,481 INFO L87 Difference]: Start difference. First operand 90 states and 226 transitions. Second operand 8 states. [2020-01-16 19:02:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:13,541 INFO L93 Difference]: Finished difference Result 144 states and 296 transitions. [2020-01-16 19:02:13,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:13,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:13,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:13,542 INFO L225 Difference]: With dead ends: 144 [2020-01-16 19:02:13,542 INFO L226 Difference]: Without dead ends: 133 [2020-01-16 19:02:13,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 19:02:13,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-01-16 19:02:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 89. [2020-01-16 19:02:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 19:02:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 224 transitions. [2020-01-16 19:02:13,545 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 224 transitions. Word has length 19 [2020-01-16 19:02:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:13,545 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 224 transitions. [2020-01-16 19:02:13,545 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 224 transitions. [2020-01-16 19:02:13,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:13,546 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:13,546 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:13,546 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 19:02:13,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:13,547 INFO L82 PathProgramCache]: Analyzing trace with hash -237732024, now seen corresponding path program 621 times [2020-01-16 19:02:13,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:13,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151857316] [2020-01-16 19:02:13,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:13,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 19:02:13,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151857316] [2020-01-16 19:02:13,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:13,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:13,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941719562] [2020-01-16 19:02:13,754 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:13,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:13,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:13,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:13,755 INFO L87 Difference]: Start difference. First operand 89 states and 224 transitions. Second operand 8 states. [2020-01-16 19:02:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:13,834 INFO L93 Difference]: Finished difference Result 147 states and 304 transitions. [2020-01-16 19:02:13,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:13,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:13,835 INFO L225 Difference]: With dead ends: 147 [2020-01-16 19:02:13,836 INFO L226 Difference]: Without dead ends: 137 [2020-01-16 19:02:13,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 19:02:13,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-01-16 19:02:13,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 91. [2020-01-16 19:02:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-01-16 19:02:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 227 transitions. [2020-01-16 19:02:13,838 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 227 transitions. Word has length 19 [2020-01-16 19:02:13,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:13,838 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 227 transitions. [2020-01-16 19:02:13,838 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:13,838 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 227 transitions. [2020-01-16 19:02:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:13,839 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:13,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 19:02:13,839 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 19:02:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:13,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1472881284, now seen corresponding path program 622 times [2020-01-16 19:02:13,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:13,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600969039] [2020-01-16 19:02:13,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:14,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600969039] [2020-01-16 19:02:14,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:14,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:14,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640521660] [2020-01-16 19:02:14,047 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:14,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:14,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:14,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:14,048 INFO L87 Difference]: Start difference. First operand 91 states and 227 transitions. Second operand 8 states. [2020-01-16 19:02:14,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:14,133 INFO L93 Difference]: Finished difference Result 149 states and 307 transitions. [2020-01-16 19:02:14,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:14,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:14,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:14,134 INFO L225 Difference]: With dead ends: 149 [2020-01-16 19:02:14,134 INFO L226 Difference]: Without dead ends: 135 [2020-01-16 19:02:14,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 19:02:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-01-16 19:02:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 89. [2020-01-16 19:02:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 19:02:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 223 transitions. [2020-01-16 19:02:14,137 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 223 transitions. Word has length 19 [2020-01-16 19:02:14,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:14,137 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 223 transitions. [2020-01-16 19:02:14,137 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 223 transitions. [2020-01-16 19:02:14,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:14,137 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:14,137 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:14,138 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 19:02:14,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:14,138 INFO L82 PathProgramCache]: Analyzing trace with hash -805757244, now seen corresponding path program 623 times [2020-01-16 19:02:14,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:14,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090140516] [2020-01-16 19:02:14,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:14,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090140516] [2020-01-16 19:02:14,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:14,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:14,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434808662] [2020-01-16 19:02:14,353 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:14,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:14,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:14,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:14,354 INFO L87 Difference]: Start difference. First operand 89 states and 223 transitions. Second operand 8 states. [2020-01-16 19:02:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:14,418 INFO L93 Difference]: Finished difference Result 147 states and 303 transitions. [2020-01-16 19:02:14,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:14,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:14,419 INFO L225 Difference]: With dead ends: 147 [2020-01-16 19:02:14,419 INFO L226 Difference]: Without dead ends: 137 [2020-01-16 19:02:14,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 19:02:14,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-01-16 19:02:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 91. [2020-01-16 19:02:14,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-01-16 19:02:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 226 transitions. [2020-01-16 19:02:14,422 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 226 transitions. Word has length 19 [2020-01-16 19:02:14,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:14,422 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 226 transitions. [2020-01-16 19:02:14,422 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 226 transitions. [2020-01-16 19:02:14,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:14,422 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:14,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 19:02:14,423 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 19:02:14,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:14,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1661063898, now seen corresponding path program 624 times [2020-01-16 19:02:14,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:14,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494905651] [2020-01-16 19:02:14,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:14,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 19:02:14,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494905651] [2020-01-16 19:02:14,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:14,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:14,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690595519] [2020-01-16 19:02:14,632 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:14,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:14,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:14,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:14,632 INFO L87 Difference]: Start difference. First operand 91 states and 226 transitions. Second operand 8 states. [2020-01-16 19:02:14,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:14,715 INFO L93 Difference]: Finished difference Result 149 states and 306 transitions. [2020-01-16 19:02:14,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:14,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:14,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:14,716 INFO L225 Difference]: With dead ends: 149 [2020-01-16 19:02:14,716 INFO L226 Difference]: Without dead ends: 133 [2020-01-16 19:02:14,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-01-16 19:02:14,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 87. [2020-01-16 19:02:14,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 19:02:14,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 220 transitions. [2020-01-16 19:02:14,719 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 220 transitions. Word has length 19 [2020-01-16 19:02:14,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:14,719 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 220 transitions. [2020-01-16 19:02:14,719 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 220 transitions. [2020-01-16 19:02:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:14,720 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:14,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 19:02:14,720 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 19:02:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:14,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1213390630, now seen corresponding path program 625 times [2020-01-16 19:02:14,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:14,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641142502] [2020-01-16 19:02:14,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:14,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641142502] [2020-01-16 19:02:14,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:14,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:14,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671812293] [2020-01-16 19:02:14,907 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:14,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:14,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:14,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:14,908 INFO L87 Difference]: Start difference. First operand 87 states and 220 transitions. Second operand 8 states. [2020-01-16 19:02:14,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:14,991 INFO L93 Difference]: Finished difference Result 153 states and 317 transitions. [2020-01-16 19:02:14,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:14,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:14,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:14,992 INFO L225 Difference]: With dead ends: 153 [2020-01-16 19:02:14,992 INFO L226 Difference]: Without dead ends: 139 [2020-01-16 19:02:14,992 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:14,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-01-16 19:02:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-01-16 19:02:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 19:02:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 223 transitions. [2020-01-16 19:02:14,995 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 223 transitions. Word has length 19 [2020-01-16 19:02:14,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:14,995 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 223 transitions. [2020-01-16 19:02:14,995 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 223 transitions. [2020-01-16 19:02:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:14,996 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:14,996 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:14,996 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 19:02:14,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:14,996 INFO L82 PathProgramCache]: Analyzing trace with hash -2087725956, now seen corresponding path program 626 times [2020-01-16 19:02:14,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:14,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038001497] [2020-01-16 19:02:14,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02: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 19:02:15,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038001497] [2020-01-16 19:02:15,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:15,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:15,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255774106] [2020-01-16 19:02:15,185 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:15,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:15,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:15,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:15,186 INFO L87 Difference]: Start difference. First operand 89 states and 223 transitions. Second operand 8 states. [2020-01-16 19:02:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:15,268 INFO L93 Difference]: Finished difference Result 149 states and 306 transitions. [2020-01-16 19:02:15,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:15,269 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:15,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:15,269 INFO L225 Difference]: With dead ends: 149 [2020-01-16 19:02:15,269 INFO L226 Difference]: Without dead ends: 137 [2020-01-16 19:02:15,270 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:15,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-01-16 19:02:15,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 87. [2020-01-16 19:02:15,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 19:02:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 219 transitions. [2020-01-16 19:02:15,272 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 219 transitions. Word has length 19 [2020-01-16 19:02:15,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:15,273 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 219 transitions. [2020-01-16 19:02:15,273 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 219 transitions. [2020-01-16 19:02:15,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:15,273 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:15,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 19:02:15,273 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 19:02:15,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:15,274 INFO L82 PathProgramCache]: Analyzing trace with hash -52368516, now seen corresponding path program 627 times [2020-01-16 19:02:15,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:15,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372180636] [2020-01-16 19:02:15,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:15,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372180636] [2020-01-16 19:02:15,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:15,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:15,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954048298] [2020-01-16 19:02:15,468 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:15,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:15,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:15,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:15,469 INFO L87 Difference]: Start difference. First operand 87 states and 219 transitions. Second operand 8 states. [2020-01-16 19:02:15,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:15,542 INFO L93 Difference]: Finished difference Result 153 states and 316 transitions. [2020-01-16 19:02:15,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:15,543 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:15,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:15,543 INFO L225 Difference]: With dead ends: 153 [2020-01-16 19:02:15,543 INFO L226 Difference]: Without dead ends: 139 [2020-01-16 19:02: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 19:02:15,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-01-16 19:02:15,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 89. [2020-01-16 19:02:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 19:02:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 222 transitions. [2020-01-16 19:02:15,546 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 222 transitions. Word has length 19 [2020-01-16 19:02:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:15,546 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 222 transitions. [2020-01-16 19:02:15,546 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:15,547 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 222 transitions. [2020-01-16 19:02:15,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:15,547 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:15,547 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:15,547 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 19:02:15,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:15,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1067761314, now seen corresponding path program 628 times [2020-01-16 19:02:15,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:15,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507821679] [2020-01-16 19:02:15,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:15,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 19:02:15,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507821679] [2020-01-16 19:02:15,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:15,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:15,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611089376] [2020-01-16 19:02:15,740 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:15,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:15,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:15,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:15,740 INFO L87 Difference]: Start difference. First operand 89 states and 222 transitions. Second operand 8 states. [2020-01-16 19:02:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:15,806 INFO L93 Difference]: Finished difference Result 149 states and 305 transitions. [2020-01-16 19:02:15,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:15,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:15,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:15,807 INFO L225 Difference]: With dead ends: 149 [2020-01-16 19:02:15,807 INFO L226 Difference]: Without dead ends: 137 [2020-01-16 19:02:15,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 19:02:15,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-01-16 19:02:15,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 87. [2020-01-16 19:02:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 19:02:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 218 transitions. [2020-01-16 19:02:15,809 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 218 transitions. Word has length 19 [2020-01-16 19:02:15,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:15,810 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 218 transitions. [2020-01-16 19:02:15,810 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:15,810 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 218 transitions. [2020-01-16 19:02:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:15,810 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:15,810 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:15,810 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 19:02:15,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:15,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1845259230, now seen corresponding path program 629 times [2020-01-16 19:02:15,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:15,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15390645] [2020-01-16 19:02:15,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:16,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15390645] [2020-01-16 19:02:16,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:16,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:16,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338550616] [2020-01-16 19:02:16,016 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:16,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:16,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:16,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:16,016 INFO L87 Difference]: Start difference. First operand 87 states and 218 transitions. Second operand 8 states. [2020-01-16 19:02:16,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:16,097 INFO L93 Difference]: Finished difference Result 144 states and 294 transitions. [2020-01-16 19:02:16,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:16,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:16,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:16,098 INFO L225 Difference]: With dead ends: 144 [2020-01-16 19:02:16,098 INFO L226 Difference]: Without dead ends: 134 [2020-01-16 19:02:16,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-01-16 19:02:16,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 88. [2020-01-16 19:02:16,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 19:02:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 219 transitions. [2020-01-16 19:02:16,101 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 219 transitions. Word has length 19 [2020-01-16 19:02:16,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:16,101 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 219 transitions. [2020-01-16 19:02:16,101 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 219 transitions. [2020-01-16 19:02:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:16,102 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:16,102 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:16,102 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 19:02:16,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:16,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1605616892, now seen corresponding path program 630 times [2020-01-16 19:02:16,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:16,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511870340] [2020-01-16 19:02:16,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:16,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 19:02:16,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511870340] [2020-01-16 19:02:16,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:16,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:16,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318152809] [2020-01-16 19:02:16,309 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:16,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:16,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:16,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:16,309 INFO L87 Difference]: Start difference. First operand 88 states and 219 transitions. Second operand 8 states. [2020-01-16 19:02:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:16,375 INFO L93 Difference]: Finished difference Result 144 states and 293 transitions. [2020-01-16 19:02:16,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:16,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:16,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:16,376 INFO L225 Difference]: With dead ends: 144 [2020-01-16 19:02:16,377 INFO L226 Difference]: Without dead ends: 132 [2020-01-16 19:02:16,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:16,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-01-16 19:02:16,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 86. [2020-01-16 19:02:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-01-16 19:02:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 216 transitions. [2020-01-16 19:02:16,379 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 216 transitions. Word has length 19 [2020-01-16 19:02:16,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:16,380 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 216 transitions. [2020-01-16 19:02:16,380 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:16,380 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 216 transitions. [2020-01-16 19:02:16,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:16,380 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:16,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 19:02:16,380 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 19:02:16,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:16,380 INFO L82 PathProgramCache]: Analyzing trace with hash -119299042, now seen corresponding path program 631 times [2020-01-16 19:02:16,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:16,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955688730] [2020-01-16 19:02:16,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:16,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:16,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955688730] [2020-01-16 19:02:16,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:16,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:16,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927394940] [2020-01-16 19:02:16,562 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:16,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:16,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:16,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:16,562 INFO L87 Difference]: Start difference. First operand 86 states and 216 transitions. Second operand 8 states. [2020-01-16 19:02:16,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:16,641 INFO L93 Difference]: Finished difference Result 159 states and 335 transitions. [2020-01-16 19:02:16,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:16,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:16,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:16,641 INFO L225 Difference]: With dead ends: 159 [2020-01-16 19:02:16,641 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 19:02:16,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 19:02:16,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-01-16 19:02:16,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 19:02:16,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 226 transitions. [2020-01-16 19:02:16,643 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 226 transitions. Word has length 19 [2020-01-16 19:02:16,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:16,643 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 226 transitions. [2020-01-16 19:02:16,643 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:16,644 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 226 transitions. [2020-01-16 19:02:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:16,644 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:16,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 19:02:16,644 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 19:02:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash -993634368, now seen corresponding path program 632 times [2020-01-16 19:02:16,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:16,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710112289] [2020-01-16 19:02:16,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:16,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710112289] [2020-01-16 19:02:16,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:16,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:16,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591450538] [2020-01-16 19:02:16,820 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:16,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:16,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:16,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:16,821 INFO L87 Difference]: Start difference. First operand 90 states and 226 transitions. Second operand 8 states. [2020-01-16 19:02:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:16,899 INFO L93 Difference]: Finished difference Result 155 states and 324 transitions. [2020-01-16 19:02:16,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:16,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:16,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:16,900 INFO L225 Difference]: With dead ends: 155 [2020-01-16 19:02:16,900 INFO L226 Difference]: Without dead ends: 143 [2020-01-16 19:02:16,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 19:02:16,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-01-16 19:02:16,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 88. [2020-01-16 19:02:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 19:02:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 221 transitions. [2020-01-16 19:02:16,903 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 221 transitions. Word has length 19 [2020-01-16 19:02:16,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:16,904 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 221 transitions. [2020-01-16 19:02:16,904 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:16,904 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 221 transitions. [2020-01-16 19:02:16,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:16,904 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:16,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 19:02:16,904 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 19:02:16,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:16,905 INFO L82 PathProgramCache]: Analyzing trace with hash -579720990, now seen corresponding path program 633 times [2020-01-16 19:02:16,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:16,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816654462] [2020-01-16 19:02:16,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:17,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816654462] [2020-01-16 19:02:17,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:17,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:17,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470903405] [2020-01-16 19:02:17,096 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:17,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:17,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:17,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:17,096 INFO L87 Difference]: Start difference. First operand 88 states and 221 transitions. Second operand 8 states. [2020-01-16 19:02:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:17,181 INFO L93 Difference]: Finished difference Result 159 states and 338 transitions. [2020-01-16 19:02:17,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:17,181 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:17,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:17,182 INFO L225 Difference]: With dead ends: 159 [2020-01-16 19:02:17,182 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 19:02:17,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:17,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 19:02:17,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2020-01-16 19:02:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 19:02:17,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 231 transitions. [2020-01-16 19:02:17,185 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 231 transitions. Word has length 19 [2020-01-16 19:02:17,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:17,185 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 231 transitions. [2020-01-16 19:02:17,185 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 231 transitions. [2020-01-16 19:02:17,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:17,186 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:17,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 19:02:17,186 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 19:02:17,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:17,186 INFO L82 PathProgramCache]: Analyzing trace with hash 389163050, now seen corresponding path program 634 times [2020-01-16 19:02:17,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:17,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513715507] [2020-01-16 19:02:17,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:17,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 19:02:17,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513715507] [2020-01-16 19:02:17,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:17,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:17,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196261329] [2020-01-16 19:02:17,376 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:17,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:17,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:17,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:17,377 INFO L87 Difference]: Start difference. First operand 93 states and 231 transitions. Second operand 8 states. [2020-01-16 19:02:17,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:17,462 INFO L93 Difference]: Finished difference Result 149 states and 322 transitions. [2020-01-16 19:02:17,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:17,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:17,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:17,463 INFO L225 Difference]: With dead ends: 149 [2020-01-16 19:02:17,464 INFO L226 Difference]: Without dead ends: 131 [2020-01-16 19:02:17,464 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-01-16 19:02:17,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2020-01-16 19:02:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 19:02:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 219 transitions. [2020-01-16 19:02:17,466 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 219 transitions. Word has length 19 [2020-01-16 19:02:17,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:17,466 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 219 transitions. [2020-01-16 19:02:17,466 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:17,466 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 219 transitions. [2020-01-16 19:02:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:17,467 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:17,467 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:17,467 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 19:02:17,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:17,467 INFO L82 PathProgramCache]: Analyzing trace with hash 780051178, now seen corresponding path program 635 times [2020-01-16 19:02:17,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:17,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826985225] [2020-01-16 19:02:17,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:17,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826985225] [2020-01-16 19:02:17,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:17,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:17,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067472926] [2020-01-16 19:02:17,658 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:17,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:17,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:17,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:17,659 INFO L87 Difference]: Start difference. First operand 88 states and 219 transitions. Second operand 8 states. [2020-01-16 19:02:17,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:17,745 INFO L93 Difference]: Finished difference Result 152 states and 317 transitions. [2020-01-16 19:02:17,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:17,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:17,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:17,746 INFO L225 Difference]: With dead ends: 152 [2020-01-16 19:02:17,746 INFO L226 Difference]: Without dead ends: 142 [2020-01-16 19:02:17,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 19:02:17,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-01-16 19:02:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 90. [2020-01-16 19:02:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 19:02:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 222 transitions. [2020-01-16 19:02:17,749 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 222 transitions. Word has length 19 [2020-01-16 19:02:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:17,750 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 222 transitions. [2020-01-16 19:02:17,750 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 222 transitions. [2020-01-16 19:02:17,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:17,750 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:17,750 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:17,750 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 19:02:17,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:17,751 INFO L82 PathProgramCache]: Analyzing trace with hash -948996156, now seen corresponding path program 636 times [2020-01-16 19:02:17,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:17,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895894907] [2020-01-16 19:02:17,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:17,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 19:02:17,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895894907] [2020-01-16 19:02:17,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:17,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:17,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059460147] [2020-01-16 19:02:17,930 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:17,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:17,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:17,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:17,931 INFO L87 Difference]: Start difference. First operand 90 states and 222 transitions. Second operand 8 states. [2020-01-16 19:02:18,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:18,023 INFO L93 Difference]: Finished difference Result 146 states and 313 transitions. [2020-01-16 19:02:18,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:18,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:18,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:18,024 INFO L225 Difference]: With dead ends: 146 [2020-01-16 19:02:18,025 INFO L226 Difference]: Without dead ends: 129 [2020-01-16 19:02:18,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:18,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-01-16 19:02:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 86. [2020-01-16 19:02:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-01-16 19:02:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 215 transitions. [2020-01-16 19:02:18,028 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 215 transitions. Word has length 19 [2020-01-16 19:02:18,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:18,028 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 215 transitions. [2020-01-16 19:02:18,028 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:18,028 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 215 transitions. [2020-01-16 19:02:18,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:18,028 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:18,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:18,029 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 19:02:18,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:18,029 INFO L82 PathProgramCache]: Analyzing trace with hash -558714782, now seen corresponding path program 637 times [2020-01-16 19:02:18,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:18,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252691825] [2020-01-16 19:02:18,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:18,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 19:02:18,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252691825] [2020-01-16 19:02:18,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:18,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:18,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546253474] [2020-01-16 19:02:18,223 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:18,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:18,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:18,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:18,223 INFO L87 Difference]: Start difference. First operand 86 states and 215 transitions. Second operand 8 states. [2020-01-16 19:02:18,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:18,302 INFO L93 Difference]: Finished difference Result 159 states and 334 transitions. [2020-01-16 19:02:18,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:18,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:18,303 INFO L225 Difference]: With dead ends: 159 [2020-01-16 19:02:18,303 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 19:02:18,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 19:02:18,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 19:02:18,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2020-01-16 19:02:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 19:02:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 225 transitions. [2020-01-16 19:02:18,306 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 225 transitions. Word has length 19 [2020-01-16 19:02:18,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:18,306 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 225 transitions. [2020-01-16 19:02:18,306 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:18,306 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 225 transitions. [2020-01-16 19:02:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:18,306 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:18,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 19:02:18,306 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 19:02:18,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:18,306 INFO L82 PathProgramCache]: Analyzing trace with hash 561415048, now seen corresponding path program 638 times [2020-01-16 19:02:18,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:18,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539235822] [2020-01-16 19:02:18,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:18,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539235822] [2020-01-16 19:02:18,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:18,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:18,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617208024] [2020-01-16 19:02:18,504 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:18,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:18,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:18,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:18,505 INFO L87 Difference]: Start difference. First operand 90 states and 225 transitions. Second operand 8 states. [2020-01-16 19:02:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:18,563 INFO L93 Difference]: Finished difference Result 155 states and 323 transitions. [2020-01-16 19:02:18,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:18,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:18,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:18,564 INFO L225 Difference]: With dead ends: 155 [2020-01-16 19:02:18,564 INFO L226 Difference]: Without dead ends: 143 [2020-01-16 19:02:18,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:18,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-01-16 19:02:18,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 88. [2020-01-16 19:02:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 19:02:18,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 220 transitions. [2020-01-16 19:02:18,567 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 220 transitions. Word has length 19 [2020-01-16 19:02:18,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:18,567 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 220 transitions. [2020-01-16 19:02:18,567 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 220 transitions. [2020-01-16 19:02:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:18,568 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:18,568 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:18,568 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 19:02:18,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:18,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1631800162, now seen corresponding path program 639 times [2020-01-16 19:02:18,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:18,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774790064] [2020-01-16 19:02:18,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:18,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 19:02:18,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774790064] [2020-01-16 19:02:18,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:18,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:18,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219539175] [2020-01-16 19:02:18,762 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:18,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:18,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:18,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:18,762 INFO L87 Difference]: Start difference. First operand 88 states and 220 transitions. Second operand 8 states. [2020-01-16 19:02:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:18,845 INFO L93 Difference]: Finished difference Result 159 states and 337 transitions. [2020-01-16 19:02:18,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:18,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:18,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:18,846 INFO L225 Difference]: With dead ends: 159 [2020-01-16 19:02:18,847 INFO L226 Difference]: Without dead ends: 145 [2020-01-16 19:02:18,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-01-16 19:02:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2020-01-16 19:02:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-01-16 19:02:18,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 230 transitions. [2020-01-16 19:02:18,849 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 230 transitions. Word has length 19 [2020-01-16 19:02:18,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:18,850 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 230 transitions. [2020-01-16 19:02:18,850 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:18,850 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 230 transitions. [2020-01-16 19:02:18,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:18,850 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:18,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 19:02:18,851 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 19:02:18,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:18,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2021110216, now seen corresponding path program 640 times [2020-01-16 19:02:18,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:18,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405711186] [2020-01-16 19:02:18,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:19,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 19:02:19,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405711186] [2020-01-16 19:02:19,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:19,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:19,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896274852] [2020-01-16 19:02:19,045 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:19,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:19,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:19,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:19,046 INFO L87 Difference]: Start difference. First operand 93 states and 230 transitions. Second operand 8 states. [2020-01-16 19:02:19,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:19,129 INFO L93 Difference]: Finished difference Result 149 states and 321 transitions. [2020-01-16 19:02:19,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:19,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:19,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:19,130 INFO L225 Difference]: With dead ends: 149 [2020-01-16 19:02:19,131 INFO L226 Difference]: Without dead ends: 131 [2020-01-16 19:02:19,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 19:02:19,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-01-16 19:02:19,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2020-01-16 19:02:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 19:02:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 218 transitions. [2020-01-16 19:02:19,133 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 218 transitions. Word has length 19 [2020-01-16 19:02:19,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:19,133 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 218 transitions. [2020-01-16 19:02:19,133 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 218 transitions. [2020-01-16 19:02:19,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:19,134 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:19,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 19:02:19,134 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 19:02:19,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:19,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1637126204, now seen corresponding path program 641 times [2020-01-16 19:02:19,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:19,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856356622] [2020-01-16 19:02:19,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:19,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856356622] [2020-01-16 19:02:19,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:19,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:19,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930149124] [2020-01-16 19:02:19,336 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:19,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:19,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:19,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:19,336 INFO L87 Difference]: Start difference. First operand 88 states and 218 transitions. Second operand 8 states. [2020-01-16 19:02:19,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:19,403 INFO L93 Difference]: Finished difference Result 152 states and 316 transitions. [2020-01-16 19:02:19,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:19,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:19,404 INFO L225 Difference]: With dead ends: 152 [2020-01-16 19:02:19,404 INFO L226 Difference]: Without dead ends: 142 [2020-01-16 19:02:19,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:19,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-01-16 19:02:19,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 90. [2020-01-16 19:02:19,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-01-16 19:02:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 221 transitions. [2020-01-16 19:02:19,407 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 221 transitions. Word has length 19 [2020-01-16 19:02:19,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:19,407 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 221 transitions. [2020-01-16 19:02:19,407 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 221 transitions. [2020-01-16 19:02:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:19,408 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:19,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 19:02:19,408 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 19:02:19,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:19,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1168436096, now seen corresponding path program 642 times [2020-01-16 19:02:19,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:19,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601978236] [2020-01-16 19:02:19,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:19,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601978236] [2020-01-16 19:02:19,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:19,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:19,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425849347] [2020-01-16 19:02:19,598 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:19,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:19,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:19,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:19,599 INFO L87 Difference]: Start difference. First operand 90 states and 221 transitions. Second operand 8 states. [2020-01-16 19:02:19,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:19,687 INFO L93 Difference]: Finished difference Result 146 states and 312 transitions. [2020-01-16 19:02:19,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:19,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:19,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:19,688 INFO L225 Difference]: With dead ends: 146 [2020-01-16 19:02:19,689 INFO L226 Difference]: Without dead ends: 129 [2020-01-16 19:02:19,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 19:02:19,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-01-16 19:02:19,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 86. [2020-01-16 19:02:19,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-01-16 19:02:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 214 transitions. [2020-01-16 19:02:19,691 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 214 transitions. Word has length 19 [2020-01-16 19:02:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:19,692 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 214 transitions. [2020-01-16 19:02:19,692 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 214 transitions. [2020-01-16 19:02:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:19,692 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:19,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:19,693 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 19:02:19,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:19,693 INFO L82 PathProgramCache]: Analyzing trace with hash 832566698, now seen corresponding path program 643 times [2020-01-16 19:02:19,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:19,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299817572] [2020-01-16 19:02:19,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:19,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:19,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299817572] [2020-01-16 19:02:19,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:19,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:19,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684185693] [2020-01-16 19:02:19,900 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:19,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:19,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:19,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:19,901 INFO L87 Difference]: Start difference. First operand 86 states and 214 transitions. Second operand 8 states. [2020-01-16 19:02:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:19,983 INFO L93 Difference]: Finished difference Result 142 states and 289 transitions. [2020-01-16 19:02:19,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:19,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:19,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:19,984 INFO L225 Difference]: With dead ends: 142 [2020-01-16 19:02:19,985 INFO L226 Difference]: Without dead ends: 132 [2020-01-16 19:02:19,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:19,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-01-16 19:02:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 88. [2020-01-16 19:02:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 19:02:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 218 transitions. [2020-01-16 19:02:19,987 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 218 transitions. Word has length 19 [2020-01-16 19:02:19,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:19,988 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 218 transitions. [2020-01-16 19:02:19,988 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:19,988 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 218 transitions. [2020-01-16 19:02:19,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:19,988 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:19,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 19:02:19,989 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 19:02:19,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:19,989 INFO L82 PathProgramCache]: Analyzing trace with hash 592924360, now seen corresponding path program 644 times [2020-01-16 19:02:19,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:19,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033171613] [2020-01-16 19:02:19,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:20,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 19:02:20,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033171613] [2020-01-16 19:02:20,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:20,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:20,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482754637] [2020-01-16 19:02:20,197 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:20,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:20,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:20,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:20,198 INFO L87 Difference]: Start difference. First operand 88 states and 218 transitions. Second operand 8 states. [2020-01-16 19:02:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:20,249 INFO L93 Difference]: Finished difference Result 142 states and 288 transitions. [2020-01-16 19:02:20,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:20,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:20,250 INFO L225 Difference]: With dead ends: 142 [2020-01-16 19:02:20,250 INFO L226 Difference]: Without dead ends: 131 [2020-01-16 19:02:20,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 19:02:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-01-16 19:02:20,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 87. [2020-01-16 19:02:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 19:02:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 216 transitions. [2020-01-16 19:02:20,253 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 216 transitions. Word has length 19 [2020-01-16 19:02:20,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:20,253 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 216 transitions. [2020-01-16 19:02:20,253 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:20,254 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 216 transitions. [2020-01-16 19:02:20,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:20,254 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:20,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 19:02:20,254 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 19:02:20,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:20,255 INFO L82 PathProgramCache]: Analyzing trace with hash -240518682, now seen corresponding path program 645 times [2020-01-16 19:02:20,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:20,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506403899] [2020-01-16 19:02:20,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:20,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 19:02:20,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506403899] [2020-01-16 19:02:20,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:20,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:20,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996752933] [2020-01-16 19:02:20,448 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:20,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:20,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:20,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:20,448 INFO L87 Difference]: Start difference. First operand 87 states and 216 transitions. Second operand 8 states. [2020-01-16 19:02:20,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:20,520 INFO L93 Difference]: Finished difference Result 144 states and 295 transitions. [2020-01-16 19:02:20,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:20,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:20,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:20,521 INFO L225 Difference]: With dead ends: 144 [2020-01-16 19:02:20,521 INFO L226 Difference]: Without dead ends: 134 [2020-01-16 19:02:20,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 19:02:20,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-01-16 19:02:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 89. [2020-01-16 19:02:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 19:02:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 219 transitions. [2020-01-16 19:02:20,524 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 219 transitions. Word has length 19 [2020-01-16 19:02:20,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:20,524 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 219 transitions. [2020-01-16 19:02:20,524 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 219 transitions. [2020-01-16 19:02:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:20,524 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:20,524 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:20,525 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 19:02:20,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:20,525 INFO L82 PathProgramCache]: Analyzing trace with hash 714460322, now seen corresponding path program 646 times [2020-01-16 19:02:20,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:20,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840432171] [2020-01-16 19:02:20,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:20,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 19:02:20,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840432171] [2020-01-16 19:02:20,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:20,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:20,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051285961] [2020-01-16 19:02:20,718 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:20,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:20,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:20,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:20,719 INFO L87 Difference]: Start difference. First operand 89 states and 219 transitions. Second operand 8 states. [2020-01-16 19:02:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:20,793 INFO L93 Difference]: Finished difference Result 138 states and 291 transitions. [2020-01-16 19:02:20,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:20,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:20,794 INFO L225 Difference]: With dead ends: 138 [2020-01-16 19:02:20,794 INFO L226 Difference]: Without dead ends: 123 [2020-01-16 19:02:20,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 19:02:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-01-16 19:02:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 87. [2020-01-16 19:02:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 19:02:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 215 transitions. [2020-01-16 19:02:20,797 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 215 transitions. Word has length 19 [2020-01-16 19:02:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:20,797 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 215 transitions. [2020-01-16 19:02:20,797 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 215 transitions. [2020-01-16 19:02:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:20,798 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:20,798 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:20,798 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 19:02:20,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:20,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1130779938, now seen corresponding path program 647 times [2020-01-16 19:02:20,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:20,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668215361] [2020-01-16 19:02:20,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:20,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:20,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668215361] [2020-01-16 19:02:20,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:20,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:20,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413618748] [2020-01-16 19:02:20,997 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:20,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:20,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:20,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:20,997 INFO L87 Difference]: Start difference. First operand 87 states and 215 transitions. Second operand 8 states. [2020-01-16 19:02:21,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:21,047 INFO L93 Difference]: Finished difference Result 144 states and 294 transitions. [2020-01-16 19:02:21,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:21,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:21,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:21,048 INFO L225 Difference]: With dead ends: 144 [2020-01-16 19:02:21,048 INFO L226 Difference]: Without dead ends: 134 [2020-01-16 19:02:21,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 19:02:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-01-16 19:02:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 89. [2020-01-16 19:02:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 19:02:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 218 transitions. [2020-01-16 19:02:21,051 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 218 transitions. Word has length 19 [2020-01-16 19:02:21,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:21,051 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 218 transitions. [2020-01-16 19:02:21,051 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:21,052 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 218 transitions. [2020-01-16 19:02:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:21,052 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:21,052 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:21,052 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 19:02:21,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:21,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1674782362, now seen corresponding path program 648 times [2020-01-16 19:02:21,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:21,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854589022] [2020-01-16 19:02:21,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:21,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 19:02:21,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854589022] [2020-01-16 19:02:21,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:21,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:21,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650629093] [2020-01-16 19:02:21,251 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:21,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:21,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:21,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:21,252 INFO L87 Difference]: Start difference. First operand 89 states and 218 transitions. Second operand 8 states. [2020-01-16 19:02:21,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:21,325 INFO L93 Difference]: Finished difference Result 138 states and 290 transitions. [2020-01-16 19:02:21,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:21,325 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:21,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:21,326 INFO L225 Difference]: With dead ends: 138 [2020-01-16 19:02:21,326 INFO L226 Difference]: Without dead ends: 121 [2020-01-16 19:02:21,326 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-01-16 19:02:21,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 85. [2020-01-16 19:02:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-01-16 19:02:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 212 transitions. [2020-01-16 19:02:21,328 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 212 transitions. Word has length 19 [2020-01-16 19:02:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:21,328 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 212 transitions. [2020-01-16 19:02:21,328 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 212 transitions. [2020-01-16 19:02:21,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:21,329 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:21,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 19:02:21,329 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 19:02:21,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:21,329 INFO L82 PathProgramCache]: Analyzing trace with hash -898297510, now seen corresponding path program 649 times [2020-01-16 19:02:21,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:21,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427141838] [2020-01-16 19:02:21,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:21,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427141838] [2020-01-16 19:02:21,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:21,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:21,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112994787] [2020-01-16 19:02:21,512 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:21,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:21,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:21,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:21,513 INFO L87 Difference]: Start difference. First operand 85 states and 212 transitions. Second operand 8 states. [2020-01-16 19:02:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:21,584 INFO L93 Difference]: Finished difference Result 154 states and 319 transitions. [2020-01-16 19:02:21,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:21,585 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:21,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:21,585 INFO L225 Difference]: With dead ends: 154 [2020-01-16 19:02:21,585 INFO L226 Difference]: Without dead ends: 140 [2020-01-16 19:02:21,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-01-16 19:02:21,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 87. [2020-01-16 19:02:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 19:02:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 215 transitions. [2020-01-16 19:02:21,588 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 215 transitions. Word has length 19 [2020-01-16 19:02:21,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:21,589 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 215 transitions. [2020-01-16 19:02:21,589 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 215 transitions. [2020-01-16 19:02:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:21,589 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:21,589 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:21,590 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 19:02:21,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:21,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1772632836, now seen corresponding path program 650 times [2020-01-16 19:02:21,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:21,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844279924] [2020-01-16 19:02:21,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:21,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 19:02:21,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844279924] [2020-01-16 19:02:21,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:21,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:21,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465129629] [2020-01-16 19:02:21,772 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:21,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:21,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:21,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:21,772 INFO L87 Difference]: Start difference. First operand 87 states and 215 transitions. Second operand 8 states. [2020-01-16 19:02:21,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:21,844 INFO L93 Difference]: Finished difference Result 150 states and 308 transitions. [2020-01-16 19:02:21,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:21,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:21,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:21,845 INFO L225 Difference]: With dead ends: 150 [2020-01-16 19:02:21,845 INFO L226 Difference]: Without dead ends: 138 [2020-01-16 19:02:21,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 19:02:21,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-01-16 19:02:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 85. [2020-01-16 19:02:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-01-16 19:02:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 210 transitions. [2020-01-16 19:02:21,847 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 210 transitions. Word has length 19 [2020-01-16 19:02:21,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:21,847 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 210 transitions. [2020-01-16 19:02:21,847 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:21,847 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 210 transitions. [2020-01-16 19:02:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:21,848 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:21,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 19:02:21,848 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 19:02:21,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:21,848 INFO L82 PathProgramCache]: Analyzing trace with hash 591107486, now seen corresponding path program 651 times [2020-01-16 19:02:21,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:21,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299206395] [2020-01-16 19:02:21,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:22,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299206395] [2020-01-16 19:02:22,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:22,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:22,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557540225] [2020-01-16 19:02:22,032 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:22,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:22,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:22,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:22,032 INFO L87 Difference]: Start difference. First operand 85 states and 210 transitions. Second operand 8 states. [2020-01-16 19:02:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:22,101 INFO L93 Difference]: Finished difference Result 158 states and 329 transitions. [2020-01-16 19:02:22,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:22,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:22,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:22,102 INFO L225 Difference]: With dead ends: 158 [2020-01-16 19:02:22,102 INFO L226 Difference]: Without dead ends: 144 [2020-01-16 19:02:22,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 19:02:22,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-01-16 19:02:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 89. [2020-01-16 19:02:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-01-16 19:02:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 218 transitions. [2020-01-16 19:02:22,105 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 218 transitions. Word has length 19 [2020-01-16 19:02:22,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:22,105 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 218 transitions. [2020-01-16 19:02:22,105 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:22,105 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 218 transitions. [2020-01-16 19:02:22,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:22,106 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:22,106 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:22,106 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 19:02:22,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:22,106 INFO L82 PathProgramCache]: Analyzing trace with hash -154189658, now seen corresponding path program 652 times [2020-01-16 19:02:22,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:22,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244596891] [2020-01-16 19:02:22,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:22,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 19:02:22,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244596891] [2020-01-16 19:02:22,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:22,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:22,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687064149] [2020-01-16 19:02:22,286 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:22,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:22,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:22,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:22,287 INFO L87 Difference]: Start difference. First operand 89 states and 218 transitions. Second operand 8 states. [2020-01-16 19:02:22,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:22,360 INFO L93 Difference]: Finished difference Result 156 states and 321 transitions. [2020-01-16 19:02:22,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:22,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:22,361 INFO L225 Difference]: With dead ends: 156 [2020-01-16 19:02:22,361 INFO L226 Difference]: Without dead ends: 140 [2020-01-16 19:02:22,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-01-16 19:02:22,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 85. [2020-01-16 19:02:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-01-16 19:02:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 208 transitions. [2020-01-16 19:02:22,364 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 208 transitions. Word has length 19 [2020-01-16 19:02:22,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:22,364 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 208 transitions. [2020-01-16 19:02:22,365 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 208 transitions. [2020-01-16 19:02:22,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:22,365 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:22,365 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:22,365 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 19:02:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1950879654, now seen corresponding path program 653 times [2020-01-16 19:02:22,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:22,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537520178] [2020-01-16 19:02:22,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:22,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 19:02:22,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537520178] [2020-01-16 19:02:22,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:22,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:22,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312206717] [2020-01-16 19:02:22,554 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:22,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:22,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:22,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:22,554 INFO L87 Difference]: Start difference. First operand 85 states and 208 transitions. Second operand 8 states. [2020-01-16 19:02:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:22,627 INFO L93 Difference]: Finished difference Result 148 states and 302 transitions. [2020-01-16 19:02:22,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:22,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:22,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:22,628 INFO L225 Difference]: With dead ends: 148 [2020-01-16 19:02:22,628 INFO L226 Difference]: Without dead ends: 138 [2020-01-16 19:02:22,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 19:02:22,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-01-16 19:02:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 87. [2020-01-16 19:02:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 19:02:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 211 transitions. [2020-01-16 19:02:22,631 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 211 transitions. Word has length 19 [2020-01-16 19:02:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:22,631 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 211 transitions. [2020-01-16 19:02:22,631 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 211 transitions. [2020-01-16 19:02:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:22,632 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:22,632 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:22,632 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 19:02:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash -633474334, now seen corresponding path program 654 times [2020-01-16 19:02:22,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:22,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188359375] [2020-01-16 19:02:22,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:22,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188359375] [2020-01-16 19:02:22,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:22,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:22,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428284253] [2020-01-16 19:02:22,820 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:22,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:22,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:22,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:22,820 INFO L87 Difference]: Start difference. First operand 87 states and 211 transitions. Second operand 8 states. [2020-01-16 19:02:22,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:22,891 INFO L93 Difference]: Finished difference Result 150 states and 305 transitions. [2020-01-16 19:02:22,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:22,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:22,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:22,892 INFO L225 Difference]: With dead ends: 150 [2020-01-16 19:02:22,893 INFO L226 Difference]: Without dead ends: 134 [2020-01-16 19:02:22,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:22,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-01-16 19:02:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 83. [2020-01-16 19:02:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-01-16 19:02:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 203 transitions. [2020-01-16 19:02:22,895 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 203 transitions. Word has length 19 [2020-01-16 19:02:22,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:22,896 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 203 transitions. [2020-01-16 19:02:22,896 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 203 transitions. [2020-01-16 19:02:22,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:22,896 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:22,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 19:02:22,896 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 19:02:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:22,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1213390630, now seen corresponding path program 655 times [2020-01-16 19:02:22,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:22,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175712716] [2020-01-16 19:02:22,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:23,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 19:02:23,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175712716] [2020-01-16 19:02:23,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:23,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:23,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339310536] [2020-01-16 19:02:23,073 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:23,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:23,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:23,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:23,073 INFO L87 Difference]: Start difference. First operand 83 states and 203 transitions. Second operand 8 states. [2020-01-16 19:02:23,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:23,142 INFO L93 Difference]: Finished difference Result 152 states and 310 transitions. [2020-01-16 19:02:23,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:23,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:23,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:23,143 INFO L225 Difference]: With dead ends: 152 [2020-01-16 19:02:23,143 INFO L226 Difference]: Without dead ends: 138 [2020-01-16 19:02:23,143 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:23,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-01-16 19:02:23,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2020-01-16 19:02:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-01-16 19:02:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 201 transitions. [2020-01-16 19:02:23,145 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 201 transitions. Word has length 19 [2020-01-16 19:02:23,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:23,146 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 201 transitions. [2020-01-16 19:02:23,146 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 201 transitions. [2020-01-16 19:02:23,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:23,146 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:23,146 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:23,146 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 19:02:23,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:23,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2087725956, now seen corresponding path program 656 times [2020-01-16 19:02:23,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:23,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466975879] [2020-01-16 19:02:23,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:23,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 19:02:23,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466975879] [2020-01-16 19:02:23,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:23,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:23,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057553266] [2020-01-16 19:02:23,327 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:23,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:23,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:23,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:23,328 INFO L87 Difference]: Start difference. First operand 83 states and 201 transitions. Second operand 8 states. [2020-01-16 19:02:23,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:23,400 INFO L93 Difference]: Finished difference Result 148 states and 299 transitions. [2020-01-16 19:02:23,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:23,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:23,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:23,401 INFO L225 Difference]: With dead ends: 148 [2020-01-16 19:02:23,401 INFO L226 Difference]: Without dead ends: 136 [2020-01-16 19:02:23,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 19:02:23,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-01-16 19:02:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 81. [2020-01-16 19:02:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-01-16 19:02:23,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 196 transitions. [2020-01-16 19:02:23,404 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 196 transitions. Word has length 19 [2020-01-16 19:02:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:23,404 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 196 transitions. [2020-01-16 19:02:23,404 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:23,405 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 196 transitions. [2020-01-16 19:02:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:23,405 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:23,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 19:02:23,405 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 19:02:23,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:23,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1020716864, now seen corresponding path program 657 times [2020-01-16 19:02:23,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:23,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919863638] [2020-01-16 19:02:23,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:23,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919863638] [2020-01-16 19:02:23,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:23,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:23,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826580919] [2020-01-16 19:02:23,594 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:23,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:23,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:23,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:23,594 INFO L87 Difference]: Start difference. First operand 81 states and 196 transitions. Second operand 8 states. [2020-01-16 19:02:23,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:23,664 INFO L93 Difference]: Finished difference Result 152 states and 313 transitions. [2020-01-16 19:02:23,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:23,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:23,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:23,665 INFO L225 Difference]: With dead ends: 152 [2020-01-16 19:02:23,665 INFO L226 Difference]: Without dead ends: 138 [2020-01-16 19:02:23,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:23,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-01-16 19:02:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 86. [2020-01-16 19:02:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-01-16 19:02:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 206 transitions. [2020-01-16 19:02:23,668 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 206 transitions. Word has length 19 [2020-01-16 19:02:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:23,668 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 206 transitions. [2020-01-16 19:02:23,668 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 206 transitions. [2020-01-16 19:02:23,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:23,668 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:23,668 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:23,668 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 19:02:23,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:23,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1989600904, now seen corresponding path program 658 times [2020-01-16 19:02:23,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:23,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926974146] [2020-01-16 19:02:23,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:23,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 19:02:23,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926974146] [2020-01-16 19:02:23,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:23,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:23,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781250427] [2020-01-16 19:02:23,855 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:23,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:23,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:23,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:23,856 INFO L87 Difference]: Start difference. First operand 86 states and 206 transitions. Second operand 8 states. [2020-01-16 19:02:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:23,929 INFO L93 Difference]: Finished difference Result 142 states and 297 transitions. [2020-01-16 19:02:23,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:23,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:23,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:23,930 INFO L225 Difference]: With dead ends: 142 [2020-01-16 19:02:23,930 INFO L226 Difference]: Without dead ends: 124 [2020-01-16 19:02:23,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 19:02:23,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-01-16 19:02:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 81. [2020-01-16 19:02:23,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-01-16 19:02:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 194 transitions. [2020-01-16 19:02:23,932 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 194 transitions. Word has length 19 [2020-01-16 19:02:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:23,933 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 194 transitions. [2020-01-16 19:02:23,933 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 194 transitions. [2020-01-16 19:02:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:23,933 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:23,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 19:02:23,933 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 19:02:23,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:23,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1914478264, now seen corresponding path program 659 times [2020-01-16 19:02:23,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:23,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576779586] [2020-01-16 19:02:23,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:24,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 19:02:24,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576779586] [2020-01-16 19:02:24,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:24,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:24,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915001570] [2020-01-16 19:02:24,117 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:24,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:24,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:24,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:24,117 INFO L87 Difference]: Start difference. First operand 81 states and 194 transitions. Second operand 8 states. [2020-01-16 19:02:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:24,185 INFO L93 Difference]: Finished difference Result 145 states and 292 transitions. [2020-01-16 19:02:24,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:24,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:24,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:24,186 INFO L225 Difference]: With dead ends: 145 [2020-01-16 19:02:24,186 INFO L226 Difference]: Without dead ends: 135 [2020-01-16 19:02:24,187 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-01-16 19:02:24,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 83. [2020-01-16 19:02:24,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-01-16 19:02:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 197 transitions. [2020-01-16 19:02:24,189 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 197 transitions. Word has length 19 [2020-01-16 19:02:24,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:24,189 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 197 transitions. [2020-01-16 19:02:24,189 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 197 transitions. [2020-01-16 19:02:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:24,190 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:24,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 19:02:24,190 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 19:02:24,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:24,190 INFO L82 PathProgramCache]: Analyzing trace with hash 651441698, now seen corresponding path program 660 times [2020-01-16 19:02:24,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:24,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831356517] [2020-01-16 19:02:24,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:24,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831356517] [2020-01-16 19:02:24,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:24,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:24,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477590900] [2020-01-16 19:02:24,374 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:24,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:24,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:24,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:24,374 INFO L87 Difference]: Start difference. First operand 83 states and 197 transitions. Second operand 8 states. [2020-01-16 19:02:24,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:24,442 INFO L93 Difference]: Finished difference Result 139 states and 288 transitions. [2020-01-16 19:02:24,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:24,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:24,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:24,443 INFO L225 Difference]: With dead ends: 139 [2020-01-16 19:02:24,443 INFO L226 Difference]: Without dead ends: 122 [2020-01-16 19:02:24,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:24,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-01-16 19:02:24,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 79. [2020-01-16 19:02:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-01-16 19:02:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 189 transitions. [2020-01-16 19:02:24,445 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 189 transitions. Word has length 19 [2020-01-16 19:02:24,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:24,445 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 189 transitions. [2020-01-16 19:02:24,445 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 189 transitions. [2020-01-16 19:02:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:24,446 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:24,446 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:24,446 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 19:02:24,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:24,446 INFO L82 PathProgramCache]: Analyzing trace with hash -797071014, now seen corresponding path program 661 times [2020-01-16 19:02:24,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:24,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008803413] [2020-01-16 19:02:24,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:24,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 19:02:24,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008803413] [2020-01-16 19:02:24,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:24,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:24,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360128878] [2020-01-16 19:02:24,645 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:24,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:24,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:24,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:24,646 INFO L87 Difference]: Start difference. First operand 79 states and 189 transitions. Second operand 8 states. [2020-01-16 19:02:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:24,719 INFO L93 Difference]: Finished difference Result 156 states and 329 transitions. [2020-01-16 19:02:24,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:24,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:24,720 INFO L225 Difference]: With dead ends: 156 [2020-01-16 19:02:24,720 INFO L226 Difference]: Without dead ends: 142 [2020-01-16 19:02:24,720 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:24,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-01-16 19:02:24,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 87. [2020-01-16 19:02:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 19:02:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 213 transitions. [2020-01-16 19:02:24,723 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 213 transitions. Word has length 19 [2020-01-16 19:02:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:24,723 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 213 transitions. [2020-01-16 19:02:24,724 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 213 transitions. [2020-01-16 19:02:24,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:24,724 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:24,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 19:02:24,724 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 19:02:24,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:24,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1542368158, now seen corresponding path program 662 times [2020-01-16 19:02:24,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:24,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752126725] [2020-01-16 19:02:24,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:24,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 19:02:24,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752126725] [2020-01-16 19:02:24,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:24,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:24,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109316079] [2020-01-16 19:02:24,920 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:24,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:24,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:24,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:24,921 INFO L87 Difference]: Start difference. First operand 87 states and 213 transitions. Second operand 8 states. [2020-01-16 19:02:24,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:24,992 INFO L93 Difference]: Finished difference Result 154 states and 321 transitions. [2020-01-16 19:02:24,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:24,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:24,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:24,993 INFO L225 Difference]: With dead ends: 154 [2020-01-16 19:02:24,993 INFO L226 Difference]: Without dead ends: 138 [2020-01-16 19:02:24,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:24,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-01-16 19:02:24,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2020-01-16 19:02:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-01-16 19:02:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 201 transitions. [2020-01-16 19:02:24,995 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 201 transitions. Word has length 19 [2020-01-16 19:02:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:24,996 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 201 transitions. [2020-01-16 19:02:24,996 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 201 transitions. [2020-01-16 19:02:24,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:24,996 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:24,996 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:24,997 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 19:02:24,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:24,997 INFO L82 PathProgramCache]: Analyzing trace with hash -52368516, now seen corresponding path program 663 times [2020-01-16 19:02:24,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:24,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465576749] [2020-01-16 19:02:24,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:25,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 19:02:25,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465576749] [2020-01-16 19:02:25,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:25,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:25,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754267905] [2020-01-16 19:02:25,193 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:25,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:25,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:25,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:25,194 INFO L87 Difference]: Start difference. First operand 83 states and 201 transitions. Second operand 8 states. [2020-01-16 19:02:25,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:25,265 INFO L93 Difference]: Finished difference Result 147 states and 303 transitions. [2020-01-16 19:02:25,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:25,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:25,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:25,266 INFO L225 Difference]: With dead ends: 147 [2020-01-16 19:02:25,266 INFO L226 Difference]: Without dead ends: 133 [2020-01-16 19:02:25,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 19:02:25,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-01-16 19:02:25,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 88. [2020-01-16 19:02:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-01-16 19:02:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 211 transitions. [2020-01-16 19:02:25,269 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 211 transitions. Word has length 19 [2020-01-16 19:02:25,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:25,269 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 211 transitions. [2020-01-16 19:02:25,269 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:25,270 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 211 transitions. [2020-01-16 19:02:25,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:25,270 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:25,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:25,270 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 19:02:25,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:25,271 INFO L82 PathProgramCache]: Analyzing trace with hash 916515524, now seen corresponding path program 664 times [2020-01-16 19:02:25,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:25,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903963264] [2020-01-16 19:02:25,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:25,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 19:02:25,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903963264] [2020-01-16 19:02:25,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:25,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:25,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452654023] [2020-01-16 19:02:25,472 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:25,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:25,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:25,473 INFO L87 Difference]: Start difference. First operand 88 states and 211 transitions. Second operand 8 states. [2020-01-16 19:02:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:25,546 INFO L93 Difference]: Finished difference Result 137 states and 287 transitions. [2020-01-16 19:02:25,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:25,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:25,547 INFO L225 Difference]: With dead ends: 137 [2020-01-16 19:02:25,547 INFO L226 Difference]: Without dead ends: 119 [2020-01-16 19:02:25,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 19:02:25,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-01-16 19:02:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 83. [2020-01-16 19:02:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-01-16 19:02:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 197 transitions. [2020-01-16 19:02:25,550 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 197 transitions. Word has length 19 [2020-01-16 19:02:25,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:25,550 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 197 transitions. [2020-01-16 19:02:25,551 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 197 transitions. [2020-01-16 19:02:25,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:25,551 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:25,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 19:02:25,551 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 19:02:25,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:25,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1571733990, now seen corresponding path program 665 times [2020-01-16 19:02:25,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:25,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387485955] [2020-01-16 19:02:25,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:25,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 19:02:25,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387485955] [2020-01-16 19:02:25,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:25,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:25,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574899299] [2020-01-16 19:02:25,755 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:25,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:25,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:25,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:25,756 INFO L87 Difference]: Start difference. First operand 83 states and 197 transitions. Second operand 8 states. [2020-01-16 19:02:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:25,827 INFO L93 Difference]: Finished difference Result 135 states and 283 transitions. [2020-01-16 19:02:25,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:25,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:25,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:25,828 INFO L225 Difference]: With dead ends: 135 [2020-01-16 19:02:25,828 INFO L226 Difference]: Without dead ends: 123 [2020-01-16 19:02:25,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 19:02:25,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-01-16 19:02:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 87. [2020-01-16 19:02:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-01-16 19:02:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 205 transitions. [2020-01-16 19:02:25,831 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 205 transitions. Word has length 19 [2020-01-16 19:02:25,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:25,831 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 205 transitions. [2020-01-16 19:02:25,831 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:25,831 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 205 transitions. [2020-01-16 19:02:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:25,831 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:25,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 19:02:25,831 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 19:02:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:25,832 INFO L82 PathProgramCache]: Analyzing trace with hash -712859460, now seen corresponding path program 666 times [2020-01-16 19:02:25,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:25,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860423345] [2020-01-16 19:02:25,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:26,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 19:02:26,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860423345] [2020-01-16 19:02:26,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:26,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:26,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917593905] [2020-01-16 19:02:26,035 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:26,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:26,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:26,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:26,035 INFO L87 Difference]: Start difference. First operand 87 states and 205 transitions. Second operand 8 states. [2020-01-16 19:02:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:26,106 INFO L93 Difference]: Finished difference Result 122 states and 262 transitions. [2020-01-16 19:02:26,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:26,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:26,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:26,107 INFO L225 Difference]: With dead ends: 122 [2020-01-16 19:02:26,107 INFO L226 Difference]: Without dead ends: 101 [2020-01-16 19:02:26,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 19:02:26,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-01-16 19:02:26,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 79. [2020-01-16 19:02:26,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-01-16 19:02:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 187 transitions. [2020-01-16 19:02:26,109 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 187 transitions. Word has length 19 [2020-01-16 19:02:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:26,109 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 187 transitions. [2020-01-16 19:02:26,110 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 187 transitions. [2020-01-16 19:02:26,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:26,110 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:26,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 19:02:26,110 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 19:02:26,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:26,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1100556732, now seen corresponding path program 667 times [2020-01-16 19:02:26,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:26,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569194723] [2020-01-16 19:02:26,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:26,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 19:02:26,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569194723] [2020-01-16 19:02:26,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:26,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:26,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874277048] [2020-01-16 19:02:26,317 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:26,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:26,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:26,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:26,318 INFO L87 Difference]: Start difference. First operand 79 states and 187 transitions. Second operand 8 states. [2020-01-16 19:02:26,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:26,388 INFO L93 Difference]: Finished difference Result 141 states and 283 transitions. [2020-01-16 19:02:26,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:26,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:26,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:26,389 INFO L225 Difference]: With dead ends: 141 [2020-01-16 19:02:26,389 INFO L226 Difference]: Without dead ends: 131 [2020-01-16 19:02:26,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 19:02:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-01-16 19:02:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 83. [2020-01-16 19:02:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-01-16 19:02:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 197 transitions. [2020-01-16 19:02:26,392 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 197 transitions. Word has length 19 [2020-01-16 19:02:26,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:26,392 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 197 transitions. [2020-01-16 19:02:26,392 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:26,393 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 197 transitions. [2020-01-16 19:02:26,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:26,393 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:26,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 19:02:26,393 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 19:02:26,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:26,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1483797256, now seen corresponding path program 668 times [2020-01-16 19:02:26,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:26,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74374679] [2020-01-16 19:02:26,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:26,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 19:02:26,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74374679] [2020-01-16 19:02:26,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:26,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:26,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481217760] [2020-01-16 19:02:26,592 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:26,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:26,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:26,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:26,593 INFO L87 Difference]: Start difference. First operand 83 states and 197 transitions. Second operand 8 states. [2020-01-16 19:02:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:26,669 INFO L93 Difference]: Finished difference Result 143 states and 286 transitions. [2020-01-16 19:02:26,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:26,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:26,670 INFO L225 Difference]: With dead ends: 143 [2020-01-16 19:02:26,670 INFO L226 Difference]: Without dead ends: 129 [2020-01-16 19:02:26,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:26,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-01-16 19:02:26,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 81. [2020-01-16 19:02:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-01-16 19:02:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 192 transitions. [2020-01-16 19:02:26,673 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 192 transitions. Word has length 19 [2020-01-16 19:02:26,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:26,673 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 192 transitions. [2020-01-16 19:02:26,673 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 192 transitions. [2020-01-16 19:02:26,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:26,674 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:26,674 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:26,675 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 19:02:26,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:26,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1845259230, now seen corresponding path program 669 times [2020-01-16 19:02:26,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:26,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468039515] [2020-01-16 19:02:26,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:26,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 19:02:26,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468039515] [2020-01-16 19:02:26,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:26,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:26,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292486573] [2020-01-16 19:02:26,873 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:26,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:26,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:26,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:26,873 INFO L87 Difference]: Start difference. First operand 81 states and 192 transitions. Second operand 8 states. [2020-01-16 19:02:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:26,940 INFO L93 Difference]: Finished difference Result 138 states and 275 transitions. [2020-01-16 19:02:26,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:26,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:26,941 INFO L225 Difference]: With dead ends: 138 [2020-01-16 19:02:26,941 INFO L226 Difference]: Without dead ends: 128 [2020-01-16 19:02:26,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:26,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-01-16 19:02:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 83. [2020-01-16 19:02:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-01-16 19:02:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 195 transitions. [2020-01-16 19:02:26,943 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 195 transitions. Word has length 19 [2020-01-16 19:02:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:26,944 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 195 transitions. [2020-01-16 19:02:26,944 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 195 transitions. [2020-01-16 19:02:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:26,944 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:26,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 19:02:26,945 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 19:02:26,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:26,945 INFO L82 PathProgramCache]: Analyzing trace with hash 116211896, now seen corresponding path program 670 times [2020-01-16 19:02:26,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:26,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888634044] [2020-01-16 19:02:26,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:27,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 19:02:27,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888634044] [2020-01-16 19:02:27,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:27,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:27,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461595405] [2020-01-16 19:02:27,137 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:27,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:27,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:27,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:27,138 INFO L87 Difference]: Start difference. First operand 83 states and 195 transitions. Second operand 8 states. [2020-01-16 19:02:27,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:27,214 INFO L93 Difference]: Finished difference Result 132 states and 271 transitions. [2020-01-16 19:02:27,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:27,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:27,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:27,215 INFO L225 Difference]: With dead ends: 132 [2020-01-16 19:02:27,215 INFO L226 Difference]: Without dead ends: 117 [2020-01-16 19:02:27,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 19:02:27,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-01-16 19:02:27,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 81. [2020-01-16 19:02:27,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-01-16 19:02:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 190 transitions. [2020-01-16 19:02:27,218 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 190 transitions. Word has length 19 [2020-01-16 19:02:27,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:27,218 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 190 transitions. [2020-01-16 19:02:27,218 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 190 transitions. [2020-01-16 19:02:27,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:27,219 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:27,219 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:27,219 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 19:02:27,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:27,219 INFO L82 PathProgramCache]: Analyzing trace with hash 750310238, now seen corresponding path program 671 times [2020-01-16 19:02:27,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:27,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894486400] [2020-01-16 19:02:27,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:27,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 19:02:27,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894486400] [2020-01-16 19:02:27,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:27,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:27,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992630222] [2020-01-16 19:02:27,426 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:27,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:27,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:27,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:27,427 INFO L87 Difference]: Start difference. First operand 81 states and 190 transitions. Second operand 8 states. [2020-01-16 19:02:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:27,499 INFO L93 Difference]: Finished difference Result 133 states and 276 transitions. [2020-01-16 19:02:27,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:27,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:27,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:27,500 INFO L225 Difference]: With dead ends: 133 [2020-01-16 19:02:27,500 INFO L226 Difference]: Without dead ends: 121 [2020-01-16 19:02:27,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:27,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-01-16 19:02:27,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 85. [2020-01-16 19:02:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-01-16 19:02:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 198 transitions. [2020-01-16 19:02:27,503 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 198 transitions. Word has length 19 [2020-01-16 19:02:27,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:27,503 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 198 transitions. [2020-01-16 19:02:27,503 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:27,503 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 198 transitions. [2020-01-16 19:02:27,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:27,504 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:27,504 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:27,504 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 19:02:27,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:27,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1605616892, now seen corresponding path program 672 times [2020-01-16 19:02:27,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:27,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256973842] [2020-01-16 19:02:27,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:27,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 19:02:27,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256973842] [2020-01-16 19:02:27,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:27,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:27,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562557105] [2020-01-16 19:02:27,709 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:27,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:27,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:27,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:27,709 INFO L87 Difference]: Start difference. First operand 85 states and 198 transitions. Second operand 8 states. [2020-01-16 19:02:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:27,778 INFO L93 Difference]: Finished difference Result 120 states and 255 transitions. [2020-01-16 19:02:27,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:27,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:27,779 INFO L225 Difference]: With dead ends: 120 [2020-01-16 19:02:27,779 INFO L226 Difference]: Without dead ends: 99 [2020-01-16 19:02:27,779 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-01-16 19:02:27,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2020-01-16 19:02:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-01-16 19:02:27,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 183 transitions. [2020-01-16 19:02:27,781 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 183 transitions. Word has length 19 [2020-01-16 19:02:27,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:27,782 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 183 transitions. [2020-01-16 19:02:27,782 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:27,782 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 183 transitions. [2020-01-16 19:02:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:27,782 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:27,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 19:02:27,782 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 19:02:27,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:27,782 INFO L82 PathProgramCache]: Analyzing trace with hash 598823932, now seen corresponding path program 673 times [2020-01-16 19:02:27,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:27,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947401795] [2020-01-16 19:02:27,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:27,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947401795] [2020-01-16 19:02:27,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:27,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:27,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756314126] [2020-01-16 19:02:27,958 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:27,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:27,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:27,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:27,958 INFO L87 Difference]: Start difference. First operand 77 states and 183 transitions. Second operand 8 states. [2020-01-16 19:02:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:28,027 INFO L93 Difference]: Finished difference Result 136 states and 266 transitions. [2020-01-16 19:02:28,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:28,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:28,028 INFO L225 Difference]: With dead ends: 136 [2020-01-16 19:02:28,028 INFO L226 Difference]: Without dead ends: 122 [2020-01-16 19:02:28,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 19:02:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-01-16 19:02:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 79. [2020-01-16 19:02:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-01-16 19:02:28,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 186 transitions. [2020-01-16 19:02:28,030 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 186 transitions. Word has length 19 [2020-01-16 19:02:28,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:28,030 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 186 transitions. [2020-01-16 19:02:28,030 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:28,030 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 186 transitions. [2020-01-16 19:02:28,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:28,031 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:28,031 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:28,031 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 19:02:28,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:28,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1718953762, now seen corresponding path program 674 times [2020-01-16 19:02:28,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:28,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292949846] [2020-01-16 19:02:28,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:28,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 19:02:28,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292949846] [2020-01-16 19:02:28,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:28,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:28,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045936750] [2020-01-16 19:02:28,226 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:28,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:28,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:28,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:28,226 INFO L87 Difference]: Start difference. First operand 79 states and 186 transitions. Second operand 8 states. [2020-01-16 19:02:28,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:28,275 INFO L93 Difference]: Finished difference Result 132 states and 255 transitions. [2020-01-16 19:02:28,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:28,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:28,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:28,276 INFO L225 Difference]: With dead ends: 132 [2020-01-16 19:02:28,277 INFO L226 Difference]: Without dead ends: 120 [2020-01-16 19:02:28,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 19:02:28,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-01-16 19:02:28,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 77. [2020-01-16 19:02:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-01-16 19:02:28,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 181 transitions. [2020-01-16 19:02:28,279 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 181 transitions. Word has length 19 [2020-01-16 19:02:28,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:28,279 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 181 transitions. [2020-01-16 19:02:28,279 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:28,279 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 181 transitions. [2020-01-16 19:02:28,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:28,279 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:28,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 19:02:28,280 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 19:02:28,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:28,280 INFO L82 PathProgramCache]: Analyzing trace with hash -145878566, now seen corresponding path program 675 times [2020-01-16 19:02:28,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:28,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120191208] [2020-01-16 19:02:28,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:28,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 19:02:28,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120191208] [2020-01-16 19:02:28,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:28,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:28,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565462292] [2020-01-16 19:02:28,468 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:28,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:28,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:28,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:28,469 INFO L87 Difference]: Start difference. First operand 77 states and 181 transitions. Second operand 8 states. [2020-01-16 19:02:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:28,537 INFO L93 Difference]: Finished difference Result 140 states and 276 transitions. [2020-01-16 19:02:28,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:28,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:28,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:28,538 INFO L225 Difference]: With dead ends: 140 [2020-01-16 19:02:28,538 INFO L226 Difference]: Without dead ends: 126 [2020-01-16 19:02:28,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 19:02:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-01-16 19:02:28,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 81. [2020-01-16 19:02:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-01-16 19:02:28,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 189 transitions. [2020-01-16 19:02:28,541 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 189 transitions. Word has length 19 [2020-01-16 19:02:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:28,541 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 189 transitions. [2020-01-16 19:02:28,541 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 189 transitions. [2020-01-16 19:02:28,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:28,541 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:28,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 19:02:28,541 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 19:02:28,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:28,542 INFO L82 PathProgramCache]: Analyzing trace with hash -891175710, now seen corresponding path program 676 times [2020-01-16 19:02:28,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:28,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055739956] [2020-01-16 19:02:28,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:28,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 19:02:28,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055739956] [2020-01-16 19:02:28,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:28,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:28,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400054304] [2020-01-16 19:02:28,722 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:28,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:28,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:28,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:28,722 INFO L87 Difference]: Start difference. First operand 81 states and 189 transitions. Second operand 8 states. [2020-01-16 19:02:28,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:28,790 INFO L93 Difference]: Finished difference Result 138 states and 268 transitions. [2020-01-16 19:02:28,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:28,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:28,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:28,791 INFO L225 Difference]: With dead ends: 138 [2020-01-16 19:02:28,791 INFO L226 Difference]: Without dead ends: 122 [2020-01-16 19:02:28,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:28,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-01-16 19:02:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2020-01-16 19:02:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-01-16 19:02:28,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 179 transitions. [2020-01-16 19:02:28,794 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 179 transitions. Word has length 19 [2020-01-16 19:02:28,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:28,794 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 179 transitions. [2020-01-16 19:02:28,794 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 179 transitions. [2020-01-16 19:02:28,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:28,794 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:28,794 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:28,794 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 19:02:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:28,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1183723960, now seen corresponding path program 677 times [2020-01-16 19:02:28,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:28,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339772180] [2020-01-16 19:02:28,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:28,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 19:02:28,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339772180] [2020-01-16 19:02:28,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:28,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:28,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927857720] [2020-01-16 19:02:28,984 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:28,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:28,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:28,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:28,984 INFO L87 Difference]: Start difference. First operand 77 states and 179 transitions. Second operand 8 states. [2020-01-16 19:02:29,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:29,031 INFO L93 Difference]: Finished difference Result 130 states and 249 transitions. [2020-01-16 19:02:29,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:29,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:29,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:29,031 INFO L225 Difference]: With dead ends: 130 [2020-01-16 19:02:29,032 INFO L226 Difference]: Without dead ends: 120 [2020-01-16 19:02:29,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 19:02:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-01-16 19:02:29,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 79. [2020-01-16 19:02:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-01-16 19:02:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 182 transitions. [2020-01-16 19:02:29,034 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 182 transitions. Word has length 19 [2020-01-16 19:02:29,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:29,034 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 182 transitions. [2020-01-16 19:02:29,034 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 182 transitions. [2020-01-16 19:02:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:29,035 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:29,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 19:02:29,035 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 19:02:29,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:29,035 INFO L82 PathProgramCache]: Analyzing trace with hash 328417306, now seen corresponding path program 678 times [2020-01-16 19:02:29,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:29,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409408514] [2020-01-16 19:02:29,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:29,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409408514] [2020-01-16 19:02:29,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:29,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:29,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279193367] [2020-01-16 19:02:29,224 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:29,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:29,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:29,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:29,225 INFO L87 Difference]: Start difference. First operand 79 states and 182 transitions. Second operand 8 states. [2020-01-16 19:02:29,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:29,294 INFO L93 Difference]: Finished difference Result 132 states and 252 transitions. [2020-01-16 19:02:29,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:29,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:29,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:29,295 INFO L225 Difference]: With dead ends: 132 [2020-01-16 19:02:29,295 INFO L226 Difference]: Without dead ends: 116 [2020-01-16 19:02:29,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 19:02:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-01-16 19:02:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2020-01-16 19:02:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-01-16 19:02:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 174 transitions. [2020-01-16 19:02:29,298 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 174 transitions. Word has length 19 [2020-01-16 19:02:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:29,298 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 174 transitions. [2020-01-16 19:02:29,298 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 174 transitions. [2020-01-16 19:02:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:29,299 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:29,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 19:02:29,299 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 19:02:29,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:29,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1001613922, now seen corresponding path program 679 times [2020-01-16 19:02:29,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:29,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435622759] [2020-01-16 19:02:29,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:29,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 19:02:29,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435622759] [2020-01-16 19:02:29,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:29,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:29,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272188123] [2020-01-16 19:02:29,482 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:29,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:29,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:29,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:29,483 INFO L87 Difference]: Start difference. First operand 75 states and 174 transitions. Second operand 8 states. [2020-01-16 19:02:29,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:29,555 INFO L93 Difference]: Finished difference Result 133 states and 254 transitions. [2020-01-16 19:02:29,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:29,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:29,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:29,556 INFO L225 Difference]: With dead ends: 133 [2020-01-16 19:02:29,556 INFO L226 Difference]: Without dead ends: 119 [2020-01-16 19:02:29,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:29,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-01-16 19:02:29,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 75. [2020-01-16 19:02:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-01-16 19:02:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 172 transitions. [2020-01-16 19:02:29,558 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 172 transitions. Word has length 19 [2020-01-16 19:02:29,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:29,558 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 172 transitions. [2020-01-16 19:02:29,558 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 172 transitions. [2020-01-16 19:02:29,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:29,559 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:29,559 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:29,559 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 19:02:29,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:29,559 INFO L82 PathProgramCache]: Analyzing trace with hash 118515908, now seen corresponding path program 680 times [2020-01-16 19:02:29,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:29,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923055523] [2020-01-16 19:02:29,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:29,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 19:02:29,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923055523] [2020-01-16 19:02:29,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:29,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:29,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193402752] [2020-01-16 19:02:29,750 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:29,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:29,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:29,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:29,750 INFO L87 Difference]: Start difference. First operand 75 states and 172 transitions. Second operand 8 states. [2020-01-16 19:02:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:29,803 INFO L93 Difference]: Finished difference Result 129 states and 243 transitions. [2020-01-16 19:02:29,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:29,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:29,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:29,804 INFO L225 Difference]: With dead ends: 129 [2020-01-16 19:02:29,804 INFO L226 Difference]: Without dead ends: 117 [2020-01-16 19:02:29,804 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:29,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-01-16 19:02:29,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 73. [2020-01-16 19:02:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-01-16 19:02:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 167 transitions. [2020-01-16 19:02:29,807 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 167 transitions. Word has length 19 [2020-01-16 19:02:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:29,807 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 167 transitions. [2020-01-16 19:02:29,807 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 167 transitions. [2020-01-16 19:02:29,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:29,808 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:29,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 19:02:29,808 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 19:02:29,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:29,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2074699302, now seen corresponding path program 681 times [2020-01-16 19:02:29,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:29,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539928413] [2020-01-16 19:02:29,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:30,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 19:02:30,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539928413] [2020-01-16 19:02:30,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:30,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:30,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343486101] [2020-01-16 19:02:30,010 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:30,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:30,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:30,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:30,011 INFO L87 Difference]: Start difference. First operand 73 states and 167 transitions. Second operand 8 states. [2020-01-16 19:02:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:30,078 INFO L93 Difference]: Finished difference Result 133 states and 257 transitions. [2020-01-16 19:02:30,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:30,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:30,079 INFO L225 Difference]: With dead ends: 133 [2020-01-16 19:02:30,080 INFO L226 Difference]: Without dead ends: 119 [2020-01-16 19:02:30,080 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-01-16 19:02:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 78. [2020-01-16 19:02:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-01-16 19:02:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 177 transitions. [2020-01-16 19:02:30,083 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 177 transitions. Word has length 19 [2020-01-16 19:02:30,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:30,083 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 177 transitions. [2020-01-16 19:02:30,083 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 177 transitions. [2020-01-16 19:02:30,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:30,084 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:30,084 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:30,084 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 19:02:30,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:30,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1578211076, now seen corresponding path program 682 times [2020-01-16 19:02:30,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:30,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51880127] [2020-01-16 19:02:30,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:30,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51880127] [2020-01-16 19:02:30,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:30,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:30,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071690974] [2020-01-16 19:02:30,280 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:30,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:30,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:30,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:30,281 INFO L87 Difference]: Start difference. First operand 78 states and 177 transitions. Second operand 8 states. [2020-01-16 19:02:30,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:30,351 INFO L93 Difference]: Finished difference Result 123 states and 241 transitions. [2020-01-16 19:02:30,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:30,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:30,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:30,351 INFO L225 Difference]: With dead ends: 123 [2020-01-16 19:02:30,351 INFO L226 Difference]: Without dead ends: 105 [2020-01-16 19:02:30,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 19:02:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-01-16 19:02:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2020-01-16 19:02:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-01-16 19:02:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 165 transitions. [2020-01-16 19:02:30,353 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 165 transitions. Word has length 19 [2020-01-16 19:02:30,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:30,354 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 165 transitions. [2020-01-16 19:02:30,354 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:30,354 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 165 transitions. [2020-01-16 19:02:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:30,355 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:30,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 19:02:30,355 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 19:02:30,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:30,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1194227064, now seen corresponding path program 683 times [2020-01-16 19:02:30,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:30,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818736272] [2020-01-16 19:02:30,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:30,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818736272] [2020-01-16 19:02:30,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:30,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:30,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709711627] [2020-01-16 19:02:30,564 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:30,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:30,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:30,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:30,565 INFO L87 Difference]: Start difference. First operand 73 states and 165 transitions. Second operand 8 states. [2020-01-16 19:02:30,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:30,612 INFO L93 Difference]: Finished difference Result 126 states and 236 transitions. [2020-01-16 19:02:30,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:30,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:30,613 INFO L225 Difference]: With dead ends: 126 [2020-01-16 19:02:30,613 INFO L226 Difference]: Without dead ends: 116 [2020-01-16 19:02:30,613 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-01-16 19:02:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2020-01-16 19:02:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-01-16 19:02:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 168 transitions. [2020-01-16 19:02:30,615 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 168 transitions. Word has length 19 [2020-01-16 19:02:30,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:30,615 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 168 transitions. [2020-01-16 19:02:30,615 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:30,615 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 168 transitions. [2020-01-16 19:02:30,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:30,615 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:30,615 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:30,616 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 19:02:30,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:30,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1611335236, now seen corresponding path program 684 times [2020-01-16 19:02:30,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:30,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946971798] [2020-01-16 19:02:30,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:30,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946971798] [2020-01-16 19:02:30,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:30,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:30,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255609868] [2020-01-16 19:02:30,811 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:30,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:30,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:30,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:30,812 INFO L87 Difference]: Start difference. First operand 75 states and 168 transitions. Second operand 8 states. [2020-01-16 19:02:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:30,880 INFO L93 Difference]: Finished difference Result 120 states and 232 transitions. [2020-01-16 19:02:30,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:30,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:30,881 INFO L225 Difference]: With dead ends: 120 [2020-01-16 19:02:30,881 INFO L226 Difference]: Without dead ends: 103 [2020-01-16 19:02:30,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 19:02:30,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-01-16 19:02:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2020-01-16 19:02:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-01-16 19:02:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 160 transitions. [2020-01-16 19:02:30,883 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 160 transitions. Word has length 19 [2020-01-16 19:02:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:30,884 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 160 transitions. [2020-01-16 19:02:30,884 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 160 transitions. [2020-01-16 19:02:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:30,884 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:30,884 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:30,884 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 19:02:30,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:30,885 INFO L82 PathProgramCache]: Analyzing trace with hash 948213022, now seen corresponding path program 685 times [2020-01-16 19:02:30,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:30,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349429918] [2020-01-16 19:02:30,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:31,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349429918] [2020-01-16 19:02:31,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:31,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:31,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820519489] [2020-01-16 19:02:31,081 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:31,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:31,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:31,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:31,081 INFO L87 Difference]: Start difference. First operand 71 states and 160 transitions. Second operand 8 states. [2020-01-16 19:02:31,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:31,148 INFO L93 Difference]: Finished difference Result 129 states and 245 transitions. [2020-01-16 19:02:31,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:31,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:31,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:31,149 INFO L225 Difference]: With dead ends: 129 [2020-01-16 19:02:31,149 INFO L226 Difference]: Without dead ends: 115 [2020-01-16 19:02:31,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 19:02:31,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-01-16 19:02:31,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 71. [2020-01-16 19:02:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-01-16 19:02:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 156 transitions. [2020-01-16 19:02:31,151 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 156 transitions. Word has length 19 [2020-01-16 19:02:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:31,152 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 156 transitions. [2020-01-16 19:02:31,152 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 156 transitions. [2020-01-16 19:02:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:31,152 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:31,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 19:02:31,152 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 19:02:31,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:31,152 INFO L82 PathProgramCache]: Analyzing trace with hash 202915878, now seen corresponding path program 686 times [2020-01-16 19:02:31,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:31,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628625848] [2020-01-16 19:02:31,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:31,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 19:02:31,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628625848] [2020-01-16 19:02:31,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:31,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:31,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687765115] [2020-01-16 19:02:31,352 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:31,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:31,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:31,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:31,353 INFO L87 Difference]: Start difference. First operand 71 states and 156 transitions. Second operand 8 states. [2020-01-16 19:02:31,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:31,425 INFO L93 Difference]: Finished difference Result 127 states and 237 transitions. [2020-01-16 19:02:31,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:31,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:31,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:31,425 INFO L225 Difference]: With dead ends: 127 [2020-01-16 19:02:31,426 INFO L226 Difference]: Without dead ends: 111 [2020-01-16 19:02:31,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 19:02:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-01-16 19:02:31,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 67. [2020-01-16 19:02:31,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-01-16 19:02:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 144 transitions. [2020-01-16 19:02:31,428 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 144 transitions. Word has length 19 [2020-01-16 19:02:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:31,428 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 144 transitions. [2020-01-16 19:02:31,428 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 144 transitions. [2020-01-16 19:02:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:31,429 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:31,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 19:02:31,429 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 19:02:31,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:31,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1001613922, now seen corresponding path program 687 times [2020-01-16 19:02:31,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:31,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296395408] [2020-01-16 19:02:31,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:31,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 19:02:31,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296395408] [2020-01-16 19:02:31,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:31,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:31,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971907461] [2020-01-16 19:02:31,631 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:31,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:31,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:31,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:31,631 INFO L87 Difference]: Start difference. First operand 67 states and 144 transitions. Second operand 8 states. [2020-01-16 19:02:31,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:31,702 INFO L93 Difference]: Finished difference Result 120 states and 219 transitions. [2020-01-16 19:02:31,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:31,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:31,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:31,703 INFO L225 Difference]: With dead ends: 120 [2020-01-16 19:02:31,703 INFO L226 Difference]: Without dead ends: 106 [2020-01-16 19:02:31,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 19:02:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-01-16 19:02:31,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 61. [2020-01-16 19:02:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-01-16 19:02:31,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 127 transitions. [2020-01-16 19:02:31,705 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 127 transitions. Word has length 19 [2020-01-16 19:02:31,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:31,705 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 127 transitions. [2020-01-16 19:02:31,706 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:31,706 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 127 transitions. [2020-01-16 19:02:31,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:31,706 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:31,706 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:31,706 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 19:02:31,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:31,706 INFO L82 PathProgramCache]: Analyzing trace with hash -32729882, now seen corresponding path program 688 times [2020-01-16 19:02:31,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:31,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045837001] [2020-01-16 19:02:31,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:31,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 19:02:31,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045837001] [2020-01-16 19:02:31,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:31,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:31,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475858311] [2020-01-16 19:02:31,908 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:31,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:31,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:31,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:31,909 INFO L87 Difference]: Start difference. First operand 61 states and 127 transitions. Second operand 8 states. [2020-01-16 19:02:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:31,979 INFO L93 Difference]: Finished difference Result 110 states and 203 transitions. [2020-01-16 19:02:31,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:31,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:31,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:31,980 INFO L225 Difference]: With dead ends: 110 [2020-01-16 19:02:31,980 INFO L226 Difference]: Without dead ends: 92 [2020-01-16 19:02:31,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:31,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-01-16 19:02:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2020-01-16 19:02:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-01-16 19:02:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 113 transitions. [2020-01-16 19:02:31,982 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 113 transitions. Word has length 19 [2020-01-16 19:02:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:31,983 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 113 transitions. [2020-01-16 19:02:31,983 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:31,983 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 113 transitions. [2020-01-16 19:02:31,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:31,983 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:31,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 19:02:31,984 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 19:02:31,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:31,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1773987900, now seen corresponding path program 689 times [2020-01-16 19:02:31,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:31,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270850021] [2020-01-16 19:02:31,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:32,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 19:02:32,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270850021] [2020-01-16 19:02:32,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:32,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:32,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887463730] [2020-01-16 19:02:32,185 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:32,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:32,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:32,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:32,186 INFO L87 Difference]: Start difference. First operand 56 states and 113 transitions. Second operand 8 states. [2020-01-16 19:02:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:32,254 INFO L93 Difference]: Finished difference Result 108 states and 199 transitions. [2020-01-16 19:02:32,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:32,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:32,255 INFO L225 Difference]: With dead ends: 108 [2020-01-16 19:02:32,255 INFO L226 Difference]: Without dead ends: 96 [2020-01-16 19:02:32,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 19:02:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-01-16 19:02:32,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 60. [2020-01-16 19:02:32,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-01-16 19:02:32,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 121 transitions. [2020-01-16 19:02:32,257 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 121 transitions. Word has length 19 [2020-01-16 19:02:32,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:32,257 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 121 transitions. [2020-01-16 19:02:32,257 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:32,257 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 121 transitions. [2020-01-16 19:02:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:32,257 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:32,257 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:32,257 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 19:02:32,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:32,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1662104866, now seen corresponding path program 690 times [2020-01-16 19:02:32,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:32,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891329791] [2020-01-16 19:02:32,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:32,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891329791] [2020-01-16 19:02:32,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:32,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:32,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905522925] [2020-01-16 19:02:32,460 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:32,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:32,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:32,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:32,461 INFO L87 Difference]: Start difference. First operand 60 states and 121 transitions. Second operand 8 states. [2020-01-16 19:02:32,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:32,527 INFO L93 Difference]: Finished difference Result 95 states and 178 transitions. [2020-01-16 19:02:32,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:32,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:32,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:32,528 INFO L225 Difference]: With dead ends: 95 [2020-01-16 19:02:32,528 INFO L226 Difference]: Without dead ends: 74 [2020-01-16 19:02:32,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 19:02:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-01-16 19:02:32,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2020-01-16 19:02:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-01-16 19:02:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 103 transitions. [2020-01-16 19:02:32,530 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 103 transitions. Word has length 19 [2020-01-16 19:02:32,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:32,531 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 103 transitions. [2020-01-16 19:02:32,531 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:32,531 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 103 transitions. [2020-01-16 19:02:32,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:32,531 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:32,531 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:32,531 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 19:02:32,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:32,531 INFO L82 PathProgramCache]: Analyzing trace with hash 171031428, now seen corresponding path program 691 times [2020-01-16 19:02:32,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:32,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287789181] [2020-01-16 19:02:32,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:32,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287789181] [2020-01-16 19:02:32,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:32,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:32,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920528555] [2020-01-16 19:02:32,735 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:32,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:32,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:32,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:32,736 INFO L87 Difference]: Start difference. First operand 52 states and 103 transitions. Second operand 8 states. [2020-01-16 19:02:32,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:32,784 INFO L93 Difference]: Finished difference Result 101 states and 182 transitions. [2020-01-16 19:02:32,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:32,784 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:32,784 INFO L225 Difference]: With dead ends: 101 [2020-01-16 19:02:32,784 INFO L226 Difference]: Without dead ends: 91 [2020-01-16 19:02:32,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 19:02:32,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-01-16 19:02:32,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 56. [2020-01-16 19:02:32,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-01-16 19:02:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 113 transitions. [2020-01-16 19:02:32,786 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 113 transitions. Word has length 19 [2020-01-16 19:02:32,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:32,787 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 113 transitions. [2020-01-16 19:02:32,787 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 113 transitions. [2020-01-16 19:02:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:32,787 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:32,787 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:32,787 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 19:02:32,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:32,787 INFO L82 PathProgramCache]: Analyzing trace with hash -684275226, now seen corresponding path program 692 times [2020-01-16 19:02:32,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:32,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38642848] [2020-01-16 19:02:32,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:32,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 19:02:32,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38642848] [2020-01-16 19:02:32,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:32,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:32,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118469067] [2020-01-16 19:02:32,991 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:32,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:32,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:32,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:32,991 INFO L87 Difference]: Start difference. First operand 56 states and 113 transitions. Second operand 8 states. [2020-01-16 19:02:33,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:33,059 INFO L93 Difference]: Finished difference Result 103 states and 185 transitions. [2020-01-16 19:02:33,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:33,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:33,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:33,060 INFO L225 Difference]: With dead ends: 103 [2020-01-16 19:02:33,060 INFO L226 Difference]: Without dead ends: 89 [2020-01-16 19:02:33,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 19:02:33,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-01-16 19:02:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 54. [2020-01-16 19:02:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-01-16 19:02:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 108 transitions. [2020-01-16 19:02:33,062 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 108 transitions. Word has length 19 [2020-01-16 19:02:33,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:33,062 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 108 transitions. [2020-01-16 19:02:33,063 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 108 transitions. [2020-01-16 19:02:33,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:33,063 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:33,063 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:33,063 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 19:02:33,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:33,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1781972386, now seen corresponding path program 693 times [2020-01-16 19:02:33,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:33,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800126401] [2020-01-16 19:02:33,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:33,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800126401] [2020-01-16 19:02:33,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:33,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:33,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292366410] [2020-01-16 19:02:33,265 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:33,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:33,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:33,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:33,265 INFO L87 Difference]: Start difference. First operand 54 states and 108 transitions. Second operand 8 states. [2020-01-16 19:02:33,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:33,314 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2020-01-16 19:02:33,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:33,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:33,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:33,315 INFO L225 Difference]: With dead ends: 97 [2020-01-16 19:02:33,315 INFO L226 Difference]: Without dead ends: 87 [2020-01-16 19:02:33,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:33,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-01-16 19:02:33,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2020-01-16 19:02:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-01-16 19:02:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 111 transitions. [2020-01-16 19:02:33,317 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 111 transitions. Word has length 19 [2020-01-16 19:02:33,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:33,317 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 111 transitions. [2020-01-16 19:02:33,317 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:33,318 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 111 transitions. [2020-01-16 19:02:33,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:33,318 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:33,318 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:33,318 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 19:02:33,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:33,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1023589914, now seen corresponding path program 694 times [2020-01-16 19:02:33,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:33,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484725925] [2020-01-16 19:02:33,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:33,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:33,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484725925] [2020-01-16 19:02:33,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:33,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:33,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823837876] [2020-01-16 19:02:33,522 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:33,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:33,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:33,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:33,523 INFO L87 Difference]: Start difference. First operand 56 states and 111 transitions. Second operand 8 states. [2020-01-16 19:02:33,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:33,591 INFO L93 Difference]: Finished difference Result 91 states and 168 transitions. [2020-01-16 19:02:33,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:33,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:33,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:33,591 INFO L225 Difference]: With dead ends: 91 [2020-01-16 19:02:33,592 INFO L226 Difference]: Without dead ends: 76 [2020-01-16 19:02:33,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-01-16 19:02:33,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2020-01-16 19:02:33,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-01-16 19:02:33,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 106 transitions. [2020-01-16 19:02:33,593 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 106 transitions. Word has length 19 [2020-01-16 19:02:33,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:33,593 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 106 transitions. [2020-01-16 19:02:33,593 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:33,593 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 106 transitions. [2020-01-16 19:02:33,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:33,593 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:33,593 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:33,594 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 19:02:33,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:33,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1757360606, now seen corresponding path program 695 times [2020-01-16 19:02:33,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:33,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205401890] [2020-01-16 19:02:33,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:33,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205401890] [2020-01-16 19:02:33,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:33,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:33,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410098575] [2020-01-16 19:02:33,793 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:33,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:33,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:33,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:33,794 INFO L87 Difference]: Start difference. First operand 54 states and 106 transitions. Second operand 8 states. [2020-01-16 19:02:33,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:33,860 INFO L93 Difference]: Finished difference Result 84 states and 153 transitions. [2020-01-16 19:02:33,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:33,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:33,861 INFO L225 Difference]: With dead ends: 84 [2020-01-16 19:02:33,861 INFO L226 Difference]: Without dead ends: 72 [2020-01-16 19:02:33,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:33,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-01-16 19:02:33,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2020-01-16 19:02:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-01-16 19:02:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 114 transitions. [2020-01-16 19:02:33,863 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 114 transitions. Word has length 19 [2020-01-16 19:02:33,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:33,863 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 114 transitions. [2020-01-16 19:02:33,863 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 114 transitions. [2020-01-16 19:02:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:33,863 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:33,863 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:33,863 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 19:02:33,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:33,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1781972386, now seen corresponding path program 696 times [2020-01-16 19:02:33,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:33,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467232765] [2020-01-16 19:02:33,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:34,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:34,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467232765] [2020-01-16 19:02:34,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:34,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:34,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093426958] [2020-01-16 19:02:34,059 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:34,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:34,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:34,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:34,060 INFO L87 Difference]: Start difference. First operand 58 states and 114 transitions. Second operand 8 states. [2020-01-16 19:02:34,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:34,127 INFO L93 Difference]: Finished difference Result 71 states and 132 transitions. [2020-01-16 19:02:34,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:34,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:34,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:34,127 INFO L225 Difference]: With dead ends: 71 [2020-01-16 19:02:34,127 INFO L226 Difference]: Without dead ends: 50 [2020-01-16 19:02:34,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 19:02:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-01-16 19:02:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-01-16 19:02:34,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-01-16 19:02:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 99 transitions. [2020-01-16 19:02:34,129 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 99 transitions. Word has length 19 [2020-01-16 19:02:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:34,129 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 99 transitions. [2020-01-16 19:02:34,129 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 99 transitions. [2020-01-16 19:02:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:34,130 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:34,130 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:34,130 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 19:02:34,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:34,130 INFO L82 PathProgramCache]: Analyzing trace with hash -821726946, now seen corresponding path program 697 times [2020-01-16 19:02:34,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:34,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843391623] [2020-01-16 19:02:34,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:34,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 19:02:34,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843391623] [2020-01-16 19:02:34,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:34,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:34,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096061482] [2020-01-16 19:02:34,349 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:34,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:34,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:34,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:34,350 INFO L87 Difference]: Start difference. First operand 50 states and 99 transitions. Second operand 8 states. [2020-01-16 19:02:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:34,415 INFO L93 Difference]: Finished difference Result 83 states and 136 transitions. [2020-01-16 19:02:34,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:34,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:34,416 INFO L225 Difference]: With dead ends: 83 [2020-01-16 19:02:34,416 INFO L226 Difference]: Without dead ends: 73 [2020-01-16 19:02:34,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 19:02:34,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-01-16 19:02:34,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2020-01-16 19:02:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-01-16 19:02:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 100 transitions. [2020-01-16 19:02:34,418 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 100 transitions. Word has length 19 [2020-01-16 19:02:34,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:34,418 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 100 transitions. [2020-01-16 19:02:34,418 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 100 transitions. [2020-01-16 19:02:34,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:34,419 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:34,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:34,419 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 19:02:34,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:34,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1061369284, now seen corresponding path program 698 times [2020-01-16 19:02:34,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:34,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383784965] [2020-01-16 19:02:34,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:34,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 19:02:34,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383784965] [2020-01-16 19:02:34,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:34,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:34,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123868604] [2020-01-16 19:02:34,642 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:34,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:34,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:34,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:34,643 INFO L87 Difference]: Start difference. First operand 51 states and 100 transitions. Second operand 8 states. [2020-01-16 19:02:34,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:34,692 INFO L93 Difference]: Finished difference Result 83 states and 135 transitions. [2020-01-16 19:02:34,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:34,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:34,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:34,693 INFO L225 Difference]: With dead ends: 83 [2020-01-16 19:02:34,693 INFO L226 Difference]: Without dead ends: 72 [2020-01-16 19:02:34,693 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:34,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-01-16 19:02:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2020-01-16 19:02:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-01-16 19:02:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 98 transitions. [2020-01-16 19:02:34,695 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 98 transitions. Word has length 19 [2020-01-16 19:02:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:34,695 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 98 transitions. [2020-01-16 19:02:34,695 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 98 transitions. [2020-01-16 19:02:34,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:34,696 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:34,696 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:34,696 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 19:02:34,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:34,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1566429444, now seen corresponding path program 699 times [2020-01-16 19:02:34,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:34,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572833634] [2020-01-16 19:02:34,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:34,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 19:02:34,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572833634] [2020-01-16 19:02:34,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:34,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:34,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562121885] [2020-01-16 19:02:34,915 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:34,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:34,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:34,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:34,915 INFO L87 Difference]: Start difference. First operand 50 states and 98 transitions. Second operand 8 states. [2020-01-16 19:02:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:34,985 INFO L93 Difference]: Finished difference Result 86 states and 143 transitions. [2020-01-16 19:02:34,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:34,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:34,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:34,986 INFO L225 Difference]: With dead ends: 86 [2020-01-16 19:02:34,986 INFO L226 Difference]: Without dead ends: 76 [2020-01-16 19:02:34,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-01-16 19:02:34,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2020-01-16 19:02:34,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-01-16 19:02:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 101 transitions. [2020-01-16 19:02:34,988 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 101 transitions. Word has length 19 [2020-01-16 19:02:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:34,988 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 101 transitions. [2020-01-16 19:02:34,988 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:34,988 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 101 transitions. [2020-01-16 19:02:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:34,988 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:34,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 19:02:34,989 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 19:02:34,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:34,989 INFO L82 PathProgramCache]: Analyzing trace with hash 144183864, now seen corresponding path program 700 times [2020-01-16 19:02:34,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:34,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977567915] [2020-01-16 19:02:34,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:35,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 19:02:35,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977567915] [2020-01-16 19:02:35,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:35,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:35,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298455101] [2020-01-16 19:02:35,218 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:35,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:35,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:35,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:35,219 INFO L87 Difference]: Start difference. First operand 52 states and 101 transitions. Second operand 8 states. [2020-01-16 19:02:35,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:35,288 INFO L93 Difference]: Finished difference Result 88 states and 146 transitions. [2020-01-16 19:02:35,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:35,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:35,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:35,289 INFO L225 Difference]: With dead ends: 88 [2020-01-16 19:02:35,289 INFO L226 Difference]: Without dead ends: 74 [2020-01-16 19:02:35,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 19:02:35,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-01-16 19:02:35,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2020-01-16 19:02:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-01-16 19:02:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 97 transitions. [2020-01-16 19:02:35,291 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 97 transitions. Word has length 19 [2020-01-16 19:02:35,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:35,291 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 97 transitions. [2020-01-16 19:02:35,291 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:35,292 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 97 transitions. [2020-01-16 19:02:35,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:35,292 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:35,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 19:02:35,292 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 19:02:35,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:35,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2134454664, now seen corresponding path program 701 times [2020-01-16 19:02:35,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:35,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738035183] [2020-01-16 19:02:35,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:35,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 19:02:35,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738035183] [2020-01-16 19:02:35,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:35,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:35,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3468143] [2020-01-16 19:02:35,511 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:35,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:35,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:35,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:35,512 INFO L87 Difference]: Start difference. First operand 50 states and 97 transitions. Second operand 8 states. [2020-01-16 19:02:35,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:35,555 INFO L93 Difference]: Finished difference Result 86 states and 142 transitions. [2020-01-16 19:02:35,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:35,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:35,556 INFO L225 Difference]: With dead ends: 86 [2020-01-16 19:02:35,556 INFO L226 Difference]: Without dead ends: 76 [2020-01-16 19:02:35,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:35,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-01-16 19:02:35,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2020-01-16 19:02:35,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-01-16 19:02:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 100 transitions. [2020-01-16 19:02:35,558 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 100 transitions. Word has length 19 [2020-01-16 19:02:35,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:35,558 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 100 transitions. [2020-01-16 19:02:35,558 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 100 transitions. [2020-01-16 19:02:35,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:35,559 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:35,559 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:35,559 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 19:02:35,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:35,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1305205978, now seen corresponding path program 702 times [2020-01-16 19:02:35,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:35,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088280881] [2020-01-16 19:02:35,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:35,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 19:02:35,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088280881] [2020-01-16 19:02:35,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:35,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:35,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931863710] [2020-01-16 19:02:35,780 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:35,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:35,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:35,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:35,780 INFO L87 Difference]: Start difference. First operand 52 states and 100 transitions. Second operand 8 states. [2020-01-16 19:02:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:35,845 INFO L93 Difference]: Finished difference Result 88 states and 145 transitions. [2020-01-16 19:02:35,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:35,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:35,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:35,846 INFO L225 Difference]: With dead ends: 88 [2020-01-16 19:02:35,847 INFO L226 Difference]: Without dead ends: 73 [2020-01-16 19:02:35,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-01-16 19:02:35,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 49. [2020-01-16 19:02:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-01-16 19:02:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 95 transitions. [2020-01-16 19:02:35,848 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 95 transitions. Word has length 19 [2020-01-16 19:02:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:35,849 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 95 transitions. [2020-01-16 19:02:35,849 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 95 transitions. [2020-01-16 19:02:35,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:35,849 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:35,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 19:02:35,850 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 19:02:35,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:35,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1872802496, now seen corresponding path program 703 times [2020-01-16 19:02:35,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:35,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990749502] [2020-01-16 19:02:35,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:36,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 19:02:36,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990749502] [2020-01-16 19:02:36,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:36,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:36,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937864941] [2020-01-16 19:02:36,071 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:36,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:36,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:36,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:36,072 INFO L87 Difference]: Start difference. First operand 49 states and 95 transitions. Second operand 8 states. [2020-01-16 19:02:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:36,137 INFO L93 Difference]: Finished difference Result 81 states and 130 transitions. [2020-01-16 19:02:36,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:36,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:36,138 INFO L225 Difference]: With dead ends: 81 [2020-01-16 19:02:36,138 INFO L226 Difference]: Without dead ends: 71 [2020-01-16 19:02:36,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 19:02:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-01-16 19:02:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2020-01-16 19:02:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-01-16 19:02:36,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 94 transitions. [2020-01-16 19:02:36,140 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 94 transitions. Word has length 19 [2020-01-16 19:02:36,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:36,140 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 94 transitions. [2020-01-16 19:02:36,140 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:36,140 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 94 transitions. [2020-01-16 19:02:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:36,140 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:36,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:36,140 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 19:02:36,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:36,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1633160158, now seen corresponding path program 704 times [2020-01-16 19:02:36,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:36,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297612116] [2020-01-16 19:02:36,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:36,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 19:02:36,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297612116] [2020-01-16 19:02:36,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:36,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:36,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792230436] [2020-01-16 19:02:36,365 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:36,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:36,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:36,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:36,366 INFO L87 Difference]: Start difference. First operand 49 states and 94 transitions. Second operand 8 states. [2020-01-16 19:02:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:36,414 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2020-01-16 19:02:36,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:36,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:36,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:36,415 INFO L225 Difference]: With dead ends: 81 [2020-01-16 19:02:36,415 INFO L226 Difference]: Without dead ends: 70 [2020-01-16 19:02:36,415 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:36,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-01-16 19:02:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2020-01-16 19:02:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-01-16 19:02:36,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 92 transitions. [2020-01-16 19:02:36,417 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 92 transitions. Word has length 19 [2020-01-16 19:02:36,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:36,417 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 92 transitions. [2020-01-16 19:02:36,417 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 92 transitions. [2020-01-16 19:02:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:36,417 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:36,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 19:02:36,418 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 19:02:36,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:36,418 INFO L82 PathProgramCache]: Analyzing trace with hash 799717116, now seen corresponding path program 705 times [2020-01-16 19:02:36,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:36,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210614509] [2020-01-16 19:02:36,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:36,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 19:02:36,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210614509] [2020-01-16 19:02:36,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:36,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:36,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632691811] [2020-01-16 19:02:36,623 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:36,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:36,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:36,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:36,624 INFO L87 Difference]: Start difference. First operand 48 states and 92 transitions. Second operand 8 states. [2020-01-16 19:02:36,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:36,688 INFO L93 Difference]: Finished difference Result 83 states and 136 transitions. [2020-01-16 19:02:36,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:36,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:36,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:36,689 INFO L225 Difference]: With dead ends: 83 [2020-01-16 19:02:36,689 INFO L226 Difference]: Without dead ends: 73 [2020-01-16 19:02:36,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 19:02:36,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-01-16 19:02:36,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 50. [2020-01-16 19:02:36,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-01-16 19:02:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 95 transitions. [2020-01-16 19:02:36,691 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 95 transitions. Word has length 19 [2020-01-16 19:02:36,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:36,691 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 95 transitions. [2020-01-16 19:02:36,691 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 95 transitions. [2020-01-16 19:02:36,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:36,692 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:36,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 19:02:36,692 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 19:02:36,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:36,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1754696120, now seen corresponding path program 706 times [2020-01-16 19:02:36,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:36,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134991718] [2020-01-16 19:02:36,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:36,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134991718] [2020-01-16 19:02:36,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:36,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:36,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929084787] [2020-01-16 19:02:36,897 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:36,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:36,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:36,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:36,897 INFO L87 Difference]: Start difference. First operand 50 states and 95 transitions. Second operand 8 states. [2020-01-16 19:02:36,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:36,961 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2020-01-16 19:02:36,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:36,962 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:36,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:36,962 INFO L225 Difference]: With dead ends: 77 [2020-01-16 19:02:36,962 INFO L226 Difference]: Without dead ends: 62 [2020-01-16 19:02: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 19:02:36,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-01-16 19:02:36,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2020-01-16 19:02:36,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-01-16 19:02:36,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 91 transitions. [2020-01-16 19:02:36,964 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 91 transitions. Word has length 19 [2020-01-16 19:02:36,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:36,964 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 91 transitions. [2020-01-16 19:02:36,964 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 91 transitions. [2020-01-16 19:02:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:36,965 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:36,965 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:36,965 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 19:02:36,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:36,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2123951560, now seen corresponding path program 707 times [2020-01-16 19:02:36,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:36,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232805978] [2020-01-16 19:02:36,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:37,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 19:02:37,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232805978] [2020-01-16 19:02:37,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:37,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:37,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817590580] [2020-01-16 19:02:37,178 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:37,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:37,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:37,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:37,178 INFO L87 Difference]: Start difference. First operand 48 states and 91 transitions. Second operand 8 states. [2020-01-16 19:02:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:37,220 INFO L93 Difference]: Finished difference Result 83 states and 135 transitions. [2020-01-16 19:02:37,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:37,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:37,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:37,221 INFO L225 Difference]: With dead ends: 83 [2020-01-16 19:02:37,221 INFO L226 Difference]: Without dead ends: 73 [2020-01-16 19:02:37,221 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:37,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-01-16 19:02:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 50. [2020-01-16 19:02:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-01-16 19:02:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 94 transitions. [2020-01-16 19:02:37,222 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 94 transitions. Word has length 19 [2020-01-16 19:02:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:37,222 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 94 transitions. [2020-01-16 19:02:37,222 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 94 transitions. [2020-01-16 19:02:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:37,222 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:37,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 19:02:37,223 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 19:02:37,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:37,223 INFO L82 PathProgramCache]: Analyzing trace with hash -634546564, now seen corresponding path program 708 times [2020-01-16 19:02:37,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:37,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709088601] [2020-01-16 19:02:37,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:37,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709088601] [2020-01-16 19:02:37,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:37,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:37,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948181017] [2020-01-16 19:02:37,429 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:37,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:37,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:37,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:37,429 INFO L87 Difference]: Start difference. First operand 50 states and 94 transitions. Second operand 8 states. [2020-01-16 19:02:37,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:37,494 INFO L93 Difference]: Finished difference Result 77 states and 131 transitions. [2020-01-16 19:02:37,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:37,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:37,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:37,495 INFO L225 Difference]: With dead ends: 77 [2020-01-16 19:02:37,495 INFO L226 Difference]: Without dead ends: 61 [2020-01-16 19:02:37,495 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-01-16 19:02:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2020-01-16 19:02:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-01-16 19:02:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 89 transitions. [2020-01-16 19:02:37,497 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 89 transitions. Word has length 19 [2020-01-16 19:02:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:37,498 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 89 transitions. [2020-01-16 19:02:37,498 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 89 transitions. [2020-01-16 19:02:37,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:37,499 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:37,499 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:37,499 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 19:02:37,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:37,499 INFO L82 PathProgramCache]: Analyzing trace with hash -472337856, now seen corresponding path program 709 times [2020-01-16 19:02:37,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:37,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770476091] [2020-01-16 19:02:37,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:37,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 19:02:37,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770476091] [2020-01-16 19:02:37,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:37,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:37,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861315959] [2020-01-16 19:02:37,720 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:37,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:37,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:37,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:37,721 INFO L87 Difference]: Start difference. First operand 47 states and 89 transitions. Second operand 8 states. [2020-01-16 19:02:37,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:37,788 INFO L93 Difference]: Finished difference Result 79 states and 126 transitions. [2020-01-16 19:02:37,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:37,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:37,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:37,789 INFO L225 Difference]: With dead ends: 79 [2020-01-16 19:02:37,789 INFO L226 Difference]: Without dead ends: 69 [2020-01-16 19:02:37,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 19:02:37,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-01-16 19:02:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2020-01-16 19:02:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-01-16 19:02:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 87 transitions. [2020-01-16 19:02:37,792 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 87 transitions. Word has length 19 [2020-01-16 19:02:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:37,792 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 87 transitions. [2020-01-16 19:02:37,792 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 87 transitions. [2020-01-16 19:02:37,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:37,792 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:37,792 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:37,793 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 19:02:37,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:37,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1238275452, now seen corresponding path program 710 times [2020-01-16 19:02:37,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:37,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534099251] [2020-01-16 19:02:37,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:38,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534099251] [2020-01-16 19:02:38,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:38,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:38,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698391065] [2020-01-16 19:02:38,009 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:38,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:38,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:38,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:38,010 INFO L87 Difference]: Start difference. First operand 47 states and 87 transitions. Second operand 8 states. [2020-01-16 19:02:38,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:38,074 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2020-01-16 19:02:38,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:38,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:38,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:38,075 INFO L225 Difference]: With dead ends: 81 [2020-01-16 19:02:38,075 INFO L226 Difference]: Without dead ends: 67 [2020-01-16 19:02:38,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 19:02:38,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-01-16 19:02:38,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2020-01-16 19:02:38,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-01-16 19:02:38,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 82 transitions. [2020-01-16 19:02:38,077 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 82 transitions. Word has length 19 [2020-01-16 19:02:38,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:38,077 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 82 transitions. [2020-01-16 19:02:38,077 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:38,077 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 82 transitions. [2020-01-16 19:02:38,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:38,077 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:38,078 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:38,078 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 19:02:38,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:38,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1872802496, now seen corresponding path program 711 times [2020-01-16 19:02:38,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:38,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660023647] [2020-01-16 19:02:38,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:38,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 19:02:38,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660023647] [2020-01-16 19:02:38,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:38,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:38,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385929667] [2020-01-16 19:02:38,292 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:38,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:38,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:38,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:38,292 INFO L87 Difference]: Start difference. First operand 45 states and 82 transitions. Second operand 8 states. [2020-01-16 19:02:38,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:38,356 INFO L93 Difference]: Finished difference Result 76 states and 118 transitions. [2020-01-16 19:02:38,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:38,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:38,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:38,357 INFO L225 Difference]: With dead ends: 76 [2020-01-16 19:02:38,357 INFO L226 Difference]: Without dead ends: 66 [2020-01-16 19:02:38,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 19:02:38,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-01-16 19:02:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2020-01-16 19:02:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-01-16 19:02:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 77 transitions. [2020-01-16 19:02:38,359 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 77 transitions. Word has length 19 [2020-01-16 19:02:38,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:38,359 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 77 transitions. [2020-01-16 19:02:38,359 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:38,359 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 77 transitions. [2020-01-16 19:02:38,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:38,360 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:38,360 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:38,360 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 19:02:38,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:38,360 INFO L82 PathProgramCache]: Analyzing trace with hash 143755162, now seen corresponding path program 712 times [2020-01-16 19:02:38,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:38,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505573198] [2020-01-16 19:02:38,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:38,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 19:02:38,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505573198] [2020-01-16 19:02:38,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:38,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:38,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845458504] [2020-01-16 19:02:38,568 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:38,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:38,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:38,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:38,569 INFO L87 Difference]: Start difference. First operand 43 states and 77 transitions. Second operand 8 states. [2020-01-16 19:02:38,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:38,634 INFO L93 Difference]: Finished difference Result 70 states and 114 transitions. [2020-01-16 19:02:38,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:38,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:38,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:38,635 INFO L225 Difference]: With dead ends: 70 [2020-01-16 19:02:38,635 INFO L226 Difference]: Without dead ends: 55 [2020-01-16 19:02:38,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 19:02:38,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-01-16 19:02:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2020-01-16 19:02:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-01-16 19:02:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 72 transitions. [2020-01-16 19:02:38,637 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 72 transitions. Word has length 19 [2020-01-16 19:02:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:38,637 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 72 transitions. [2020-01-16 19:02:38,637 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 72 transitions. [2020-01-16 19:02:38,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:38,638 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:38,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 19:02:38,638 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 19:02:38,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:38,638 INFO L82 PathProgramCache]: Analyzing trace with hash 777853504, now seen corresponding path program 713 times [2020-01-16 19:02:38,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:38,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404170233] [2020-01-16 19:02:38,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:38,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:38,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404170233] [2020-01-16 19:02:38,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:38,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:38,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395960536] [2020-01-16 19:02:38,847 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:38,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:38,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:38,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:38,847 INFO L87 Difference]: Start difference. First operand 41 states and 72 transitions. Second operand 8 states. [2020-01-16 19:02:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:38,910 INFO L93 Difference]: Finished difference Result 71 states and 119 transitions. [2020-01-16 19:02:38,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:38,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:38,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:38,911 INFO L225 Difference]: With dead ends: 71 [2020-01-16 19:02:38,911 INFO L226 Difference]: Without dead ends: 59 [2020-01-16 19:02:38,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-01-16 19:02:38,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2020-01-16 19:02:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-01-16 19:02:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 80 transitions. [2020-01-16 19:02:38,913 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 80 transitions. Word has length 19 [2020-01-16 19:02:38,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:38,913 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 80 transitions. [2020-01-16 19:02:38,914 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:38,914 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 80 transitions. [2020-01-16 19:02:38,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:38,914 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:38,914 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:38,914 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 19:02:38,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:38,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1633160158, now seen corresponding path program 714 times [2020-01-16 19:02:38,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:38,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134186908] [2020-01-16 19:02:38,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:39,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 19:02:39,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134186908] [2020-01-16 19:02:39,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:39,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:39,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407743284] [2020-01-16 19:02:39,126 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:39,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:39,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:39,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:39,126 INFO L87 Difference]: Start difference. First operand 45 states and 80 transitions. Second operand 8 states. [2020-01-16 19:02:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:39,189 INFO L93 Difference]: Finished difference Result 58 states and 98 transitions. [2020-01-16 19:02:39,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:39,190 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:39,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:39,190 INFO L225 Difference]: With dead ends: 58 [2020-01-16 19:02:39,190 INFO L226 Difference]: Without dead ends: 39 [2020-01-16 19:02:39,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 19:02:39,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-01-16 19:02:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-01-16 19:02:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-01-16 19:02:39,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 68 transitions. [2020-01-16 19:02:39,192 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 68 transitions. Word has length 19 [2020-01-16 19:02:39,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:39,192 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 68 transitions. [2020-01-16 19:02:39,192 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:39,192 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2020-01-16 19:02:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:39,193 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02: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 19:02:39,193 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 19:02:39,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:39,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1654166366, now seen corresponding path program 715 times [2020-01-16 19:02:39,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:39,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069981078] [2020-01-16 19:02:39,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:39,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:39,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069981078] [2020-01-16 19:02:39,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:39,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:39,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537486395] [2020-01-16 19:02:39,416 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:39,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:39,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:39,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:39,417 INFO L87 Difference]: Start difference. First operand 39 states and 68 transitions. Second operand 8 states. [2020-01-16 19:02:39,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:39,459 INFO L93 Difference]: Finished difference Result 58 states and 88 transitions. [2020-01-16 19:02:39,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:39,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:39,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:39,460 INFO L225 Difference]: With dead ends: 58 [2020-01-16 19:02:39,460 INFO L226 Difference]: Without dead ends: 48 [2020-01-16 19:02:39,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 19:02:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-01-16 19:02:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2020-01-16 19:02:39,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-01-16 19:02:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2020-01-16 19:02:39,462 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 19 [2020-01-16 19:02:39,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:39,462 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2020-01-16 19:02:39,462 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2020-01-16 19:02:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:39,462 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:39,462 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:39,462 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 19:02:39,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:39,463 INFO L82 PathProgramCache]: Analyzing trace with hash 798859712, now seen corresponding path program 716 times [2020-01-16 19:02:39,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:39,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147232932] [2020-01-16 19:02:39,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:39,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 19:02:39,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147232932] [2020-01-16 19:02:39,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:39,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:39,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935975049] [2020-01-16 19:02:39,677 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:39,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:39,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:39,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:39,678 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand 8 states. [2020-01-16 19:02:39,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:39,738 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2020-01-16 19:02:39,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:39,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:39,739 INFO L225 Difference]: With dead ends: 60 [2020-01-16 19:02:39,739 INFO L226 Difference]: Without dead ends: 46 [2020-01-16 19:02:39,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 19:02:39,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-01-16 19:02:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2020-01-16 19:02:39,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-01-16 19:02:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 61 transitions. [2020-01-16 19:02:39,741 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 61 transitions. Word has length 19 [2020-01-16 19:02:39,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:39,741 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 61 transitions. [2020-01-16 19:02:39,741 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2020-01-16 19:02:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:39,742 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:39,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 19:02:39,742 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 19:02:39,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:39,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1029859972, now seen corresponding path program 717 times [2020-01-16 19:02:39,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:39,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257530683] [2020-01-16 19:02:39,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:39,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 19:02:39,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257530683] [2020-01-16 19:02:39,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:39,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:39,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332771004] [2020-01-16 19:02:39,961 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:39,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:39,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:39,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:39,961 INFO L87 Difference]: Start difference. First operand 37 states and 61 transitions. Second operand 8 states. [2020-01-16 19:02:40,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:40,001 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2020-01-16 19:02:40,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:40,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:40,002 INFO L225 Difference]: With dead ends: 54 [2020-01-16 19:02:40,002 INFO L226 Difference]: Without dead ends: 44 [2020-01-16 19:02:40,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-01-16 19:02:40,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-01-16 19:02:40,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2020-01-16 19:02:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-01-16 19:02:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2020-01-16 19:02:40,004 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 19 [2020-01-16 19:02:40,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:40,004 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2020-01-16 19:02:40,004 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:40,004 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2020-01-16 19:02:40,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:40,005 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:40,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 19:02:40,005 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 19:02:40,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:40,005 INFO L82 PathProgramCache]: Analyzing trace with hash 459545024, now seen corresponding path program 718 times [2020-01-16 19:02:40,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:40,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652992500] [2020-01-16 19:02:40,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:40,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652992500] [2020-01-16 19:02:40,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:40,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:40,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557600052] [2020-01-16 19:02:40,221 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:40,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:40,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:40,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:40,221 INFO L87 Difference]: Start difference. First operand 35 states and 56 transitions. Second operand 8 states. [2020-01-16 19:02:40,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:40,285 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2020-01-16 19:02:40,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:40,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:40,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:40,286 INFO L225 Difference]: With dead ends: 48 [2020-01-16 19:02:40,286 INFO L226 Difference]: Without dead ends: 33 [2020-01-16 19:02:40,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 19:02:40,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-01-16 19:02:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-01-16 19:02:40,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-01-16 19:02:40,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 51 transitions. [2020-01-16 19:02:40,288 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 51 transitions. Word has length 19 [2020-01-16 19:02:40,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:40,288 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 51 transitions. [2020-01-16 19:02:40,288 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:40,288 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 51 transitions. [2020-01-16 19:02:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:40,288 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:40,289 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 19:02:40,289 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 19:02:40,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:40,289 INFO L82 PathProgramCache]: Analyzing trace with hash -274225668, now seen corresponding path program 719 times [2020-01-16 19:02:40,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:40,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860949559] [2020-01-16 19:02:40,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:40,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 19:02:40,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860949559] [2020-01-16 19:02:40,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:40,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:40,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798822706] [2020-01-16 19:02:40,504 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:40,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:40,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:40,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:40,505 INFO L87 Difference]: Start difference. First operand 33 states and 51 transitions. Second operand 8 states. [2020-01-16 19:02:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:40,560 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2020-01-16 19:02:40,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:40,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:40,561 INFO L225 Difference]: With dead ends: 41 [2020-01-16 19:02:40,561 INFO L226 Difference]: Without dead ends: 29 [2020-01-16 19:02:40,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 19:02:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-01-16 19:02:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-01-16 19:02:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-01-16 19:02:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2020-01-16 19:02:40,562 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 19 [2020-01-16 19:02:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:40,562 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2020-01-16 19:02:40,562 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:40,563 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2020-01-16 19:02:40,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-01-16 19:02:40,563 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 19:02:40,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 19:02:40,563 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 19:02:40,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 19:02:40,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1029859972, now seen corresponding path program 720 times [2020-01-16 19:02:40,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 19:02:40,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046875347] [2020-01-16 19:02:40,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 19:02:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 19:02:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 19:02:40,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046875347] [2020-01-16 19:02:40,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 19:02:40,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-01-16 19:02:40,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365424916] [2020-01-16 19:02:40,770 INFO L458 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-01-16 19:02:40,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 19:02:40,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-01-16 19:02:40,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-01-16 19:02:40,771 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 8 states. [2020-01-16 19:02:40,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 19:02:40,824 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2020-01-16 19:02:40,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-01-16 19:02:40,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-01-16 19:02:40,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 19:02:40,825 INFO L225 Difference]: With dead ends: 28 [2020-01-16 19:02:40,825 INFO L226 Difference]: Without dead ends: 0 [2020-01-16 19:02:40,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 19:02:40,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-01-16 19:02:40,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-01-16 19:02:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-01-16 19:02:40,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-01-16 19:02:40,826 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-01-16 19:02:40,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 19:02:40,826 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-01-16 19:02:40,826 INFO L479 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-01-16 19:02:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-01-16 19:02:40,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-01-16 19:02:40,830 INFO L202 PluginConnector]: Adding new model example_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.01 07:02:40 BasicIcfg [2020-01-16 19:02:40,830 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-01-16 19:02:40,832 INFO L168 Benchmark]: Toolchain (without parser) took 217089.90 ms. Allocated memory was 146.3 MB in the beginning and 194.5 MB in the end (delta: 48.2 MB). Free memory was 121.3 MB in the beginning and 164.1 MB in the end (delta: -42.8 MB). Peak memory consumption was 88.0 MB. Max. memory is 7.1 GB. [2020-01-16 19:02:40,832 INFO L168 Benchmark]: Boogie PL CUP Parser took 1.30 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-01-16 19:02:40,832 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.16 ms. Allocated memory is still 146.3 MB. Free memory was 121.1 MB in the beginning and 119.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-01-16 19:02:40,833 INFO L168 Benchmark]: Boogie Preprocessor took 18.30 ms. Allocated memory is still 146.3 MB. Free memory was 119.6 MB in the beginning and 118.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-01-16 19:02:40,833 INFO L168 Benchmark]: RCFGBuilder took 295.92 ms. Allocated memory is still 146.3 MB. Free memory was 118.3 MB in the beginning and 106.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. [2020-01-16 19:02:40,834 INFO L168 Benchmark]: TraceAbstraction took 216736.85 ms. Allocated memory was 146.3 MB in the beginning and 194.5 MB in the end (delta: 48.2 MB). Free memory was 106.0 MB in the beginning and 164.1 MB in the end (delta: -58.1 MB). Peak memory consumption was 72.7 MB. Max. memory is 7.1 GB. [2020-01-16 19:02:40,835 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 1.30 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.16 ms. Allocated memory is still 146.3 MB. Free memory was 121.1 MB in the beginning and 119.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 18.30 ms. Allocated memory is still 146.3 MB. Free memory was 119.6 MB in the beginning and 118.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 295.92 ms. Allocated memory is still 146.3 MB. Free memory was 118.3 MB in the beginning and 106.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 216736.85 ms. Allocated memory was 146.3 MB in the beginning and 194.5 MB in the end (delta: 48.2 MB). Free memory was 106.0 MB in the beginning and 164.1 MB in the end (delta: -58.1 MB). Peak memory consumption was 72.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.3s, 52 ProgramPointsBefore, 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: 216.5s, OverallIterations: 724, TraceHistogramMax: 1, AutomataDifference: 59.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 48598 SDtfs, 89022 SDslu, 114886 SDs, 0 SdLazy, 25831 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5772 GetRequests, 728 SyntacticMatches, 0 SemanticMatches, 5044 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2880 ImplicationChecksByTransitivity, 168.5s 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, 148.0s 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...