./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb010ae024b402436affeb854f96a5f9e0df3d8ec2cfe8b3a7f33676b7169a2c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-13 00:47:38,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 00:47:38,266 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-11-13 00:47:38,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 00:47:38,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 00:47:38,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 00:47:38,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 00:47:38,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 00:47:38,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 00:47:38,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 00:47:38,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 00:47:38,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 00:47:38,300 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 00:47:38,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 00:47:38,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 00:47:38,302 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 00:47:38,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 00:47:38,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 00:47:38,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 00:47:38,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 00:47:38,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 00:47:38,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 00:47:38,306 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 00:47:38,306 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 00:47:38,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 00:47:38,307 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 00:47:38,307 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 00:47:38,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 00:47:38,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 00:47:38,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 00:47:38,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 00:47:38,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 00:47:38,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 00:47:38,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 00:47:38,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 00:47:38,309 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-13 00:47:38,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 00:47:38,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 00:47:38,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-13 00:47:38,310 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-13 00:47:38,311 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-13 00:47:38,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb010ae024b402436affeb854f96a5f9e0df3d8ec2cfe8b3a7f33676b7169a2c [2024-11-13 00:47:38,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 00:47:38,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 00:47:38,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 00:47:38,521 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 00:47:38,521 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 00:47:38,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i [2024-11-13 00:47:39,865 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 00:47:40,053 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 00:47:40,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i [2024-11-13 00:47:40,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d23f0aa5e/8a5a2434a930437b97ec23fa49a1d0cb/FLAGcd02636cc [2024-11-13 00:47:40,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d23f0aa5e/8a5a2434a930437b97ec23fa49a1d0cb [2024-11-13 00:47:40,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 00:47:40,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 00:47:40,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 00:47:40,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 00:47:40,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 00:47:40,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:47:40" (1/1) ... [2024-11-13 00:47:40,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e15fcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:40, skipping insertion in model container [2024-11-13 00:47:40,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:47:40" (1/1) ... [2024-11-13 00:47:40,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 00:47:40,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i[30176,30189] [2024-11-13 00:47:40,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 00:47:40,505 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 00:47:40,540 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i[30176,30189] [2024-11-13 00:47:40,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 00:47:40,586 INFO L204 MainTranslator]: Completed translation [2024-11-13 00:47:40,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:40 WrapperNode [2024-11-13 00:47:40,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 00:47:40,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 00:47:40,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 00:47:40,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 00:47:40,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:40" (1/1) ... [2024-11-13 00:47:40,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:40" (1/1) ... [2024-11-13 00:47:40,629 INFO L138 Inliner]: procedures = 170, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2024-11-13 00:47:40,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 00:47:40,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 00:47:40,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 00:47:40,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 00:47:40,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:40" (1/1) ... [2024-11-13 00:47:40,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:40" (1/1) ... [2024-11-13 00:47:40,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:40" (1/1) ... [2024-11-13 00:47:40,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:40" (1/1) ... [2024-11-13 00:47:40,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:40" (1/1) ... [2024-11-13 00:47:40,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:40" (1/1) ... [2024-11-13 00:47:40,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:40" (1/1) ... [2024-11-13 00:47:40,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:40" (1/1) ... [2024-11-13 00:47:40,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 00:47:40,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 00:47:40,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 00:47:40,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 00:47:40,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:40" (1/1) ... [2024-11-13 00:47:40,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 00:47:40,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 00:47:40,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 00:47:40,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 00:47:40,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 00:47:40,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 00:47:40,749 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-13 00:47:40,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 00:47:40,749 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-13 00:47:40,749 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-13 00:47:40,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 00:47:40,750 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-13 00:47:40,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 00:47:40,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 00:47:40,752 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 00:47:40,879 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 00:47:40,881 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 00:47:41,040 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 00:47:41,041 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 00:47:41,193 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 00:47:41,193 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-13 00:47:41,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:47:41 BoogieIcfgContainer [2024-11-13 00:47:41,194 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 00:47:41,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 00:47:41,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 00:47:41,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 00:47:41,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:47:40" (1/3) ... [2024-11-13 00:47:41,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a316e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:47:41, skipping insertion in model container [2024-11-13 00:47:41,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:40" (2/3) ... [2024-11-13 00:47:41,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a316e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:47:41, skipping insertion in model container [2024-11-13 00:47:41,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:47:41" (3/3) ... [2024-11-13 00:47:41,203 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_21-deref_read_racing.i [2024-11-13 00:47:41,216 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 00:47:41,216 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-13 00:47:41,216 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 00:47:41,246 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:47:41,292 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:47:41,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-13 00:47:41,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 00:47:41,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-13 00:47:41,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-13 00:47:41,317 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:47:41,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:47:41,334 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:47:41,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:47:41,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:41,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:41,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1692584478, now seen corresponding path program 1 times [2024-11-13 00:47:41,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:41,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416315420] [2024-11-13 00:47:41,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:41,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:47:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 00:47:41,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:47:41,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416315420] [2024-11-13 00:47:41,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416315420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:47:41,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:47:41,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:47:41,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858916961] [2024-11-13 00:47:41,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:47:41,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:47:41,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:47:41,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:47:41,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:47:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:41,850 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:47:41,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:47:41,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:42,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:42,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 00:47:42,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:42,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash -663212768, now seen corresponding path program 1 times [2024-11-13 00:47:42,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:42,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518378921] [2024-11-13 00:47:42,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:42,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:47:42,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:47:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:47:42,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:47:42,071 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:47:42,073 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:47:42,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:47:42,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 00:47:42,080 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-13 00:47:42,082 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:47:42,082 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-13 00:47:42,100 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:47:42,107 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:47:42,109 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:47:42,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:47:42,110 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:47:42,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:47:42,513 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:42,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:42,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1819121048, now seen corresponding path program 1 times [2024-11-13 00:47:42,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:42,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271063972] [2024-11-13 00:47:42,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:42,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:47:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 00:47:42,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:47:42,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271063972] [2024-11-13 00:47:42,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271063972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:47:42,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:47:42,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:47:42,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338579983] [2024-11-13 00:47:42,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:47:42,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:47:42,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:47:42,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:47:42,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:47:42,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:42,585 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:47:42,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:47:42,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:43,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:43,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 00:47:43,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:43,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:43,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1739599140, now seen corresponding path program 1 times [2024-11-13 00:47:43,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:43,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423944883] [2024-11-13 00:47:43,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:43,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:47:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 00:47:43,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:47:43,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423944883] [2024-11-13 00:47:43,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423944883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:47:43,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:47:43,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:47:43,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330966891] [2024-11-13 00:47:43,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:47:43,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:47:43,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:47:43,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:47:43,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:47:43,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:43,164 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:47:43,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:47:43,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:43,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:43,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:43,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:47:43,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 00:47:43,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:43,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:43,291 INFO L85 PathProgramCache]: Analyzing trace with hash -123511830, now seen corresponding path program 1 times [2024-11-13 00:47:43,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:43,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825533939] [2024-11-13 00:47:43,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:43,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:47:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 00:47:43,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:47:43,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825533939] [2024-11-13 00:47:43,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825533939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:47:43,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:47:43,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:47:43,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874813502] [2024-11-13 00:47:43,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:47:43,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:47:43,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:47:43,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:47:43,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:47:43,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:43,437 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:47:43,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:47:43,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:43,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:47:43,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:43,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:43,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:47:43,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:47:43,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 00:47:43,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:43,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:43,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1872493833, now seen corresponding path program 1 times [2024-11-13 00:47:43,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:43,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880807851] [2024-11-13 00:47:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:43,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:47:43,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:47:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:47:43,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:47:43,554 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:47:43,556 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:47:43,556 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:47:43,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 00:47:43,559 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 00:47:43,560 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:47:43,560 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-13 00:47:43,578 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:47:43,585 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:47:43,585 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:47:43,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:47:43,586 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:47:43,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:47:44,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:44,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:44,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1923104981, now seen corresponding path program 1 times [2024-11-13 00:47:44,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:44,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20359312] [2024-11-13 00:47:44,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:44,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:47:44,021 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 00:47:44,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:47:44,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20359312] [2024-11-13 00:47:44,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20359312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:47:44,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:47:44,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:47:44,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734594808] [2024-11-13 00:47:44,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:47:44,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:47:44,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:47:44,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:47:44,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:47:44,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:44,023 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:47:44,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:47:44,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:45,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:45,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 00:47:45,005 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:45,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:45,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1115763269, now seen corresponding path program 1 times [2024-11-13 00:47:45,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:45,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978575057] [2024-11-13 00:47:45,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:45,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:47:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 00:47:45,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:47:45,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978575057] [2024-11-13 00:47:45,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978575057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:47:45,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:47:45,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:47:45,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69451375] [2024-11-13 00:47:45,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:47:45,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:47:45,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:47:45,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:47:45,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:47:45,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:45,065 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:47:45,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:47:45,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:45,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:45,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:45,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:47:45,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 00:47:45,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:45,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:45,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1383296539, now seen corresponding path program 1 times [2024-11-13 00:47:45,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:45,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467089437] [2024-11-13 00:47:45,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:45,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:47:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 00:47:45,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:47:45,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467089437] [2024-11-13 00:47:45,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467089437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:47:45,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:47:45,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:47:45,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431073374] [2024-11-13 00:47:45,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:47:45,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:47:45,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:47:45,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:47:45,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:47:45,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:45,378 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:47:45,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:47:45,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:45,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:47:45,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:45,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:45,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:47:45,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:47:45,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 00:47:45,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:45,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:45,569 INFO L85 PathProgramCache]: Analyzing trace with hash 721518149, now seen corresponding path program 1 times [2024-11-13 00:47:45,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:45,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012226516] [2024-11-13 00:47:45,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:45,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:47:45,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:47:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:47:45,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:47:45,614 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:47:45,615 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:47:45,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:47:45,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 00:47:45,618 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 00:47:45,618 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:47:45,618 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-13 00:47:45,639 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:47:45,644 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:47:45,644 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:47:45,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:47:45,645 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:47:45,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:47:46,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:46,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:46,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1435964885, now seen corresponding path program 1 times [2024-11-13 00:47:46,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:46,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926113105] [2024-11-13 00:47:46,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:46,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:47:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 00:47:46,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:47:46,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926113105] [2024-11-13 00:47:46,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926113105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:47:46,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:47:46,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:47:46,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366251040] [2024-11-13 00:47:46,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:47:46,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:47:46,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:47:46,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:47:46,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:47:46,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:46,229 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:47:46,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:47:46,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:47,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:47,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 00:47:47,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:47,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:47,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2009193831, now seen corresponding path program 1 times [2024-11-13 00:47:47,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:47,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955875742] [2024-11-13 00:47:47,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:47,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:47:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 00:47:47,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:47:47,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955875742] [2024-11-13 00:47:47,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955875742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:47:47,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:47:47,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:47:47,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77874437] [2024-11-13 00:47:47,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:47:47,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:47:47,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:47:47,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:47:47,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:47:47,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:47,902 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:47:47,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:47:47,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:47,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:48,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:47:48,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 00:47:48,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:48,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:48,144 INFO L85 PathProgramCache]: Analyzing trace with hash 100656342, now seen corresponding path program 1 times [2024-11-13 00:47:48,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:48,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252004945] [2024-11-13 00:47:48,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:48,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:47:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 00:47:48,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:47:48,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252004945] [2024-11-13 00:47:48,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252004945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:47:48,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:47:48,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:47:48,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731109796] [2024-11-13 00:47:48,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:47:48,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:47:48,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:47:48,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:47:48,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:47:48,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:48,234 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:47:48,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:47:48,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:48,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:47:48,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:48,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:48,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:47:48,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:47:48,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 00:47:48,499 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:48,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:48,500 INFO L85 PathProgramCache]: Analyzing trace with hash 395977258, now seen corresponding path program 1 times [2024-11-13 00:47:48,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:48,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448650518] [2024-11-13 00:47:48,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:48,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:47:48,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:47:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:47:48,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:47:48,529 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:47:48,529 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:47:48,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:47:48,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 00:47:48,531 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 00:47:48,531 WARN L244 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:47:48,531 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-13 00:47:48,552 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:47:48,556 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:47:48,558 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:47:48,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:47:48,559 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:47:48,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:47:49,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:49,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:49,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1925758020, now seen corresponding path program 1 times [2024-11-13 00:47:49,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:49,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434895749] [2024-11-13 00:47:49,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:49,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:47:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 00:47:49,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:47:49,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434895749] [2024-11-13 00:47:49,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434895749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:47:49,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:47:49,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:47:49,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894502644] [2024-11-13 00:47:49,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:47:49,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:47:49,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:47:49,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:47:49,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:47:49,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:49,540 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:47:49,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:47:49,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:51,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:51,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 00:47:51,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:51,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:51,711 INFO L85 PathProgramCache]: Analyzing trace with hash 6148188, now seen corresponding path program 1 times [2024-11-13 00:47:51,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:51,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245205009] [2024-11-13 00:47:51,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:51,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:47:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 00:47:51,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:47:51,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245205009] [2024-11-13 00:47:51,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245205009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:47:51,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:47:51,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:47:51,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006420824] [2024-11-13 00:47:51,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:47:51,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:47:51,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:47:51,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:47:51,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:47:51,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:51,802 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:47:51,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:47:51,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:51,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:52,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:47:52,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 00:47:52,274 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:52,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:52,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2079373460, now seen corresponding path program 1 times [2024-11-13 00:47:52,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:52,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603596003] [2024-11-13 00:47:52,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:52,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:47:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 00:47:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:47:52,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603596003] [2024-11-13 00:47:52,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603596003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:47:52,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:47:52,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:47:52,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279073681] [2024-11-13 00:47:52,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:47:52,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:47:52,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:47:52,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:47:52,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:47:52,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:52,482 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:47:52,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:47:52,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:52,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:47:52,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:52,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:52,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:47:52,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:47:52,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 00:47:52,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:52,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:52,857 INFO L85 PathProgramCache]: Analyzing trace with hash -776772534, now seen corresponding path program 1 times [2024-11-13 00:47:52,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:52,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572582418] [2024-11-13 00:47:52,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:52,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:47:52,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:47:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:47:52,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:47:52,900 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:47:52,900 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:47:52,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:47:52,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 00:47:52,902 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 00:47:52,904 WARN L244 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:47:52,904 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-11-13 00:47:52,935 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:47:52,940 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:47:52,940 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:47:52,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:47:52,941 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:47:52,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:47:54,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:54,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1309766798, now seen corresponding path program 1 times [2024-11-13 00:47:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:54,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35693965] [2024-11-13 00:47:54,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:54,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:47:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 00:47:54,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:47:54,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35693965] [2024-11-13 00:47:54,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35693965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:47:54,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:47:54,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:47:54,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601387367] [2024-11-13 00:47:54,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:47:54,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:47:54,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:47:54,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:47:54,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:47:54,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:54,093 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:47:54,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:47:54,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:56,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:56,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 00:47:56,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:56,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:56,885 INFO L85 PathProgramCache]: Analyzing trace with hash 131798847, now seen corresponding path program 1 times [2024-11-13 00:47:56,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:56,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515564302] [2024-11-13 00:47:56,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:56,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:47:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 00:47:56,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:47:56,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515564302] [2024-11-13 00:47:56,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515564302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:47:56,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:47:56,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:47:56,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001369184] [2024-11-13 00:47:56,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:47:56,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:47:56,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:47:56,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:47:56,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:47:56,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:56,959 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:47:56,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:47:56,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:56,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:57,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:57,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:47:57,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 00:47:57,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:57,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:57,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1436999730, now seen corresponding path program 1 times [2024-11-13 00:47:57,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:57,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906621203] [2024-11-13 00:47:57,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:57,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:47:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 00:47:57,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:47:57,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906621203] [2024-11-13 00:47:57,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906621203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:47:57,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:47:57,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:47:57,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393508441] [2024-11-13 00:47:57,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:47:57,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:47:57,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:47:57,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:47:57,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:47:57,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:57,754 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:47:57,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:47:57,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:57,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:47:57,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:58,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:47:58,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:47:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:47:58,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 00:47:58,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:47:58,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:47:58,518 INFO L85 PathProgramCache]: Analyzing trace with hash 189644694, now seen corresponding path program 1 times [2024-11-13 00:47:58,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:47:58,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828456935] [2024-11-13 00:47:58,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:47:58,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:47:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:47:58,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:47:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:47:58,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:47:58,557 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:47:58,558 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:47:58,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:47:58,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 00:47:58,560 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 00:47:58,562 WARN L244 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:47:58,562 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-11-13 00:47:58,581 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:47:58,583 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:47:58,583 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:47:58,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:47:58,584 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:47:58,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:48:00,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:00,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:00,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1397668841, now seen corresponding path program 1 times [2024-11-13 00:48:00,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:00,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776795774] [2024-11-13 00:48:00,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:00,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:48:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-13 00:48:00,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:48:00,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776795774] [2024-11-13 00:48:00,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776795774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:48:00,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:48:00,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:48:00,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25007718] [2024-11-13 00:48:00,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:48:00,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:48:00,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:48:00,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:48:00,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:48:00,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:00,226 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:48:00,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:48:00,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:04,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:04,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 00:48:04,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:04,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:04,081 INFO L85 PathProgramCache]: Analyzing trace with hash -827081577, now seen corresponding path program 1 times [2024-11-13 00:48:04,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:04,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454150912] [2024-11-13 00:48:04,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:04,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:48:04,211 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 00:48:04,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:48:04,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454150912] [2024-11-13 00:48:04,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454150912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:48:04,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:48:04,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:48:04,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168345358] [2024-11-13 00:48:04,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:48:04,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:48:04,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:48:04,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:48:04,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:48:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:04,212 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:48:04,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:48:04,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:04,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:48:04,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 00:48:04,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:04,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:04,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1907023677, now seen corresponding path program 1 times [2024-11-13 00:48:04,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:04,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093145694] [2024-11-13 00:48:04,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:04,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:48:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-13 00:48:05,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:48:05,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093145694] [2024-11-13 00:48:05,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093145694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:48:05,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:48:05,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:48:05,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315254524] [2024-11-13 00:48:05,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:48:05,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:48:05,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:48:05,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:48:05,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:48:05,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:05,037 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:48:05,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:48:05,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:05,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:48:05,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:05,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:05,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:48:05,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:48:05,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 00:48:05,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:05,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:05,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1019630604, now seen corresponding path program 1 times [2024-11-13 00:48:05,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:05,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143111764] [2024-11-13 00:48:05,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:05,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:48:05,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:48:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:48:05,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:48:05,823 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:48:05,823 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:48:05,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:48:05,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 00:48:05,825 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 00:48:05,825 WARN L244 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:48:05,825 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-11-13 00:48:05,849 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:48:05,851 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:48:05,853 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:48:05,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:48:05,854 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:48:05,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:48:07,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:07,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:07,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1386569013, now seen corresponding path program 1 times [2024-11-13 00:48:07,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:07,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334204515] [2024-11-13 00:48:07,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:07,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:48:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-13 00:48:07,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:48:07,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334204515] [2024-11-13 00:48:07,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334204515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:48:07,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:48:07,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:48:07,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134388254] [2024-11-13 00:48:07,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:48:07,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:48:07,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:48:07,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:48:07,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:48:07,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:07,777 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:48:07,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:48:07,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:12,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:12,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 00:48:12,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:12,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash -852309, now seen corresponding path program 1 times [2024-11-13 00:48:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:12,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015384963] [2024-11-13 00:48:12,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:12,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:48:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-13 00:48:12,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:48:12,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015384963] [2024-11-13 00:48:12,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015384963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:48:12,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:48:12,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:48:12,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246481565] [2024-11-13 00:48:12,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:48:12,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:48:12,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:48:12,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:48:12,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:48:12,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:12,445 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:48:12,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:48:12,445 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:12,445 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:13,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:13,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:48:13,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 00:48:13,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:13,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:13,276 INFO L85 PathProgramCache]: Analyzing trace with hash -810553223, now seen corresponding path program 1 times [2024-11-13 00:48:13,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:13,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201361043] [2024-11-13 00:48:13,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:13,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:48:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-13 00:48:13,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:48:13,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201361043] [2024-11-13 00:48:13,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201361043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:48:13,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:48:13,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:48:13,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006258622] [2024-11-13 00:48:13,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:48:13,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:48:13,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:48:13,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:48:13,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:48:13,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:13,511 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:48:13,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:48:13,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:13,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:48:13,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:14,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:14,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:48:14,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:48:14,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 00:48:14,459 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:14,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:14,460 INFO L85 PathProgramCache]: Analyzing trace with hash 576732941, now seen corresponding path program 1 times [2024-11-13 00:48:14,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:14,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283722992] [2024-11-13 00:48:14,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:14,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:48:14,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:48:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:48:14,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:48:14,503 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:48:14,503 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:48:14,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:48:14,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 00:48:14,506 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 00:48:14,506 WARN L244 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:48:14,506 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-11-13 00:48:14,528 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:48:14,530 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:48:14,531 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:48:14,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:48:14,532 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:48:14,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:48:16,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:16,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:16,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1723892674, now seen corresponding path program 1 times [2024-11-13 00:48:16,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:16,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962990472] [2024-11-13 00:48:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:16,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:48:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 00:48:16,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:48:16,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962990472] [2024-11-13 00:48:16,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962990472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:48:16,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:48:16,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:48:16,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753268957] [2024-11-13 00:48:16,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:48:16,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:48:16,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:48:16,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:48:16,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:48:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:16,821 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:48:16,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:48:16,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:22,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:22,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 00:48:22,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:22,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:22,366 INFO L85 PathProgramCache]: Analyzing trace with hash -631523190, now seen corresponding path program 1 times [2024-11-13 00:48:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:22,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666461343] [2024-11-13 00:48:22,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:48:22,455 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-13 00:48:22,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:48:22,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666461343] [2024-11-13 00:48:22,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666461343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:48:22,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:48:22,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:48:22,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731755297] [2024-11-13 00:48:22,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:48:22,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:48:22,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:48:22,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:48:22,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:48:22,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:22,457 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:48:22,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:48:22,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:22,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:48:23,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 00:48:23,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:23,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:23,414 INFO L85 PathProgramCache]: Analyzing trace with hash -625145558, now seen corresponding path program 1 times [2024-11-13 00:48:23,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:23,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244686392] [2024-11-13 00:48:23,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:23,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:48:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-13 00:48:23,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:48:23,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244686392] [2024-11-13 00:48:23,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244686392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:48:23,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:48:23,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:48:23,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580950827] [2024-11-13 00:48:23,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:48:23,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:48:23,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:48:23,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:48:23,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:48:23,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:23,638 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:48:23,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:48:23,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:23,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:48:23,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:24,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:24,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:48:24,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:48:24,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 00:48:24,967 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:24,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:24,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1837376441, now seen corresponding path program 1 times [2024-11-13 00:48:24,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:24,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247641104] [2024-11-13 00:48:24,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:24,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:48:24,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:48:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:48:25,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:48:25,038 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:48:25,038 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:48:25,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:48:25,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 00:48:25,040 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 00:48:25,041 WARN L244 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:48:25,041 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-11-13 00:48:25,065 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:48:25,067 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:48:25,068 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:48:25,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:48:25,068 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:48:25,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:48:27,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:27,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash -334066332, now seen corresponding path program 1 times [2024-11-13 00:48:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:27,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714700950] [2024-11-13 00:48:27,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:48:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-13 00:48:27,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:48:27,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714700950] [2024-11-13 00:48:27,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714700950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:48:27,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:48:27,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:48:27,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591642279] [2024-11-13 00:48:27,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:48:27,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:48:27,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:48:27,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:48:27,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:48:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:27,678 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:48:27,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:48:27,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:34,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:34,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-13 00:48:34,498 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:34,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:34,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1321465088, now seen corresponding path program 1 times [2024-11-13 00:48:34,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:34,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729021376] [2024-11-13 00:48:34,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:34,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:48:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-13 00:48:34,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:48:34,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729021376] [2024-11-13 00:48:34,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729021376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:48:34,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:48:34,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:48:34,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552585332] [2024-11-13 00:48:34,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:48:34,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:48:34,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:48:34,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:48:34,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:48:34,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:34,635 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:48:34,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:48:34,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:34,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:35,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:48:35,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-13 00:48:35,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:35,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:35,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1626083342, now seen corresponding path program 1 times [2024-11-13 00:48:35,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:35,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351390963] [2024-11-13 00:48:35,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:35,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:48:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-13 00:48:35,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:48:35,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351390963] [2024-11-13 00:48:35,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351390963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:48:35,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:48:35,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:48:35,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468169011] [2024-11-13 00:48:35,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:48:35,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:48:35,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:48:35,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:48:35,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:48:35,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:35,931 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:48:35,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:48:35,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:35,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:48:35,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:37,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:37,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:48:37,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:48:37,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 00:48:37,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:37,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:37,445 INFO L85 PathProgramCache]: Analyzing trace with hash 320948095, now seen corresponding path program 1 times [2024-11-13 00:48:37,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:37,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422744387] [2024-11-13 00:48:37,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:48:37,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:48:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:48:37,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:48:37,667 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:48:37,667 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:48:37,667 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:48:37,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-13 00:48:37,673 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 00:48:37,675 WARN L244 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:48:37,675 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-11-13 00:48:37,741 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:48:37,743 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:48:37,748 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:48:37,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:48:37,749 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:48:37,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:48:41,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:41,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:41,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1870959511, now seen corresponding path program 1 times [2024-11-13 00:48:41,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:41,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218727563] [2024-11-13 00:48:41,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:41,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:48:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-13 00:48:41,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:48:41,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218727563] [2024-11-13 00:48:41,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218727563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:48:41,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:48:41,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:48:41,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21463292] [2024-11-13 00:48:41,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:48:41,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:48:41,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:48:41,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:48:41,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:48:41,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:41,134 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:48:41,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:48:41,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:49,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:49,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-13 00:48:49,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:49,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:49,415 INFO L85 PathProgramCache]: Analyzing trace with hash 357463340, now seen corresponding path program 1 times [2024-11-13 00:48:49,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:49,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751893725] [2024-11-13 00:48:49,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:49,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:48:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-13 00:48:49,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:48:49,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751893725] [2024-11-13 00:48:49,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751893725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:48:49,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:48:49,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:48:49,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558018904] [2024-11-13 00:48:49,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:48:49,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:48:49,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:48:49,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:48:49,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:48:49,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:49,524 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:48:49,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:48:49,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:49,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:50,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:50,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:48:50,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-13 00:48:50,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:50,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:50,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1405931762, now seen corresponding path program 1 times [2024-11-13 00:48:50,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:50,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924908316] [2024-11-13 00:48:50,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:50,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:48:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 00:48:51,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:48:51,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924908316] [2024-11-13 00:48:51,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924908316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:48:51,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:48:51,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:48:51,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243626477] [2024-11-13 00:48:51,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:48:51,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:48:51,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:48:51,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:48:51,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:48:51,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:51,248 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:48:51,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:48:51,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:51,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:48:51,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:53,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:53,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:48:53,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:48:53,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-13 00:48:53,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:53,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:53,352 INFO L85 PathProgramCache]: Analyzing trace with hash 939265478, now seen corresponding path program 1 times [2024-11-13 00:48:53,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:53,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551574577] [2024-11-13 00:48:53,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:53,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:48:53,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:48:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:48:53,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:48:53,401 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:48:53,402 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:48:53,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:48:53,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-13 00:48:53,403 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 00:48:53,403 WARN L244 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:48:53,404 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-11-13 00:48:53,429 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:48:53,433 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:48:53,435 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:48:53,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:48:53,435 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:48:53,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:48:57,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:48:57,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:48:57,706 INFO L85 PathProgramCache]: Analyzing trace with hash 247079591, now seen corresponding path program 1 times [2024-11-13 00:48:57,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:48:57,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247818857] [2024-11-13 00:48:57,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:48:57,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:48:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:48:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-13 00:48:57,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:48:57,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247818857] [2024-11-13 00:48:57,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247818857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:48:57,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:48:57,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:48:57,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319574585] [2024-11-13 00:48:57,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:48:57,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:48:57,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:48:57,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:48:57,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:48:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:48:57,738 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:48:57,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:48:57,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:06,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:06,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-13 00:49:06,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:49:06,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:49:06,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1423874681, now seen corresponding path program 1 times [2024-11-13 00:49:06,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:49:06,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006758262] [2024-11-13 00:49:06,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:49:06,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:49:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:49:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-13 00:49:06,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:49:06,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006758262] [2024-11-13 00:49:06,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006758262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:49:06,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:49:06,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:49:06,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794244519] [2024-11-13 00:49:06,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:49:06,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:49:06,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:49:06,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:49:06,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:49:06,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:06,864 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:49:06,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:49:06,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:06,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:08,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:08,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:49:08,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-13 00:49:08,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:49:08,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:49:08,401 INFO L85 PathProgramCache]: Analyzing trace with hash -688099121, now seen corresponding path program 1 times [2024-11-13 00:49:08,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:49:08,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975674101] [2024-11-13 00:49:08,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:49:08,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:49:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:49:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-13 00:49:08,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:49:08,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975674101] [2024-11-13 00:49:08,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975674101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:49:08,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:49:08,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:49:08,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327926589] [2024-11-13 00:49:08,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:49:08,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:49:08,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:49:08,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:49:08,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:49:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:08,571 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:49:08,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 4 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:49:08,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:08,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:49:08,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:11,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:11,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:49:11,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:49:11,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-13 00:49:11,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:49:11,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:49:11,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1720839034, now seen corresponding path program 1 times [2024-11-13 00:49:11,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:49:11,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83518686] [2024-11-13 00:49:11,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:49:11,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:49:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:49:11,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:49:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:49:11,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:49:11,349 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:49:11,349 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:49:11,349 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:49:11,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-13 00:49:11,351 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 00:49:11,351 WARN L244 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:49:11,351 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-11-13 00:49:11,380 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:49:11,382 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:49:11,383 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:49:11,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:49:11,383 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:49:11,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:49:15,413 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:49:15,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:49:15,414 INFO L85 PathProgramCache]: Analyzing trace with hash 92991132, now seen corresponding path program 1 times [2024-11-13 00:49:15,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:49:15,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050037451] [2024-11-13 00:49:15,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:49:15,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:49:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:49:15,442 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-13 00:49:15,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:49:15,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050037451] [2024-11-13 00:49:15,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050037451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:49:15,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:49:15,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:49:15,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099594198] [2024-11-13 00:49:15,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:49:15,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:49:15,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:49:15,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:49:15,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:49:15,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:15,444 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:49:15,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:49:15,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:26,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:26,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-13 00:49:26,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:49:26,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:49:26,148 INFO L85 PathProgramCache]: Analyzing trace with hash -77845005, now seen corresponding path program 1 times [2024-11-13 00:49:26,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:49:26,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994829356] [2024-11-13 00:49:26,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:49:26,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:49:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:49:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-13 00:49:26,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:49:26,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994829356] [2024-11-13 00:49:26,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994829356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:49:26,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:49:26,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:49:26,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193684116] [2024-11-13 00:49:26,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:49:26,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:49:26,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:49:26,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:49:26,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:49:26,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:26,333 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:49:26,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:49:26,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:26,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:28,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:28,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:49:28,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-13 00:49:28,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:49:28,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:49:28,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1972159717, now seen corresponding path program 1 times [2024-11-13 00:49:28,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:49:28,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475790504] [2024-11-13 00:49:28,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:49:28,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:49:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:49:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-11-13 00:49:28,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:49:28,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475790504] [2024-11-13 00:49:28,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475790504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:49:28,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:49:28,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:49:28,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542060410] [2024-11-13 00:49:28,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:49:28,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:49:28,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:49:28,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:49:28,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:49:28,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:28,291 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:49:28,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 4 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:49:28,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:28,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:49:28,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:31,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:31,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:49:31,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:49:31,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-13 00:49:31,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:49:31,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:49:31,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1114277565, now seen corresponding path program 1 times [2024-11-13 00:49:31,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:49:31,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420152476] [2024-11-13 00:49:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:49:31,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:49:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:49:31,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:49:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:49:31,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:49:31,239 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:49:31,240 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:49:31,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:49:31,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-13 00:49:31,242 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 00:49:31,242 WARN L244 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:49:31,242 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-11-13 00:49:31,275 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:49:31,278 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:49:31,278 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:49:31,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:49:31,279 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:49:31,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:49:36,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:49:36,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:49:36,217 INFO L85 PathProgramCache]: Analyzing trace with hash 614736534, now seen corresponding path program 1 times [2024-11-13 00:49:36,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:49:36,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600732547] [2024-11-13 00:49:36,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:49:36,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:49:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:49:36,241 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-13 00:49:36,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:49:36,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600732547] [2024-11-13 00:49:36,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600732547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:49:36,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:49:36,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:49:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059919568] [2024-11-13 00:49:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:49:36,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:49:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:49:36,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:49:36,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:49:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:36,243 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:49:36,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:49:36,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:48,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:48,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-13 00:49:48,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:49:48,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:49:48,773 INFO L85 PathProgramCache]: Analyzing trace with hash -867768943, now seen corresponding path program 1 times [2024-11-13 00:49:48,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:49:48,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752207228] [2024-11-13 00:49:48,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:49:48,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:49:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:49:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-13 00:49:49,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:49:49,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752207228] [2024-11-13 00:49:49,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752207228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:49:49,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:49:49,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:49:49,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425519639] [2024-11-13 00:49:49,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:49:49,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:49:49,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:49:49,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:49:49,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:49:49,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:49,031 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:49:49,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:49:49,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:49,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:50,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:50,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:49:50,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-13 00:49:50,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:49:50,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:49:50,904 INFO L85 PathProgramCache]: Analyzing trace with hash -249046335, now seen corresponding path program 1 times [2024-11-13 00:49:50,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:49:50,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792228271] [2024-11-13 00:49:50,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:49:50,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:49:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:49:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2024-11-13 00:49:51,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:49:51,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792228271] [2024-11-13 00:49:51,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792228271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:49:51,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:49:51,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:49:51,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146716855] [2024-11-13 00:49:51,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:49:51,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:49:51,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:49:51,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:49:51,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:49:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:51,098 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:49:51,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:49:51,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:51,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:49:51,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:49:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:49:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:49:55,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-13 00:49:55,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:49:55,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:49:55,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2119096465, now seen corresponding path program 1 times [2024-11-13 00:49:55,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:49:55,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307459347] [2024-11-13 00:49:55,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:49:55,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:49:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:49:55,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:49:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:49:55,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:49:55,144 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:49:55,144 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:49:55,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:49:55,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-13 00:49:55,146 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-13 00:49:55,147 WARN L244 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:49:55,147 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-11-13 00:49:55,182 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:49:55,185 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:49:55,185 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:49:55,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:49:55,186 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:49:55,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:50:00,675 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:50:00,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:50:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2073138693, now seen corresponding path program 1 times [2024-11-13 00:50:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:50:00,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428463173] [2024-11-13 00:50:00,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:50:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:50:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:50:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-13 00:50:00,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:50:00,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428463173] [2024-11-13 00:50:00,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428463173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:50:00,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:50:00,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:50:00,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200355909] [2024-11-13 00:50:00,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:50:00,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:50:00,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:50:00,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:50:00,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:50:00,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:00,717 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:50:00,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:50:00,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:15,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:15,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-13 00:50:15,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:50:15,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:50:15,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1427578327, now seen corresponding path program 1 times [2024-11-13 00:50:15,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:50:15,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560689717] [2024-11-13 00:50:15,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:50:15,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:50:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:50:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-11-13 00:50:15,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:50:15,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560689717] [2024-11-13 00:50:15,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560689717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:50:15,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:50:15,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:50:15,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611537254] [2024-11-13 00:50:15,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:50:15,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:50:15,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:50:15,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:50:15,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:50:15,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:15,126 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:50:15,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:50:15,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:15,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:50:17,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-13 00:50:17,151 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:50:17,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:50:17,152 INFO L85 PathProgramCache]: Analyzing trace with hash 109955497, now seen corresponding path program 2 times [2024-11-13 00:50:17,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:50:17,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932913251] [2024-11-13 00:50:17,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:50:17,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:50:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:50:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-11-13 00:50:17,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:50:17,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932913251] [2024-11-13 00:50:17,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932913251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:50:17,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:50:17,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:50:17,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591492356] [2024-11-13 00:50:17,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:50:17,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:50:17,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:50:17,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:50:17,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:50:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:17,362 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:50:17,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:50:17,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:17,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:50:17,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:21,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:21,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:50:21,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:50:21,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-13 00:50:21,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:50:21,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:50:21,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1016574675, now seen corresponding path program 1 times [2024-11-13 00:50:21,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:50:21,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14896789] [2024-11-13 00:50:21,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:50:21,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:50:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:50:21,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:50:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:50:21,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:50:21,956 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:50:21,956 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:50:21,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:50:21,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-13 00:50:21,958 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-13 00:50:21,959 WARN L244 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:50:21,959 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-11-13 00:50:21,994 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:50:21,997 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:50:21,997 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:50:21,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:50:21,997 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:50:21,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:50:27,843 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:50:27,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:50:27,844 INFO L85 PathProgramCache]: Analyzing trace with hash 53013809, now seen corresponding path program 1 times [2024-11-13 00:50:27,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:50:27,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690665214] [2024-11-13 00:50:27,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:50:27,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:50:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:50:27,884 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-13 00:50:27,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:50:27,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690665214] [2024-11-13 00:50:27,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690665214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:50:27,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:50:27,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:50:27,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778922903] [2024-11-13 00:50:27,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:50:27,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:50:27,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:50:27,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:50:27,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:50:27,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:27,886 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:50:27,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:50:27,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:43,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-13 00:50:43,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:50:43,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:50:43,885 INFO L85 PathProgramCache]: Analyzing trace with hash 598608456, now seen corresponding path program 1 times [2024-11-13 00:50:43,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:50:43,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863298334] [2024-11-13 00:50:43,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:50:43,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:50:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:50:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-11-13 00:50:44,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:50:44,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863298334] [2024-11-13 00:50:44,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863298334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:50:44,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:50:44,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:50:44,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409395675] [2024-11-13 00:50:44,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:50:44,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:50:44,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:50:44,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:50:44,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:50:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:44,019 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:50:44,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:50:44,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:44,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:50:45,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-11-13 00:50:45,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:50:45,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:50:45,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1252081422, now seen corresponding path program 2 times [2024-11-13 00:50:45,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:50:45,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403513685] [2024-11-13 00:50:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:50:45,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:50:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:50:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2024-11-13 00:50:46,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:50:46,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403513685] [2024-11-13 00:50:46,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403513685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:50:46,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:50:46,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:50:46,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316463873] [2024-11-13 00:50:46,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:50:46,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:50:46,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:50:46,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:50:46,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:50:46,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:46,165 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:50:46,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:50:46,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:46,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:50:46,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:51,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:51,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:50:51,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:50:51,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-11-13 00:50:51,410 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:50:51,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:50:51,411 INFO L85 PathProgramCache]: Analyzing trace with hash -828456457, now seen corresponding path program 1 times [2024-11-13 00:50:51,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:50:51,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601245596] [2024-11-13 00:50:51,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:50:51,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:50:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:50:51,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:50:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:50:51,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:50:51,498 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:50:51,498 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:50:51,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:50:51,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-11-13 00:50:51,500 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-13 00:50:51,500 WARN L244 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:50:51,500 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-11-13 00:50:51,547 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:50:51,550 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:50:51,551 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:50:51,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:50:51,552 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:50:51,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:50:58,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:50:58,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:50:58,021 INFO L85 PathProgramCache]: Analyzing trace with hash 127534750, now seen corresponding path program 1 times [2024-11-13 00:50:58,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:50:58,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012536042] [2024-11-13 00:50:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:50:58,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:50:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:50:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-13 00:50:58,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:50:58,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012536042] [2024-11-13 00:50:58,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012536042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:50:58,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:50:58,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:50:58,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720939612] [2024-11-13 00:50:58,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:50:58,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:50:58,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:50:58,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:50:58,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:50:58,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:50:58,064 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:50:58,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:50:58,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:16,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:16,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-11-13 00:51:16,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:51:16,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:51:16,543 INFO L85 PathProgramCache]: Analyzing trace with hash -752962212, now seen corresponding path program 1 times [2024-11-13 00:51:16,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:51:16,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829286545] [2024-11-13 00:51:16,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:51:16,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:51:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:51:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-13 00:51:16,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:51:16,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829286545] [2024-11-13 00:51:16,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829286545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:51:16,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:51:16,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:51:16,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473073254] [2024-11-13 00:51:16,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:51:16,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:51:16,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:51:16,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:51:16,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:51:16,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:16,694 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:51:16,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:51:16,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:16,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:18,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:18,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:51:18,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-11-13 00:51:18,837 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:51:18,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:51:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash -885574338, now seen corresponding path program 2 times [2024-11-13 00:51:18,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:51:18,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441713198] [2024-11-13 00:51:18,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:51:18,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:51:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:51:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-13 00:51:19,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:51:19,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441713198] [2024-11-13 00:51:19,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441713198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:51:19,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:51:19,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:51:19,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160810054] [2024-11-13 00:51:19,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:51:19,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:51:19,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:51:19,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:51:19,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:51:19,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:19,074 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:51:19,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.4) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:51:19,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:19,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:51:19,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:25,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:25,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:51:25,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:51:25,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-11-13 00:51:25,216 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:51:25,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:51:25,216 INFO L85 PathProgramCache]: Analyzing trace with hash 17143222, now seen corresponding path program 1 times [2024-11-13 00:51:25,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:51:25,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917806031] [2024-11-13 00:51:25,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:51:25,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:51:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:51:25,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:51:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:51:25,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:51:25,283 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:51:25,283 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:51:25,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:51:25,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-11-13 00:51:25,284 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-13 00:51:25,285 WARN L244 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:51:25,285 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-11-13 00:51:25,324 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:51:25,326 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:51:25,327 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:51:25,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:51:25,327 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:51:25,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:51:32,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:51:32,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:51:32,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2018768784, now seen corresponding path program 1 times [2024-11-13 00:51:32,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:51:32,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955268629] [2024-11-13 00:51:32,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:51:32,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:51:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:51:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-13 00:51:32,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:51:32,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955268629] [2024-11-13 00:51:32,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955268629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:51:32,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:51:32,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:51:32,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61356531] [2024-11-13 00:51:32,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:51:32,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:51:32,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:51:32,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:51:32,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:51:32,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:32,207 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:51:32,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:51:32,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:50,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:50,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-11-13 00:51:50,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:51:50,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:51:50,501 INFO L85 PathProgramCache]: Analyzing trace with hash 166463881, now seen corresponding path program 1 times [2024-11-13 00:51:50,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:51:50,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571427878] [2024-11-13 00:51:50,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:51:50,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:51:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:51:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-11-13 00:51:50,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:51:50,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571427878] [2024-11-13 00:51:50,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571427878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:51:50,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:51:50,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:51:50,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560124869] [2024-11-13 00:51:50,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:51:50,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:51:50,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:51:50,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:51:50,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:51:50,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:50,650 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:51:50,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:51:50,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:50,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:52,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:52,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:51:52,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-11-13 00:51:52,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:51:52,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:51:52,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1628198399, now seen corresponding path program 2 times [2024-11-13 00:51:52,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:51:52,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193309273] [2024-11-13 00:51:52,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:51:52,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:51:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:51:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-11-13 00:51:52,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:51:52,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193309273] [2024-11-13 00:51:52,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193309273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:51:52,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:51:52,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:51:52,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014783435] [2024-11-13 00:51:52,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:51:52,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:51:52,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:51:52,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:51:52,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:51:52,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:52,931 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:51:52,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.0) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:51:52,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:52,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:51:52,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:59,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:51:59,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:51:59,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:51:59,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-11-13 00:51:59,824 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:51:59,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:51:59,824 INFO L85 PathProgramCache]: Analyzing trace with hash -614783704, now seen corresponding path program 1 times [2024-11-13 00:51:59,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:51:59,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784152267] [2024-11-13 00:51:59,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:51:59,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:51:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:51:59,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:51:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:51:59,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:51:59,911 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:51:59,911 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:51:59,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:51:59,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-11-13 00:51:59,913 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-13 00:51:59,913 WARN L244 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:51:59,913 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2024-11-13 00:51:59,964 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:51:59,970 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:51:59,970 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:51:59,970 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:51:59,970 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:51:59,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:52:07,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:52:07,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:52:07,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2068631875, now seen corresponding path program 1 times [2024-11-13 00:52:07,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:52:07,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258358970] [2024-11-13 00:52:07,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:52:07,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:52:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:52:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-13 00:52:07,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:52:07,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258358970] [2024-11-13 00:52:07,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258358970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:52:07,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:52:07,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:52:07,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892451887] [2024-11-13 00:52:07,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:52:07,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:52:07,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:52:07,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:52:07,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:52:07,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:52:07,925 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:52:07,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.5) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:52:07,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:52:28,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:52:28,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-11-13 00:52:28,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:52:28,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:52:28,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1651222468, now seen corresponding path program 1 times [2024-11-13 00:52:28,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:52:28,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727471659] [2024-11-13 00:52:28,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:52:28,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:52:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:52:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-11-13 00:52:28,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:52:28,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727471659] [2024-11-13 00:52:28,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727471659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:52:28,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:52:28,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:52:28,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419868033] [2024-11-13 00:52:28,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:52:28,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:52:28,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:52:28,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:52:28,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:52:28,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:52:28,232 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:52:28,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:52:28,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:52:28,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:52:30,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:52:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:52:30,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-11-13 00:52:30,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:52:30,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:52:30,410 INFO L85 PathProgramCache]: Analyzing trace with hash 98184338, now seen corresponding path program 2 times [2024-11-13 00:52:30,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:52:30,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565835325] [2024-11-13 00:52:30,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:52:30,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:52:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:52:30,742 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2024-11-13 00:52:30,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:52:30,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565835325] [2024-11-13 00:52:30,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565835325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:52:30,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:52:30,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:52:30,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208268322] [2024-11-13 00:52:30,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:52:30,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:52:30,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:52:30,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:52:30,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:52:30,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:52:30,743 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:52:30,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.6) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:52:30,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:52:30,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:52:30,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:52:38,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:52:38,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:52:38,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:52:38,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-11-13 00:52:38,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:52:38,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:52:38,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1070865657, now seen corresponding path program 1 times [2024-11-13 00:52:38,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:52:38,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053541349] [2024-11-13 00:52:38,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:52:38,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:52:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:52:38,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:52:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:52:38,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:52:38,232 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:52:38,232 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:52:38,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:52:38,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-11-13 00:52:38,234 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-13 00:52:38,234 WARN L244 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:52:38,234 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2024-11-13 00:52:38,292 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:52:38,296 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:52:38,297 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:52:38,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:52:38,297 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:52:38,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:52:47,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:52:47,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:52:47,667 INFO L85 PathProgramCache]: Analyzing trace with hash 204765703, now seen corresponding path program 1 times [2024-11-13 00:52:47,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:52:47,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552712837] [2024-11-13 00:52:47,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:52:47,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:52:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:52:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2024-11-13 00:52:47,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:52:47,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552712837] [2024-11-13 00:52:47,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552712837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:52:47,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:52:47,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:52:47,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923165211] [2024-11-13 00:52:47,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:52:47,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:52:47,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:52:47,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:52:47,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:52:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:52:47,700 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:52:47,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:52:47,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:53:10,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:53:10,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-11-13 00:53:10,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:53:10,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:53:10,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1752766940, now seen corresponding path program 1 times [2024-11-13 00:53:10,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:53:10,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146548307] [2024-11-13 00:53:10,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:53:10,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:53:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:53:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-13 00:53:11,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:53:11,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146548307] [2024-11-13 00:53:11,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146548307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:53:11,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:53:11,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:53:11,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908186246] [2024-11-13 00:53:11,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:53:11,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:53:11,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:53:11,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:53:11,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:53:11,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:53:11,083 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:53:11,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:53:11,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:53:11,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:53:13,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:53:13,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:53:13,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-11-13 00:53:13,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:53:13,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:53:13,749 INFO L85 PathProgramCache]: Analyzing trace with hash 560091934, now seen corresponding path program 2 times [2024-11-13 00:53:13,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:53:13,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209442661] [2024-11-13 00:53:13,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:53:13,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:53:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:53:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-13 00:53:14,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:53:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209442661] [2024-11-13 00:53:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209442661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:53:14,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:53:14,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:53:14,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191317142] [2024-11-13 00:53:14,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:53:14,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:53:14,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:53:14,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:53:14,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:53:14,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:53:14,076 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:53:14,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:53:14,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:53:14,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:53:14,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:53:22,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:53:22,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:53:22,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:53:22,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-11-13 00:53:22,759 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:53:22,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:53:22,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1539168759, now seen corresponding path program 1 times [2024-11-13 00:53:22,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:53:22,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939800589] [2024-11-13 00:53:22,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:53:22,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:53:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:53:22,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:53:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:53:22,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:53:22,841 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:53:22,841 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:53:22,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:53:22,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-11-13 00:53:22,842 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-13 00:53:22,843 WARN L244 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:53:22,843 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2024-11-13 00:53:22,887 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:53:22,890 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:53:22,890 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:53:22,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:53:22,890 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:53:22,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:53:32,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:53:32,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:53:32,867 INFO L85 PathProgramCache]: Analyzing trace with hash -474431076, now seen corresponding path program 1 times [2024-11-13 00:53:32,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:53:32,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637247938] [2024-11-13 00:53:32,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:53:32,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:53:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:53:32,903 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-13 00:53:32,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:53:32,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637247938] [2024-11-13 00:53:32,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637247938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:53:32,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:53:32,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:53:32,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258212703] [2024-11-13 00:53:32,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:53:32,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:53:32,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:53:32,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:53:32,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:53:32,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:53:32,907 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:53:32,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:53:32,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:53:58,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:53:58,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-11-13 00:53:58,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:53:58,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:53:58,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1001392185, now seen corresponding path program 1 times [2024-11-13 00:53:58,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:53:58,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808401205] [2024-11-13 00:53:58,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:53:58,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:53:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:53:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-11-13 00:53:58,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:53:58,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808401205] [2024-11-13 00:53:58,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808401205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:53:58,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:53:58,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:53:58,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012969313] [2024-11-13 00:53:58,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:53:58,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:53:58,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:53:58,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:53:58,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:53:58,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:53:58,480 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:53:58,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:53:58,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:53:58,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:54:00,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:54:00,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:54:00,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-11-13 00:54:00,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:54:00,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:54:00,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1590211341, now seen corresponding path program 2 times [2024-11-13 00:54:00,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:54:00,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305212141] [2024-11-13 00:54:00,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:54:00,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:54:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:54:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-13 00:54:01,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:54:01,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305212141] [2024-11-13 00:54:01,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305212141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:54:01,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:54:01,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:54:01,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982722142] [2024-11-13 00:54:01,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:54:01,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:54:01,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:54:01,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:54:01,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:54:01,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:54:01,464 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:54:01,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.8) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:54:01,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:54:01,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:54:01,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:54:10,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:54:10,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:54:10,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:54:10,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-11-13 00:54:10,911 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:54:10,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:54:10,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1141696613, now seen corresponding path program 1 times [2024-11-13 00:54:10,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:54:10,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796298874] [2024-11-13 00:54:10,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:54:10,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:54:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:54:10,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:54:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:54:11,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:54:11,032 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:54:11,032 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:54:11,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:54:11,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-11-13 00:54:11,034 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-13 00:54:11,034 WARN L244 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:54:11,034 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2024-11-13 00:54:11,088 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:54:11,091 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:54:11,091 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:54:11,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:54:11,092 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:54:11,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:54:22,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:54:22,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:54:22,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1935752706, now seen corresponding path program 1 times [2024-11-13 00:54:22,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:54:22,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468896503] [2024-11-13 00:54:22,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:54:22,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:54:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:54:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-11-13 00:54:22,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:54:22,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468896503] [2024-11-13 00:54:22,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468896503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:54:22,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:54:22,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:54:22,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260164727] [2024-11-13 00:54:22,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:54:22,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:54:22,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:54:22,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:54:22,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:54:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:54:22,380 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:54:22,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:54:22,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:54:49,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:54:49,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-11-13 00:54:49,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:54:49,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:54:49,298 INFO L85 PathProgramCache]: Analyzing trace with hash 842798856, now seen corresponding path program 1 times [2024-11-13 00:54:49,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:54:49,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016421091] [2024-11-13 00:54:49,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:54:49,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:54:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:54:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-13 00:54:49,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:54:49,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016421091] [2024-11-13 00:54:49,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016421091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:54:49,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:54:49,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:54:49,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465775910] [2024-11-13 00:54:49,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:54:49,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:54:49,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:54:49,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:54:49,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:54:49,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:54:49,499 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:54:49,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:54:49,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:54:49,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:54:51,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:54:51,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:54:51,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-11-13 00:54:51,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:54:51,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:54:51,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1050231990, now seen corresponding path program 2 times [2024-11-13 00:54:51,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:54:51,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58074777] [2024-11-13 00:54:51,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:54:51,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:54:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:54:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-11-13 00:54:52,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:54:52,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58074777] [2024-11-13 00:54:52,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58074777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:54:52,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:54:52,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:54:52,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494304035] [2024-11-13 00:54:52,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:54:52,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:54:52,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:54:52,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:54:52,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:54:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:54:52,089 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:54:52,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.4) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:54:52,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:54:52,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:54:52,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:55:02,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:55:02,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:55:02,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:55:02,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-11-13 00:55:02,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:55:02,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:55:02,235 INFO L85 PathProgramCache]: Analyzing trace with hash -943821267, now seen corresponding path program 1 times [2024-11-13 00:55:02,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:55:02,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407947905] [2024-11-13 00:55:02,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:55:02,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:55:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:55:02,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:55:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:55:02,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:55:02,383 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:55:02,384 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:55:02,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:55:02,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-11-13 00:55:02,385 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-13 00:55:02,386 WARN L244 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:55:02,386 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2024-11-13 00:55:02,461 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:55:02,466 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:55:02,467 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:55:02,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:55:02,467 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:55:02,467 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:55:15,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:55:15,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:55:15,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1497727097, now seen corresponding path program 1 times [2024-11-13 00:55:15,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:55:15,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355679526] [2024-11-13 00:55:15,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:55:15,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:55:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:55:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2024-11-13 00:55:15,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:55:15,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355679526] [2024-11-13 00:55:15,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355679526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:55:15,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:55:15,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:55:15,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846633097] [2024-11-13 00:55:15,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:55:15,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:55:15,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:55:15,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:55:15,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:55:15,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:55:15,555 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:55:15,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:55:15,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:55:48,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:55:48,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-11-13 00:55:48,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:55:48,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:55:48,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1201449896, now seen corresponding path program 1 times [2024-11-13 00:55:48,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:55:48,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2739780] [2024-11-13 00:55:48,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:55:48,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:55:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:55:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2024-11-13 00:55:48,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:55:48,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2739780] [2024-11-13 00:55:48,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2739780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:55:48,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:55:48,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:55:48,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949402503] [2024-11-13 00:55:48,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:55:48,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:55:48,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:55:48,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:55:48,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:55:48,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:55:48,548 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:55:48,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:55:48,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:55:48,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:55:50,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:55:50,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:55:50,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-11-13 00:55:50,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:55:50,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:55:50,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1256203224, now seen corresponding path program 2 times [2024-11-13 00:55:50,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:55:50,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42364989] [2024-11-13 00:55:50,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:55:50,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:55:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:55:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2024-11-13 00:55:51,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:55:51,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42364989] [2024-11-13 00:55:51,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42364989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:55:51,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:55:51,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:55:51,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441229940] [2024-11-13 00:55:51,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:55:51,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:55:51,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:55:51,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:55:51,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:55:51,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:55:51,463 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:55:51,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:55:51,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:55:51,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:55:51,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:56:03,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:56:03,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:56:03,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:56:03,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-11-13 00:56:03,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:56:03,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:56:03,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1712393902, now seen corresponding path program 1 times [2024-11-13 00:56:03,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:56:03,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242100966] [2024-11-13 00:56:03,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:56:03,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:56:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:56:03,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:56:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:56:03,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:56:03,949 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:56:03,949 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:56:03,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:56:03,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-11-13 00:56:03,951 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-13 00:56:03,952 WARN L244 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:56:03,952 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2024-11-13 00:56:04,018 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:56:04,023 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:56:04,023 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:56:04,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:56:04,024 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:56:04,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:56:17,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:56:17,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:56:17,702 INFO L85 PathProgramCache]: Analyzing trace with hash -22234855, now seen corresponding path program 1 times [2024-11-13 00:56:17,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:56:17,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126721833] [2024-11-13 00:56:17,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:56:17,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:56:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:56:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-13 00:56:17,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:56:17,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126721833] [2024-11-13 00:56:17,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126721833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:56:17,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:56:17,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:56:17,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619262313] [2024-11-13 00:56:17,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:56:17,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:56:17,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:56:17,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:56:17,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:56:17,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:56:17,754 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:56:17,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:56:17,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:56:49,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:56:49,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-11-13 00:56:49,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:56:49,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:56:49,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1745417663, now seen corresponding path program 1 times [2024-11-13 00:56:49,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:56:49,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575213453] [2024-11-13 00:56:49,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:56:49,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:56:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:56:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2024-11-13 00:56:50,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:56:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575213453] [2024-11-13 00:56:50,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575213453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:56:50,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:56:50,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:56:50,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534257582] [2024-11-13 00:56:50,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:56:50,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:56:50,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:56:50,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:56:50,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:56:50,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:56:50,166 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:56:50,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:56:50,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:56:50,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:56:53,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:56:53,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:56:53,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-11-13 00:56:53,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:56:53,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:56:53,032 INFO L85 PathProgramCache]: Analyzing trace with hash 223864269, now seen corresponding path program 2 times [2024-11-13 00:56:53,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:56:53,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636012083] [2024-11-13 00:56:53,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:56:53,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:56:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:56:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2024-11-13 00:56:53,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:56:53,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636012083] [2024-11-13 00:56:53,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636012083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:56:53,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:56:53,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:56:53,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029563351] [2024-11-13 00:56:53,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:56:53,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:56:53,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:56:53,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:56:53,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:56:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:56:53,391 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:56:53,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.6) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:56:53,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:56:53,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:56:53,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:57:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:57:06,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:57:06,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:57:06,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-11-13 00:57:06,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:57:06,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:57:06,295 INFO L85 PathProgramCache]: Analyzing trace with hash 354877948, now seen corresponding path program 1 times [2024-11-13 00:57:06,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:57:06,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54989875] [2024-11-13 00:57:06,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:57:06,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:57:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:57:06,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:57:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:57:06,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:57:06,454 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:57:06,454 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:57:06,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:57:06,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-11-13 00:57:06,456 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-13 00:57:06,456 WARN L244 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:57:06,456 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2024-11-13 00:57:06,530 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:57:06,535 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:57:06,536 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:57:06,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:57:06,536 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:57:06,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:57:20,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:57:20,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:57:20,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1420760522, now seen corresponding path program 1 times [2024-11-13 00:57:20,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:57:20,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000846699] [2024-11-13 00:57:20,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:57:20,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:57:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:57:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2024-11-13 00:57:20,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:57:20,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000846699] [2024-11-13 00:57:20,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000846699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:57:20,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:57:20,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:57:20,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056478552] [2024-11-13 00:57:20,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:57:20,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:57:20,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:57:20,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:57:20,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:57:20,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:57:20,453 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:57:20,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:57:20,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:57:54,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:57:54,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-11-13 00:57:54,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:57:54,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:57:54,991 INFO L85 PathProgramCache]: Analyzing trace with hash 456090614, now seen corresponding path program 1 times [2024-11-13 00:57:54,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:57:54,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836286418] [2024-11-13 00:57:54,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:57:54,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:57:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:57:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2024-11-13 00:57:55,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:57:55,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836286418] [2024-11-13 00:57:55,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836286418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:57:55,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:57:55,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:57:55,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498955684] [2024-11-13 00:57:55,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:57:55,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:57:55,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:57:55,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:57:55,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:57:55,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:57:55,341 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:57:55,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:57:55,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:57:55,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:57:57,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:57:57,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:57:57,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-11-13 00:57:57,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:57:57,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:57:57,520 INFO L85 PathProgramCache]: Analyzing trace with hash -235574878, now seen corresponding path program 2 times [2024-11-13 00:57:57,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:57:57,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754334434] [2024-11-13 00:57:57,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:57:57,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:57:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:57:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2024-11-13 00:57:57,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:57:57,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754334434] [2024-11-13 00:57:57,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754334434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:57:57,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:57:57,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:57:57,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199385194] [2024-11-13 00:57:57,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:57:57,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:57:57,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:57:57,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:57:57,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:57:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:57:57,886 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:57:57,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:57:57,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:57:57,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:57:57,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:58:10,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:58:10,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:58:10,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:58:10,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-11-13 00:58:10,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:58:10,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:58:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1239434601, now seen corresponding path program 1 times [2024-11-13 00:58:10,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:58:10,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5780158] [2024-11-13 00:58:10,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:58:10,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:58:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:58:10,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:58:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:58:10,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:58:10,915 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:58:10,915 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:58:10,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:58:10,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-11-13 00:58:10,917 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-13 00:58:10,917 WARN L244 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:58:10,917 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2024-11-13 00:58:10,978 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:58:10,983 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:58:10,984 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:58:10,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:58:10,984 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:58:10,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:58:25,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:58:25,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:58:25,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1363723960, now seen corresponding path program 1 times [2024-11-13 00:58:25,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:58:25,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983279111] [2024-11-13 00:58:25,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:58:25,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:58:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:58:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-11-13 00:58:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:58:25,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983279111] [2024-11-13 00:58:25,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983279111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:58:25,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:58:25,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:58:25,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327787570] [2024-11-13 00:58:25,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:58:25,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:58:25,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:58:25,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:58:25,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:58:25,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:58:25,697 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:58:25,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:58:25,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:59:02,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:59:02,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-11-13 00:59:02,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:59:02,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:59:02,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1669624446, now seen corresponding path program 1 times [2024-11-13 00:59:02,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:59:02,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985165723] [2024-11-13 00:59:02,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:59:02,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:59:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:59:03,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2024-11-13 00:59:03,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:59:03,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985165723] [2024-11-13 00:59:03,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985165723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:59:03,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:59:03,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 00:59:03,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297547011] [2024-11-13 00:59:03,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:59:03,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 00:59:03,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:59:03,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 00:59:03,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 00:59:03,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:59:03,231 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:59:03,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:59:03,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:59:03,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:59:05,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:59:05,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:59:05,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-11-13 00:59:05,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:59:05,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:59:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash 573310606, now seen corresponding path program 2 times [2024-11-13 00:59:05,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:59:05,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445405654] [2024-11-13 00:59:05,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:59:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:59:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:59:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2024-11-13 00:59:06,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:59:06,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445405654] [2024-11-13 00:59:06,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445405654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:59:06,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:59:06,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 00:59:06,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169934161] [2024-11-13 00:59:06,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:59:06,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 00:59:06,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:59:06,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 00:59:06,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 00:59:06,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:59:06,058 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:59:06,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:59:06,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:59:06,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:59:06,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:59:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:59:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 00:59:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 00:59:21,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-11-13 00:59:21,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:59:21,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:59:21,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1517577807, now seen corresponding path program 1 times [2024-11-13 00:59:21,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:59:21,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878491843] [2024-11-13 00:59:21,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:59:21,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:59:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:59:21,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 00:59:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 00:59:21,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 00:59:21,640 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 00:59:21,640 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 00:59:21,641 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 00:59:21,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-11-13 00:59:21,642 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-13 00:59:21,643 WARN L244 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 00:59:21,643 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2024-11-13 00:59:21,705 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 00:59:21,708 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:59:21,708 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 00:59:21,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 00:59:21,709 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 00:59:21,709 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 00:59:37,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 00:59:37,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 00:59:37,661 INFO L85 PathProgramCache]: Analyzing trace with hash -216586845, now seen corresponding path program 1 times [2024-11-13 00:59:37,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 00:59:37,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141575943] [2024-11-13 00:59:37,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 00:59:37,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 00:59:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 00:59:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-11-13 00:59:37,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 00:59:37,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141575943] [2024-11-13 00:59:37,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141575943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 00:59:37,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 00:59:37,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 00:59:37,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297982410] [2024-11-13 00:59:37,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 00:59:37,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 00:59:37,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 00:59:37,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 00:59:37,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 00:59:37,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 00:59:37,711 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 00:59:37,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 00:59:37,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 01:00:16,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 01:00:16,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-11-13 01:00:16,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 01:00:16,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 01:00:16,977 INFO L85 PathProgramCache]: Analyzing trace with hash -93804147, now seen corresponding path program 1 times [2024-11-13 01:00:16,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 01:00:16,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687203550] [2024-11-13 01:00:16,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 01:00:16,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 01:00:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 01:00:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2024-11-13 01:00:17,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 01:00:17,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687203550] [2024-11-13 01:00:17,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687203550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 01:00:17,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 01:00:17,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 01:00:17,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830152732] [2024-11-13 01:00:17,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 01:00:17,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 01:00:17,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 01:00:17,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 01:00:17,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 01:00:17,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 01:00:17,305 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 01:00:17,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 01:00:17,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 01:00:17,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 01:00:19,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 01:00:19,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 01:00:19,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-11-13 01:00:19,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 01:00:19,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 01:00:19,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1529167973, now seen corresponding path program 2 times [2024-11-13 01:00:19,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 01:00:19,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487098685] [2024-11-13 01:00:19,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 01:00:19,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 01:00:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 01:00:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 951 trivial. 0 not checked. [2024-11-13 01:00:20,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 01:00:20,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487098685] [2024-11-13 01:00:20,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487098685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 01:00:20,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 01:00:20,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 01:00:20,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097628750] [2024-11-13 01:00:20,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 01:00:20,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 01:00:20,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 01:00:20,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 01:00:20,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 01:00:20,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 01:00:20,227 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 01:00:20,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 01:00:20,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 01:00:20,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 01:00:20,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 01:00:37,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 01:00:37,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 01:00:37,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 01:00:37,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-11-13 01:00:37,612 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 01:00:37,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 01:00:37,612 INFO L85 PathProgramCache]: Analyzing trace with hash 918347467, now seen corresponding path program 1 times [2024-11-13 01:00:37,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 01:00:37,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683427756] [2024-11-13 01:00:37,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 01:00:37,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 01:00:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 01:00:37,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 01:00:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 01:00:37,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 01:00:37,746 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 01:00:37,746 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-13 01:00:37,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-13 01:00:37,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-11-13 01:00:37,748 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-13 01:00:37,748 WARN L244 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 01:00:37,749 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2024-11-13 01:00:37,804 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 01:00:37,808 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 01:00:37,808 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 01:00:37,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 01:00:37,809 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4aba1a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 01:00:37,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 01:00:56,778 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 01:00:56,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 01:00:56,778 INFO L85 PathProgramCache]: Analyzing trace with hash -83511413, now seen corresponding path program 1 times [2024-11-13 01:00:56,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 01:00:56,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538036019] [2024-11-13 01:00:56,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 01:00:56,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 01:00:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 01:00:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2024-11-13 01:00:56,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 01:00:56,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538036019] [2024-11-13 01:00:56,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538036019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 01:00:56,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 01:00:56,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 01:00:56,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149630501] [2024-11-13 01:00:56,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 01:00:56,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 01:00:56,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 01:00:56,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 01:00:56,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 01:00:56,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 01:00:56,830 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 01:00:56,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 01:00:56,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15