./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i --full-output --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1f73d82f Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 3eff698bae51c39e8a3a4c763800dbda831dabb73a169fa31c8e326faee47cd8 --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-1f73d82-m [2024-11-21 14:49:22,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 14:49:23,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-11-21 14:49:23,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 14:49:23,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 14:49:23,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 14:49:23,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 14:49:23,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 14:49:23,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 14:49:23,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 14:49:23,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 14:49:23,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 14:49:23,117 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 14:49:23,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 14:49:23,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 14:49:23,119 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 14:49:23,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 14:49:23,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 14:49:23,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 14:49:23,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 14:49:23,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 14:49:23,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 14:49:23,120 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 14:49:23,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 14:49:23,120 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-21 14:49:23,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 14:49:23,120 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 14:49:23,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 14:49:23,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 14:49:23,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 14:49:23,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 14:49:23,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 14:49:23,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 14:49:23,120 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-21 14:49:23,121 INFO L153 SettingsManager]: * Commutativity condition synthesis=SUFFICIENT [2024-11-21 14:49:23,121 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 14:49:23,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 14:49:23,121 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-21 14:49:23,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 14:49:23,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 14:49:23,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-21 14:49:23,121 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-21 14:49:23,121 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-21 14:49:23,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-jdk21/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 -> 3eff698bae51c39e8a3a4c763800dbda831dabb73a169fa31c8e326faee47cd8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2024-11-21 14:49:23,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 14:49:23,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 14:49:23,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 14:49:23,479 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 14:49:23,479 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 14:49:23,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i [2024-11-21 14:49:24,744 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/6bb18fdc2/5906a8e43f394433a6403abeb72ce9cd/FLAGc3d523172 [2024-11-21 14:49:25,053 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 14:49:25,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i [2024-11-21 14:49:25,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/6bb18fdc2/5906a8e43f394433a6403abeb72ce9cd/FLAGc3d523172 [2024-11-21 14:49:25,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/6bb18fdc2/5906a8e43f394433a6403abeb72ce9cd [2024-11-21 14:49:25,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 14:49:25,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 14:49:25,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 14:49:25,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 14:49:25,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 14:49:25,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:49:25" (1/1) ... [2024-11-21 14:49:25,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f8ae36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:49:25, skipping insertion in model container [2024-11-21 14:49:25,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:49:25" (1/1) ... [2024-11-21 14:49:25,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 14:49:25,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i[30176,30189] [2024-11-21 14:49:25,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 14:49:25,424 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 14:49:25,475 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i[30176,30189] [2024-11-21 14:49:25,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 14:49:25,526 INFO L204 MainTranslator]: Completed translation [2024-11-21 14:49:25,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:49:25 WrapperNode [2024-11-21 14:49:25,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 14:49:25,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 14:49:25,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 14:49:25,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 14:49:25,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:49:25" (1/1) ... [2024-11-21 14:49:25,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:49:25" (1/1) ... [2024-11-21 14:49:25,572 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-11-21 14:49:25,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 14:49:25,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 14:49:25,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 14:49:25,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 14:49:25,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:49:25" (1/1) ... [2024-11-21 14:49:25,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:49:25" (1/1) ... [2024-11-21 14:49:25,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:49:25" (1/1) ... [2024-11-21 14:49:25,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:49:25" (1/1) ... [2024-11-21 14:49:25,595 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:49:25" (1/1) ... [2024-11-21 14:49:25,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:49:25" (1/1) ... [2024-11-21 14:49:25,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:49:25" (1/1) ... [2024-11-21 14:49:25,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:49:25" (1/1) ... [2024-11-21 14:49:25,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:49:25" (1/1) ... [2024-11-21 14:49:25,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 14:49:25,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 14:49:25,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 14:49:25,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 14:49:25,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:49:25" (1/1) ... [2024-11-21 14:49:25,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 14:49:25,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 14:49:25,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-21 14:49:25,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-21 14:49:25,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-21 14:49:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-21 14:49:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-21 14:49:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 14:49:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-21 14:49:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-21 14:49:25,672 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-21 14:49:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-21 14:49:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-21 14:49:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-21 14:49:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 14:49:25,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 14:49:25,674 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-21 14:49:25,778 INFO L234 CfgBuilder]: Building ICFG [2024-11-21 14:49:25,779 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 14:49:25,964 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-21 14:49:25,964 INFO L283 CfgBuilder]: Performing block encoding [2024-11-21 14:49:26,139 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 14:49:26,142 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-21 14:49:26,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:49:26 BoogieIcfgContainer [2024-11-21 14:49:26,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 14:49:26,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 14:49:26,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 14:49:26,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 14:49:26,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 02:49:25" (1/3) ... [2024-11-21 14:49:26,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617bfb8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:49:26, skipping insertion in model container [2024-11-21 14:49:26,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:49:25" (2/3) ... [2024-11-21 14:49:26,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617bfb8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:49:26, skipping insertion in model container [2024-11-21 14:49:26,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:49:26" (3/3) ... [2024-11-21 14:49:26,155 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_36-indirect_racefree.i [2024-11-21 14:49:26,165 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 14:49:26,166 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_36-indirect_racefree.i that has 2 procedures, 39 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2024-11-21 14:49:26,166 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-21 14:49:26,198 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-21 14:49:26,247 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:26,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-21 14:49:26,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 14:49:26,250 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-21 14:49:26,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-21 14:49:26,327 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:49:26,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:49:26,346 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:26,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:49:26,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:26,545 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:26,545 INFO L139 ounterexampleChecker]: Examining path program with hash 1050959262, occurence #1 [2024-11-21 14:49:26,545 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:26,545 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:26,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:26,549 INFO L85 PathProgramCache]: Analyzing trace with hash 395872079, now seen corresponding path program 1 times [2024-11-21 14:49:26,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:26,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093188223] [2024-11-21 14:49:26,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:26,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:26,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:26,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093188223] [2024-11-21 14:49:26,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093188223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:26,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:26,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:49:26,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593601706] [2024-11-21 14:49:26,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:26,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:49:26,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:26,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:49:26,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:49:26,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:26,758 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:26,759 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-21 14:49:26,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:26,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 14:49:26,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:26,885 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:26,885 INFO L139 ounterexampleChecker]: Examining path program with hash -1712392393, occurence #1 [2024-11-21 14:49:26,885 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:26,885 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:26,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:26,886 INFO L85 PathProgramCache]: Analyzing trace with hash -437576243, now seen corresponding path program 1 times [2024-11-21 14:49:26,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:26,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338182976] [2024-11-21 14:49:26,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:26,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:26,933 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:49:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:26,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:49:26,989 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:49:26,990 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:49:26,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:49:26,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 14:49:26,996 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-21 14:49:26,997 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:49:26,999 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-21 14:49:27,018 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-21 14:49:27,025 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:27,034 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:49:27,036 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:49:27,036 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:27,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:49:27,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:27,331 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:27,332 INFO L139 ounterexampleChecker]: Examining path program with hash -1394216585, occurence #1 [2024-11-21 14:49:27,332 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:27,332 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:27,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:27,333 INFO L85 PathProgramCache]: Analyzing trace with hash -562567144, now seen corresponding path program 1 times [2024-11-21 14:49:27,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:27,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13390911] [2024-11-21 14:49:27,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:27,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:27,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:27,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13390911] [2024-11-21 14:49:27,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13390911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:27,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:27,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:49:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494164918] [2024-11-21 14:49:27,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:27,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:49:27,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:27,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:49:27,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:49:27,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:27,409 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:27,409 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-21 14:49:27,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:27,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 14:49:27,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:27,853 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:27,853 INFO L139 ounterexampleChecker]: Examining path program with hash 1230692551, occurence #1 [2024-11-21 14:49:27,853 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:27,853 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:27,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:27,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2029956387, now seen corresponding path program 1 times [2024-11-21 14:49:27,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:27,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932772794] [2024-11-21 14:49:27,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:27,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:28,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:28,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932772794] [2024-11-21 14:49:28,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932772794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:28,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:28,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:49:28,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735066863] [2024-11-21 14:49:28,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:28,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:49:28,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:28,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:49:28,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:49:28,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:28,029 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:28,030 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-21 14:49:28,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:28,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:28,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:28,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:28,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 14:49:28,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:28,165 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:28,165 INFO L139 ounterexampleChecker]: Examining path program with hash -1933160874, occurence #1 [2024-11-21 14:49:28,165 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:28,165 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:28,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash -396077461, now seen corresponding path program 1 times [2024-11-21 14:49:28,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:28,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033067208] [2024-11-21 14:49:28,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:28,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:28,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:28,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033067208] [2024-11-21 14:49:28,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033067208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:28,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:28,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:49:28,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918659942] [2024-11-21 14:49:28,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:28,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:49:28,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:28,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:49:28,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:49:28,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:28,446 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:28,446 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-21 14:49:28,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:28,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:28,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:28,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:28,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:28,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:49:28,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 14:49:28,536 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:28,536 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:28,536 INFO L139 ounterexampleChecker]: Examining path program with hash 1645315755, occurence #1 [2024-11-21 14:49:28,536 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:28,536 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:28,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash -706558006, now seen corresponding path program 1 times [2024-11-21 14:49:28,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:28,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080190518] [2024-11-21 14:49:28,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:28,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:28,566 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:49:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:28,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:49:28,589 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:49:28,590 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:49:28,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:49:28,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 14:49:28,591 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:49:28,592 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:49:28,592 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-21 14:49:28,614 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-21 14:49:28,620 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:28,634 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:49:28,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:49:28,635 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:28,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:49:29,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:29,057 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:29,058 INFO L139 ounterexampleChecker]: Examining path program with hash -437666979, occurence #1 [2024-11-21 14:49:29,058 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:29,058 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:29,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:29,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1562054568, now seen corresponding path program 1 times [2024-11-21 14:49:29,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:29,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015262978] [2024-11-21 14:49:29,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:29,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:29,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:29,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015262978] [2024-11-21 14:49:29,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015262978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:29,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:29,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:49:29,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324139700] [2024-11-21 14:49:29,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:29,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:49:29,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:29,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:49:29,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:49:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:29,087 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:29,088 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-21 14:49:29,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:29,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:29,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 14:49:29,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:29,969 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:29,970 INFO L139 ounterexampleChecker]: Examining path program with hash -741811252, occurence #1 [2024-11-21 14:49:29,970 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:29,970 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:29,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:29,970 INFO L85 PathProgramCache]: Analyzing trace with hash 669806806, now seen corresponding path program 1 times [2024-11-21 14:49:29,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:29,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320845595] [2024-11-21 14:49:29,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:29,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:30,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:30,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:30,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320845595] [2024-11-21 14:49:30,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320845595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:30,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:30,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:49:30,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810725891] [2024-11-21 14:49:30,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:30,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:49:30,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:30,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:49:30,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:49:30,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:30,085 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:30,085 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-21 14:49:30,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:30,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:30,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:30,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:30,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 14:49:30,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:30,260 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:30,261 INFO L139 ounterexampleChecker]: Examining path program with hash -416517933, occurence #1 [2024-11-21 14:49:30,261 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:30,261 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:30,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:30,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1626325529, now seen corresponding path program 1 times [2024-11-21 14:49:30,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:30,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986942873] [2024-11-21 14:49:30,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:30,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:30,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:30,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:30,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986942873] [2024-11-21 14:49:30,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986942873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:30,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:30,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:49:30,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009138824] [2024-11-21 14:49:30,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:30,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:49:30,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:30,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:49:30,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:49:30,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:30,483 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:30,483 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-21 14:49:30,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:30,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:30,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:30,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:30,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:30,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:49:30,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 14:49:30,677 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:30,677 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:30,677 INFO L139 ounterexampleChecker]: Examining path program with hash 768823590, occurence #1 [2024-11-21 14:49:30,677 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:30,677 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:30,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:30,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1455460394, now seen corresponding path program 1 times [2024-11-21 14:49:30,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:30,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231662207] [2024-11-21 14:49:30,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:30,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:30,707 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:49:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:30,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:49:30,733 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:49:30,734 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:49:30,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:49:30,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 14:49:30,736 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:49:30,736 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:49:30,736 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-21 14:49:30,762 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-21 14:49:30,766 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:30,777 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:49:30,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:49:30,778 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:30,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:49:31,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:31,304 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:31,305 INFO L139 ounterexampleChecker]: Examining path program with hash -1838005665, occurence #1 [2024-11-21 14:49:31,305 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:31,305 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:31,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:31,305 INFO L85 PathProgramCache]: Analyzing trace with hash 590625346, now seen corresponding path program 1 times [2024-11-21 14:49:31,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:31,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806191282] [2024-11-21 14:49:31,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:31,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:31,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806191282] [2024-11-21 14:49:31,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806191282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:31,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:31,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:49:31,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319422135] [2024-11-21 14:49:31,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:31,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:49:31,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:31,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:49:31,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:49:31,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:31,330 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:31,331 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-21 14:49:31,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:32,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:32,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-21 14:49:32,655 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:32,655 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:32,655 INFO L139 ounterexampleChecker]: Examining path program with hash -6474367, occurence #1 [2024-11-21 14:49:32,655 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:32,655 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:32,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1148842908, now seen corresponding path program 1 times [2024-11-21 14:49:32,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:32,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780123199] [2024-11-21 14:49:32,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:32,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:32,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:32,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780123199] [2024-11-21 14:49:32,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780123199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:32,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:32,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:49:32,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741206185] [2024-11-21 14:49:32,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:32,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:49:32,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:32,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:49:32,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:49:32,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:32,789 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:32,789 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-21 14:49:32,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:32,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:32,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:32,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:32,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-21 14:49:32,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:32,979 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:32,979 INFO L139 ounterexampleChecker]: Examining path program with hash -650312758, occurence #1 [2024-11-21 14:49:32,979 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:32,979 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:32,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:32,980 INFO L85 PathProgramCache]: Analyzing trace with hash 907391412, now seen corresponding path program 1 times [2024-11-21 14:49:32,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:32,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894603126] [2024-11-21 14:49:32,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:32,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:33,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:33,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894603126] [2024-11-21 14:49:33,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894603126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:33,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:33,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:49:33,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956583727] [2024-11-21 14:49:33,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:33,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:49:33,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:33,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:49:33,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:49:33,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:33,177 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:33,177 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-21 14:49:33,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:33,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:33,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:33,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:33,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:33,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:49:33,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-21 14:49:33,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:33,399 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:33,399 INFO L139 ounterexampleChecker]: Examining path program with hash -1379235213, occurence #1 [2024-11-21 14:49:33,399 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:33,399 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:33,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:33,400 INFO L85 PathProgramCache]: Analyzing trace with hash -812510781, now seen corresponding path program 1 times [2024-11-21 14:49:33,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:33,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004066546] [2024-11-21 14:49:33,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:33,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:33,423 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:49:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:33,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:49:33,452 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:49:33,452 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:49:33,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:49:33,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-21 14:49:33,455 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:49:33,457 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:49:33,457 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-21 14:49:33,480 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-11-21 14:49:33,483 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:33,495 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:49:33,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:49:33,496 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:33,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:49:34,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:34,160 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:34,160 INFO L139 ounterexampleChecker]: Examining path program with hash -524195413, occurence #1 [2024-11-21 14:49:34,160 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:34,160 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:34,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:34,161 INFO L85 PathProgramCache]: Analyzing trace with hash -916126231, now seen corresponding path program 1 times [2024-11-21 14:49:34,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:34,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355331387] [2024-11-21 14:49:34,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:34,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:34,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:34,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355331387] [2024-11-21 14:49:34,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355331387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:34,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:34,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:49:34,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136352918] [2024-11-21 14:49:34,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:34,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:49:34,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:34,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:49:34,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:49:34,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:34,189 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:34,189 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-21 14:49:34,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:35,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:35,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-21 14:49:35,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:35,891 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:35,891 INFO L139 ounterexampleChecker]: Examining path program with hash 631131860, occurence #1 [2024-11-21 14:49:35,891 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:35,891 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:35,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash 935998193, now seen corresponding path program 1 times [2024-11-21 14:49:35,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:35,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091349283] [2024-11-21 14:49:35,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:35,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:36,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:36,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:36,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091349283] [2024-11-21 14:49:36,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091349283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:36,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:36,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:49:36,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93979020] [2024-11-21 14:49:36,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:36,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:49:36,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:36,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:49:36,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:49:36,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:36,011 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:36,011 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-21 14:49:36,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:36,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:36,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:36,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:36,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-21 14:49:36,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:36,292 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:36,293 INFO L139 ounterexampleChecker]: Examining path program with hash -678854082, occurence #1 [2024-11-21 14:49:36,293 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:36,293 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:36,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:36,293 INFO L85 PathProgramCache]: Analyzing trace with hash 659766588, now seen corresponding path program 1 times [2024-11-21 14:49:36,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:36,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929282882] [2024-11-21 14:49:36,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:36,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:36,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:36,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:36,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929282882] [2024-11-21 14:49:36,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929282882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:36,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:36,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:49:36,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771847225] [2024-11-21 14:49:36,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:36,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:49:36,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:36,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:49:36,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:49:36,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:36,526 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:36,526 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-21 14:49:36,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:36,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:36,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:36,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:36,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:36,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:49:36,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-21 14:49:36,889 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:36,889 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:36,889 INFO L139 ounterexampleChecker]: Examining path program with hash -94899803, occurence #1 [2024-11-21 14:49:36,889 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:36,889 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:36,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:36,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1669401057, now seen corresponding path program 1 times [2024-11-21 14:49:36,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:36,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367728750] [2024-11-21 14:49:36,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:36,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:36,915 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:49:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:36,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:49:36,953 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:49:36,953 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:49:36,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:49:36,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-21 14:49:36,957 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:49:36,957 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:49:36,957 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-11-21 14:49:36,984 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-11-21 14:49:36,986 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:37,002 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:49:37,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:49:37,003 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:37,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:49:37,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:37,702 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:37,702 INFO L139 ounterexampleChecker]: Examining path program with hash -365704618, occurence #1 [2024-11-21 14:49:37,702 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:37,702 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:37,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:37,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1909501516, now seen corresponding path program 1 times [2024-11-21 14:49:37,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:37,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046657667] [2024-11-21 14:49:37,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:37,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:37,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:37,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046657667] [2024-11-21 14:49:37,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046657667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:37,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:37,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:49:37,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189531084] [2024-11-21 14:49:37,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:37,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:49:37,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:37,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:49:37,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:49:37,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:37,728 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:37,728 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-21 14:49:37,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:39,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:39,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-21 14:49:39,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:39,766 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:39,766 INFO L139 ounterexampleChecker]: Examining path program with hash 1519603361, occurence #1 [2024-11-21 14:49:39,766 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:39,767 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:39,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:39,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1149593402, now seen corresponding path program 1 times [2024-11-21 14:49:39,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:39,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874689394] [2024-11-21 14:49:39,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:39,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:39,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:39,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874689394] [2024-11-21 14:49:39,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874689394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:39,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:39,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:49:39,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403007612] [2024-11-21 14:49:39,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:39,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:49:39,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:39,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:49:39,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:49:39,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:39,907 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:39,907 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-21 14:49:39,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:39,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:40,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:40,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:40,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-21 14:49:40,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:40,321 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:40,321 INFO L139 ounterexampleChecker]: Examining path program with hash -394341765, occurence #1 [2024-11-21 14:49:40,321 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:40,321 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:40,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:40,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2046507888, now seen corresponding path program 1 times [2024-11-21 14:49:40,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:40,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728719881] [2024-11-21 14:49:40,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:40,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:40,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:40,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728719881] [2024-11-21 14:49:40,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728719881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:40,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:40,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:49:40,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204896037] [2024-11-21 14:49:40,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:40,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:49:40,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:40,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:49:40,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:49:40,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:40,532 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:40,532 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-21 14:49:40,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:40,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:40,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:41,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:41,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:41,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:49:41,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-21 14:49:41,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:41,010 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:41,010 INFO L139 ounterexampleChecker]: Examining path program with hash 1465648044, occurence #1 [2024-11-21 14:49:41,010 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:41,010 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:41,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:41,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1982214792, now seen corresponding path program 1 times [2024-11-21 14:49:41,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:41,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548650041] [2024-11-21 14:49:41,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:41,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:41,035 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:49:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:41,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:49:41,059 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:49:41,059 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:49:41,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:49:41,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-21 14:49:41,061 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:49:41,061 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:49:41,061 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-11-21 14:49:41,083 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2024-11-21 14:49:41,085 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:41,100 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:49:41,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:49:41,103 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:41,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:49:42,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:42,097 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:42,097 INFO L139 ounterexampleChecker]: Examining path program with hash -889943224, occurence #1 [2024-11-21 14:49:42,097 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:42,097 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:42,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:42,097 INFO L85 PathProgramCache]: Analyzing trace with hash 986607510, now seen corresponding path program 1 times [2024-11-21 14:49:42,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:42,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613042648] [2024-11-21 14:49:42,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:42,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:42,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:42,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613042648] [2024-11-21 14:49:42,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613042648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:42,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:42,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:49:42,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636886472] [2024-11-21 14:49:42,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:42,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:49:42,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:42,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:49:42,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:49:42,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:42,119 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:42,119 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-21 14:49:42,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:44,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:44,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-21 14:49:44,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:44,796 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:44,796 INFO L139 ounterexampleChecker]: Examining path program with hash -1518622312, occurence #1 [2024-11-21 14:49:44,797 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:44,797 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:44,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:44,797 INFO L85 PathProgramCache]: Analyzing trace with hash -900925328, now seen corresponding path program 1 times [2024-11-21 14:49:44,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:44,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572701071] [2024-11-21 14:49:44,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:44,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:44,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:44,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572701071] [2024-11-21 14:49:44,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572701071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:44,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:44,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:49:44,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89738498] [2024-11-21 14:49:44,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:44,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:49:44,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:44,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:49:44,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:49:44,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:44,948 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:44,948 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-21 14:49:44,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:44,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:45,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:45,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:45,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-21 14:49:45,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:45,405 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:45,405 INFO L139 ounterexampleChecker]: Examining path program with hash 1087514306, occurence #1 [2024-11-21 14:49:45,405 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:45,405 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:45,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:45,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1335270583, now seen corresponding path program 1 times [2024-11-21 14:49:45,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:45,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054034941] [2024-11-21 14:49:45,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:45,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:45,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:45,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:45,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054034941] [2024-11-21 14:49:45,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054034941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:45,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:45,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:49:45,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807385279] [2024-11-21 14:49:45,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:45,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:49:45,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:45,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:49:45,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:49:45,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:45,610 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:45,610 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-21 14:49:45,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:45,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:45,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:46,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:46,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:46,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:49:46,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-21 14:49:46,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:46,176 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:46,176 INFO L139 ounterexampleChecker]: Examining path program with hash 1962991859, occurence #1 [2024-11-21 14:49:46,176 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:46,176 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:46,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash -956249743, now seen corresponding path program 1 times [2024-11-21 14:49:46,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:46,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553941151] [2024-11-21 14:49:46,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:46,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:46,202 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:49:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:46,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:49:46,231 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:49:46,231 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:49:46,231 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:49:46,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-21 14:49:46,234 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:49:46,234 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:49:46,234 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-11-21 14:49:46,259 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-11-21 14:49:46,263 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:46,280 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:49:46,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:49:46,282 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:46,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:49:47,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:47,339 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:47,339 INFO L139 ounterexampleChecker]: Examining path program with hash -256453471, occurence #1 [2024-11-21 14:49:47,339 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:47,339 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:47,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:47,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1278892446, now seen corresponding path program 1 times [2024-11-21 14:49:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:47,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446633949] [2024-11-21 14:49:47,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:47,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:47,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:47,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446633949] [2024-11-21 14:49:47,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446633949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:47,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:47,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:49:47,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978248336] [2024-11-21 14:49:47,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:47,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:49:47,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:47,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:49:47,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:49:47,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:47,363 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:47,364 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-21 14:49:47,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:50,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:50,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-21 14:49:50,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:50,261 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:50,261 INFO L139 ounterexampleChecker]: Examining path program with hash -1095696133, occurence #1 [2024-11-21 14:49:50,261 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:50,261 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:50,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:50,261 INFO L85 PathProgramCache]: Analyzing trace with hash 102855094, now seen corresponding path program 1 times [2024-11-21 14:49:50,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:50,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754062783] [2024-11-21 14:49:50,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:50,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:50,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:50,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754062783] [2024-11-21 14:49:50,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754062783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:50,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:50,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:49:50,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422796863] [2024-11-21 14:49:50,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:50,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:49:50,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:50,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:49:50,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:49:50,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:50,370 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:50,370 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-21 14:49:50,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:50,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:50,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:50,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:50,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-21 14:49:50,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:50,933 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:50,933 INFO L139 ounterexampleChecker]: Examining path program with hash 1460356149, occurence #1 [2024-11-21 14:49:50,933 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:50,933 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:50,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:50,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1630951393, now seen corresponding path program 1 times [2024-11-21 14:49:50,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:50,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336847601] [2024-11-21 14:49:50,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:50,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:51,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:51,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336847601] [2024-11-21 14:49:51,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336847601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:51,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:51,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:49:51,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849512378] [2024-11-21 14:49:51,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:51,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:49:51,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:51,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:49:51,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:49:51,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:51,153 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:51,153 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-21 14:49:51,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:51,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:51,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:51,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:51,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:49:51,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-21 14:49:51,822 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:51,822 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:51,823 INFO L139 ounterexampleChecker]: Examining path program with hash -649319199, occurence #1 [2024-11-21 14:49:51,823 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:51,823 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:51,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:51,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2082906371, now seen corresponding path program 1 times [2024-11-21 14:49:51,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:51,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514497614] [2024-11-21 14:49:51,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:51,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:51,857 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:49:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:51,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:49:51,913 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:49:51,913 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:49:51,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:49:51,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-21 14:49:51,916 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:49:51,916 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:49:51,916 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-11-21 14:49:51,969 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2024-11-21 14:49:51,971 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:51,996 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:49:51,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:49:51,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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:51,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:49:53,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:53,303 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:53,303 INFO L139 ounterexampleChecker]: Examining path program with hash -487211137, occurence #1 [2024-11-21 14:49:53,303 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:53,303 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:53,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:53,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1129604049, now seen corresponding path program 1 times [2024-11-21 14:49:53,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:53,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539296183] [2024-11-21 14:49:53,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:53,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:53,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:53,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539296183] [2024-11-21 14:49:53,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539296183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:53,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:53,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:49:53,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110668468] [2024-11-21 14:49:53,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:53,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:49:53,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:53,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:49:53,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:49:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:53,338 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:53,339 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-21 14:49:53,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:56,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:56,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-21 14:49:56,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:56,983 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:56,984 INFO L139 ounterexampleChecker]: Examining path program with hash -993977495, occurence #1 [2024-11-21 14:49:56,984 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:56,984 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:56,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:56,984 INFO L85 PathProgramCache]: Analyzing trace with hash -128570777, now seen corresponding path program 1 times [2024-11-21 14:49:56,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:56,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716343573] [2024-11-21 14:49:56,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:56,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:57,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:57,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716343573] [2024-11-21 14:49:57,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716343573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:57,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:57,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:49:57,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377972994] [2024-11-21 14:49:57,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:57,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:49:57,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:57,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:49:57,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:49:57,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:57,101 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:57,101 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-21 14:49:57,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:57,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:57,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:57,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:57,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-21 14:49:57,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:57,698 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:57,699 INFO L139 ounterexampleChecker]: Examining path program with hash -1004555747, occurence #1 [2024-11-21 14:49:57,699 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:57,699 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:57,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:57,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1852161086, now seen corresponding path program 1 times [2024-11-21 14:49:57,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:57,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973977714] [2024-11-21 14:49:57,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:57,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:57,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:57,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:57,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973977714] [2024-11-21 14:49:57,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973977714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:57,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:57,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:49:57,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424938891] [2024-11-21 14:49:57,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:57,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:49:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:57,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:49:57,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:49:57,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:57,992 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:57,992 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-21 14:49:57,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:57,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:57,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:58,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:58,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:58,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:49:58,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-21 14:49:58,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:58,888 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:58,889 INFO L139 ounterexampleChecker]: Examining path program with hash 299876461, occurence #1 [2024-11-21 14:49:58,889 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:58,889 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:58,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:58,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1690610159, now seen corresponding path program 1 times [2024-11-21 14:49:58,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:58,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126786380] [2024-11-21 14:49:58,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:58,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:58,915 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:49:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:58,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:49:58,946 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:49:58,947 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:49:58,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:49:58,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-21 14:49:58,949 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:49:58,949 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:49:58,949 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-11-21 14:49:58,978 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2024-11-21 14:49:58,981 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:59,002 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:49:59,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:49:59,003 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:59,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:50:00,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:00,502 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:00,502 INFO L139 ounterexampleChecker]: Examining path program with hash 94206760, occurence #1 [2024-11-21 14:50:00,502 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:00,502 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:00,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:00,502 INFO L85 PathProgramCache]: Analyzing trace with hash -116411094, now seen corresponding path program 1 times [2024-11-21 14:50:00,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:00,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050464668] [2024-11-21 14:50:00,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:00,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:00,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:00,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050464668] [2024-11-21 14:50:00,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050464668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:00,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:00,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:50:00,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316733747] [2024-11-21 14:50:00,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:00,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:50:00,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:00,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:50:00,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:50:00,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:00,525 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:00,525 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-21 14:50:00,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:04,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:04,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-21 14:50:04,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:04,548 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:04,548 INFO L139 ounterexampleChecker]: Examining path program with hash -1670598225, occurence #1 [2024-11-21 14:50:04,548 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:04,548 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:04,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:04,549 INFO L85 PathProgramCache]: Analyzing trace with hash -695905739, now seen corresponding path program 1 times [2024-11-21 14:50:04,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:04,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075781072] [2024-11-21 14:50:04,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:04,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:04,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:04,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075781072] [2024-11-21 14:50:04,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075781072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:04,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:04,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:50:04,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084759835] [2024-11-21 14:50:04,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:04,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:50:04,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:04,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:50:04,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:50:04,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:04,670 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:04,670 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-21 14:50:04,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:04,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:05,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:05,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:05,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-21 14:50:05,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:05,310 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:05,311 INFO L139 ounterexampleChecker]: Examining path program with hash 541101902, occurence #1 [2024-11-21 14:50:05,311 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:05,311 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:05,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:05,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1702193626, now seen corresponding path program 1 times [2024-11-21 14:50:05,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:05,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922772076] [2024-11-21 14:50:05,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:05,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:05,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:05,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922772076] [2024-11-21 14:50:05,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922772076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:05,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:05,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:50:05,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336555447] [2024-11-21 14:50:05,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:05,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:50:05,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:05,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:50:05,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:50:05,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:05,608 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:05,608 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-21 14:50:05,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:05,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:05,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:06,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:06,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:50:06,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-21 14:50:06,502 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:06,502 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:06,502 INFO L139 ounterexampleChecker]: Examining path program with hash 467839301, occurence #1 [2024-11-21 14:50:06,502 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:06,502 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:06,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:06,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1775102222, now seen corresponding path program 1 times [2024-11-21 14:50:06,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:06,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870547237] [2024-11-21 14:50:06,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:06,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:50:06,531 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:50:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:50:06,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:50:06,568 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:50:06,568 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:50:06,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:50:06,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-21 14:50:06,571 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:50:06,571 WARN L246 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:50:06,571 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-11-21 14:50:06,608 INFO L143 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2024-11-21 14:50:06,611 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:50:06,635 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:50:06,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:50:06,636 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:50:06,636 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:50:08,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:08,401 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:08,401 INFO L139 ounterexampleChecker]: Examining path program with hash 101545867, occurence #1 [2024-11-21 14:50:08,401 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:08,401 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:08,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:08,401 INFO L85 PathProgramCache]: Analyzing trace with hash -836972220, now seen corresponding path program 1 times [2024-11-21 14:50:08,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:08,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284953684] [2024-11-21 14:50:08,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:08,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:08,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:08,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284953684] [2024-11-21 14:50:08,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284953684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:08,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:08,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:50:08,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050840317] [2024-11-21 14:50:08,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:08,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:50:08,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:08,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:50:08,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:50:08,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:08,422 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:08,422 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-21 14:50:08,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:12,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:12,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-21 14:50:12,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:12,945 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:12,945 INFO L139 ounterexampleChecker]: Examining path program with hash 1616119668, occurence #1 [2024-11-21 14:50:12,945 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:12,945 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:12,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:12,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1966989512, now seen corresponding path program 1 times [2024-11-21 14:50:12,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:12,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723250709] [2024-11-21 14:50:12,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:12,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:13,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:13,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723250709] [2024-11-21 14:50:13,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723250709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:13,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:13,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:50:13,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043150064] [2024-11-21 14:50:13,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:13,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:50:13,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:13,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:50:13,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:50:13,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:13,042 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:13,042 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-21 14:50:13,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:13,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:13,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-21 14:50:13,762 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:13,762 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:13,762 INFO L139 ounterexampleChecker]: Examining path program with hash 1112475396, occurence #1 [2024-11-21 14:50:13,762 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:13,762 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:13,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:13,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1514502060, now seen corresponding path program 1 times [2024-11-21 14:50:13,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:13,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128730252] [2024-11-21 14:50:13,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:13,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:13,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:13,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128730252] [2024-11-21 14:50:13,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128730252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:13,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:13,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:50:13,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344523637] [2024-11-21 14:50:13,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:13,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:50:13,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:13,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:50:13,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:50:13,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:13,997 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:13,997 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-21 14:50:13,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:13,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:13,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:15,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:15,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:15,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:50:15,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-21 14:50:15,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:15,211 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:15,211 INFO L139 ounterexampleChecker]: Examining path program with hash -1403032988, occurence #1 [2024-11-21 14:50:15,211 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:15,211 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:15,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:15,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1714291276, now seen corresponding path program 1 times [2024-11-21 14:50:15,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:15,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000698938] [2024-11-21 14:50:15,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:15,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:50:15,238 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:50:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:50:15,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:50:15,328 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:50:15,328 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:50:15,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:50:15,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-21 14:50:15,334 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:50:15,334 WARN L246 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:50:15,334 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-11-21 14:50:15,371 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-11-21 14:50:15,376 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:50:15,405 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:50:15,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:50:15,406 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:50:15,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:50:17,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:17,432 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:17,432 INFO L139 ounterexampleChecker]: Examining path program with hash -1899810099, occurence #1 [2024-11-21 14:50:17,433 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:17,433 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:17,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash -698620668, now seen corresponding path program 1 times [2024-11-21 14:50:17,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:17,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935986173] [2024-11-21 14:50:17,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:17,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:17,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:17,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:17,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935986173] [2024-11-21 14:50:17,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935986173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:17,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:17,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:50:17,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844961188] [2024-11-21 14:50:17,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:17,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:50:17,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:17,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:50:17,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:50:17,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:17,457 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:17,457 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-21 14:50:17,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:22,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-21 14:50:22,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:22,688 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:22,688 INFO L139 ounterexampleChecker]: Examining path program with hash 617326508, occurence #1 [2024-11-21 14:50:22,688 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:22,688 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:22,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:22,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1189867798, now seen corresponding path program 1 times [2024-11-21 14:50:22,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:22,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643041848] [2024-11-21 14:50:22,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:22,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:22,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:22,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643041848] [2024-11-21 14:50:22,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643041848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:22,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:22,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:50:22,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495610933] [2024-11-21 14:50:22,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:22,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:50:22,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:22,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:50:22,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:50:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:22,784 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:22,784 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-21 14:50:22,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:22,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:23,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:23,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-21 14:50:23,750 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:23,750 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:23,750 INFO L139 ounterexampleChecker]: Examining path program with hash 1578484310, occurence #1 [2024-11-21 14:50:23,750 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:23,750 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:23,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:23,751 INFO L85 PathProgramCache]: Analyzing trace with hash -321485305, now seen corresponding path program 1 times [2024-11-21 14:50:23,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:23,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970710994] [2024-11-21 14:50:23,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:23,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:23,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:23,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970710994] [2024-11-21 14:50:23,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970710994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:23,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:23,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:50:23,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754478614] [2024-11-21 14:50:23,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:23,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:50:23,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:23,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:50:23,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:50:23,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:23,993 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:23,993 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-21 14:50:23,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:23,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:23,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:25,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:25,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:25,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:50:25,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-21 14:50:25,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:25,389 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:25,389 INFO L139 ounterexampleChecker]: Examining path program with hash 1916184603, occurence #1 [2024-11-21 14:50:25,389 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:25,389 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:25,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:25,389 INFO L85 PathProgramCache]: Analyzing trace with hash 690481621, now seen corresponding path program 1 times [2024-11-21 14:50:25,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:25,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015710428] [2024-11-21 14:50:25,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:25,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:50:25,418 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:50:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:50:25,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:50:25,459 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:50:25,459 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:50:25,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:50:25,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-21 14:50:25,462 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:50:25,463 WARN L246 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:50:25,463 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-11-21 14:50:25,507 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2024-11-21 14:50:25,512 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:50:25,539 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:50:25,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:50:25,540 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:50:25,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:50:27,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:27,909 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:27,909 INFO L139 ounterexampleChecker]: Examining path program with hash -839010539, occurence #1 [2024-11-21 14:50:27,909 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:27,909 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:27,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:27,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1174919607, now seen corresponding path program 1 times [2024-11-21 14:50:27,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:27,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958456831] [2024-11-21 14:50:27,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:27,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:27,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:27,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958456831] [2024-11-21 14:50:27,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958456831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:27,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:27,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:50:27,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034405461] [2024-11-21 14:50:27,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:27,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:50:27,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:27,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:50:27,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:50:27,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:27,933 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:27,933 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-21 14:50:27,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:34,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:34,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-21 14:50:34,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:34,043 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:34,043 INFO L139 ounterexampleChecker]: Examining path program with hash 1557372961, occurence #1 [2024-11-21 14:50:34,043 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:34,043 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:34,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:34,044 INFO L85 PathProgramCache]: Analyzing trace with hash -298718514, now seen corresponding path program 1 times [2024-11-21 14:50:34,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:34,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866603824] [2024-11-21 14:50:34,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:34,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:34,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:34,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866603824] [2024-11-21 14:50:34,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866603824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:34,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:34,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:50:34,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353303220] [2024-11-21 14:50:34,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:34,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:50:34,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:34,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:50:34,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:50:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:34,162 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:34,162 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-21 14:50:34,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:34,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:35,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:35,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:35,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-21 14:50:35,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:35,020 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:35,020 INFO L139 ounterexampleChecker]: Examining path program with hash 580590628, occurence #1 [2024-11-21 14:50:35,020 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:35,020 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:35,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:35,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1063129233, now seen corresponding path program 1 times [2024-11-21 14:50:35,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:35,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684832563] [2024-11-21 14:50:35,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:35,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:35,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:35,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684832563] [2024-11-21 14:50:35,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684832563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:35,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:35,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:50:35,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114136949] [2024-11-21 14:50:35,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:35,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:50:35,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:35,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:50:35,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:50:35,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:35,344 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:35,344 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-21 14:50:35,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:35,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:35,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:36,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:36,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:36,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:50:36,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-21 14:50:36,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:36,964 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:36,965 INFO L139 ounterexampleChecker]: Examining path program with hash 634696956, occurence #1 [2024-11-21 14:50:36,965 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:36,965 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:36,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:36,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2120590110, now seen corresponding path program 1 times [2024-11-21 14:50:36,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:36,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120656489] [2024-11-21 14:50:36,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:36,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:50:36,994 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:50:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:50:37,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:50:37,038 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:50:37,038 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:50:37,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:50:37,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-21 14:50:37,041 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:50:37,042 WARN L246 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:50:37,042 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-11-21 14:50:37,077 INFO L143 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2024-11-21 14:50:37,080 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:50:37,108 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:50:37,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:50:37,109 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:50:37,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:50:39,873 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:39,873 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:39,873 INFO L139 ounterexampleChecker]: Examining path program with hash -1882113938, occurence #1 [2024-11-21 14:50:39,873 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:39,873 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:39,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:39,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1647662118, now seen corresponding path program 1 times [2024-11-21 14:50:39,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:39,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345653637] [2024-11-21 14:50:39,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:39,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:39,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:39,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345653637] [2024-11-21 14:50:39,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345653637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:39,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:39,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:50:39,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410084096] [2024-11-21 14:50:39,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:39,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:50:39,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:39,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:50:39,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:50:39,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:39,898 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:39,898 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-21 14:50:39,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:47,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:47,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-21 14:50:47,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:47,054 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:47,054 INFO L139 ounterexampleChecker]: Examining path program with hash -705954724, occurence #1 [2024-11-21 14:50:47,054 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:47,054 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:47,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:47,055 INFO L85 PathProgramCache]: Analyzing trace with hash -110246274, now seen corresponding path program 1 times [2024-11-21 14:50:47,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:47,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123687372] [2024-11-21 14:50:47,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:47,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:47,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:47,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123687372] [2024-11-21 14:50:47,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123687372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:47,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:47,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:50:47,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009413134] [2024-11-21 14:50:47,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:47,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:50:47,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:47,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:50:47,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:50:47,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:47,170 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:47,170 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-21 14:50:47,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:47,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:48,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:48,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:48,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-21 14:50:48,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:48,182 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:48,183 INFO L139 ounterexampleChecker]: Examining path program with hash -607303561, occurence #1 [2024-11-21 14:50:48,183 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:48,183 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:48,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:48,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1695203304, now seen corresponding path program 1 times [2024-11-21 14:50:48,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:48,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618230611] [2024-11-21 14:50:48,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:48,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:48,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:48,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618230611] [2024-11-21 14:50:48,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618230611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:48,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:48,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:50:48,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459858485] [2024-11-21 14:50:48,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:48,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:50:48,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:48,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:50:48,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:50:48,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:48,561 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:48,561 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-21 14:50:48,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:48,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:48,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:50,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:50,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:50,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:50:50,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-21 14:50:50,828 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:50,828 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:50,828 INFO L139 ounterexampleChecker]: Examining path program with hash -1555569136, occurence #1 [2024-11-21 14:50:50,828 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:50,828 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:50,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:50,829 INFO L85 PathProgramCache]: Analyzing trace with hash 579165842, now seen corresponding path program 1 times [2024-11-21 14:50:50,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:50,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505295507] [2024-11-21 14:50:50,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:50,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:50:50,869 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:50:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:50:50,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:50:50,916 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:50:50,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:50:50,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:50:50,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-21 14:50:50,918 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:50:50,918 WARN L246 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:50:50,918 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-11-21 14:50:50,962 INFO L143 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2024-11-21 14:50:50,965 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:50:50,995 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:50:50,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:50:50,996 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:50:50,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:50:53,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:53,838 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:53,838 INFO L139 ounterexampleChecker]: Examining path program with hash -1689478919, occurence #1 [2024-11-21 14:50:53,838 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:53,838 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:53,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:53,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1055331954, now seen corresponding path program 1 times [2024-11-21 14:50:53,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:53,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298654127] [2024-11-21 14:50:53,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:53,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:53,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:53,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298654127] [2024-11-21 14:50:53,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298654127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:53,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:53,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:50:53,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684091765] [2024-11-21 14:50:53,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:53,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:50:53,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:53,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:50:53,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:50:53,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:53,875 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:53,875 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-21 14:50:53,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:02,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:02,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-21 14:51:02,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:02,199 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:02,199 INFO L139 ounterexampleChecker]: Examining path program with hash 438794445, occurence #1 [2024-11-21 14:51:02,199 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:02,199 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:02,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:02,200 INFO L85 PathProgramCache]: Analyzing trace with hash -506668824, now seen corresponding path program 1 times [2024-11-21 14:51:02,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:02,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191130384] [2024-11-21 14:51:02,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:02,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:51:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:51:02,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:51:02,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191130384] [2024-11-21 14:51:02,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191130384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:51:02,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:51:02,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:51:02,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157004296] [2024-11-21 14:51:02,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:51:02,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:51:02,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:51:02,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:51:02,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:51:02,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:02,352 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:51:02,352 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-21 14:51:02,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:02,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:03,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:03,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:51:03,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-21 14:51:03,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:03,472 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:03,473 INFO L139 ounterexampleChecker]: Examining path program with hash -1239994986, occurence #1 [2024-11-21 14:51:03,473 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:03,473 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:03,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:03,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1781050894, now seen corresponding path program 2 times [2024-11-21 14:51:03,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:03,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067843590] [2024-11-21 14:51:03,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:03,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:51:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:51:03,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:51:03,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067843590] [2024-11-21 14:51:03,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067843590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:51:03,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:51:03,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:51:03,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670956489] [2024-11-21 14:51:03,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:51:03,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:51:03,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:51:03,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:51:03,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:51:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:03,906 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:51:03,907 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-21 14:51:03,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:03,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:51:03,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:06,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:06,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:51:06,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:51:06,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-21 14:51:06,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:06,409 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:06,409 INFO L139 ounterexampleChecker]: Examining path program with hash -118853735, occurence #1 [2024-11-21 14:51:06,409 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:06,409 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:06,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:06,410 INFO L85 PathProgramCache]: Analyzing trace with hash -47590750, now seen corresponding path program 1 times [2024-11-21 14:51:06,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:06,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781277050] [2024-11-21 14:51:06,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:06,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:51:06,455 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:51:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:51:06,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:51:06,514 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:51:06,514 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:51:06,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:51:06,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-21 14:51:06,516 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:51:06,516 WARN L246 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:51:06,516 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-11-21 14:51:06,561 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-11-21 14:51:06,564 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:51:06,593 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:51:06,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:51:06,594 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:51:06,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:51:09,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:09,886 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:09,887 INFO L139 ounterexampleChecker]: Examining path program with hash -495754020, occurence #1 [2024-11-21 14:51:09,887 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:09,887 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:09,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:09,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2143910724, now seen corresponding path program 1 times [2024-11-21 14:51:09,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:09,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966290853] [2024-11-21 14:51:09,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:09,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:51:09,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:51:09,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:51:09,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966290853] [2024-11-21 14:51:09,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966290853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:51:09,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:51:09,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:51:09,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527200295] [2024-11-21 14:51:09,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:51:09,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:51:09,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:51:09,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:51:09,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:51:09,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:09,918 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:51:09,918 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-21 14:51:09,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:18,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:18,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-21 14:51:18,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:18,929 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:18,929 INFO L139 ounterexampleChecker]: Examining path program with hash -1568258371, occurence #1 [2024-11-21 14:51:18,929 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:18,929 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:18,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:18,930 INFO L85 PathProgramCache]: Analyzing trace with hash 977206969, now seen corresponding path program 1 times [2024-11-21 14:51:18,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:18,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841314893] [2024-11-21 14:51:18,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:18,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:51:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:51:19,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:51:19,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841314893] [2024-11-21 14:51:19,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841314893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:51:19,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:51:19,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:51:19,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029743972] [2024-11-21 14:51:19,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:51:19,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:51:19,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:51:19,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:51:19,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:51:19,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:19,235 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:51:19,235 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-21 14:51:19,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:19,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:20,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:20,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:51:20,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-11-21 14:51:20,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:20,291 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:20,292 INFO L139 ounterexampleChecker]: Examining path program with hash 725915358, occurence #1 [2024-11-21 14:51:20,292 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:20,292 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:20,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:20,292 INFO L85 PathProgramCache]: Analyzing trace with hash 43621385, now seen corresponding path program 2 times [2024-11-21 14:51:20,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:20,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020917502] [2024-11-21 14:51:20,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:20,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:51:20,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:51:20,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:51:20,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020917502] [2024-11-21 14:51:20,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020917502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:51:20,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:51:20,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:51:20,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504581792] [2024-11-21 14:51:20,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:51:20,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:51:20,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:51:20,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:51:20,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:51:20,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:20,664 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:51:20,664 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-21 14:51:20,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:20,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:51:20,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:23,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:23,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:51:23,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:51:23,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-11-21 14:51:23,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:23,515 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:23,515 INFO L139 ounterexampleChecker]: Examining path program with hash 543524587, occurence #1 [2024-11-21 14:51:23,515 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:23,515 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:23,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:23,515 INFO L85 PathProgramCache]: Analyzing trace with hash -196256322, now seen corresponding path program 1 times [2024-11-21 14:51:23,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:23,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519507071] [2024-11-21 14:51:23,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:23,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:51:23,552 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:51:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:51:23,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:51:23,608 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:51:23,608 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:51:23,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:51:23,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-11-21 14:51:23,610 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:51:23,610 WARN L246 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:51:23,610 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-11-21 14:51:23,652 INFO L143 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2024-11-21 14:51:23,655 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:51:23,835 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:51:23,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:51:23,836 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:51:23,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:51:27,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:27,365 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:27,365 INFO L139 ounterexampleChecker]: Examining path program with hash 416803721, occurence #1 [2024-11-21 14:51:27,365 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:27,365 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:27,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:27,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1601566091, now seen corresponding path program 1 times [2024-11-21 14:51:27,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:27,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160689] [2024-11-21 14:51:27,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:27,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:51:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:51:27,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:51:27,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160689] [2024-11-21 14:51:27,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:51:27,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:51:27,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:51:27,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137650659] [2024-11-21 14:51:27,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:51:27,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:51:27,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:51:27,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:51:27,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:51:27,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:27,395 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:51:27,395 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-21 14:51:27,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:37,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:37,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-11-21 14:51:37,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:37,588 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:37,588 INFO L139 ounterexampleChecker]: Examining path program with hash 1320080907, occurence #1 [2024-11-21 14:51:37,588 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:37,588 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:37,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:37,588 INFO L85 PathProgramCache]: Analyzing trace with hash 606645343, now seen corresponding path program 1 times [2024-11-21 14:51:37,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:37,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789989869] [2024-11-21 14:51:37,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:37,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:51:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:51:37,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:51:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789989869] [2024-11-21 14:51:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789989869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:51:37,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:51:37,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:51:37,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781305011] [2024-11-21 14:51:37,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:51:37,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:51:37,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:51:37,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:51:37,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:51:37,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:37,810 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:51:37,810 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-21 14:51:37,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:37,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:38,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:38,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:51:38,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-11-21 14:51:38,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:38,910 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:38,910 INFO L139 ounterexampleChecker]: Examining path program with hash -1021846015, occurence #1 [2024-11-21 14:51:38,910 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:38,910 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:38,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:38,911 INFO L85 PathProgramCache]: Analyzing trace with hash -229053493, now seen corresponding path program 2 times [2024-11-21 14:51:38,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:38,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592063132] [2024-11-21 14:51:38,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:38,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:51:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:51:39,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:51:39,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592063132] [2024-11-21 14:51:39,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592063132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:51:39,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:51:39,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:51:39,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088356440] [2024-11-21 14:51:39,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:51:39,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:51:39,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:51:39,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:51:39,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:51:39,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:39,250 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:51:39,250 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-21 14:51:39,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:39,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:51:39,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:42,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:42,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:51:42,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:51:42,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-11-21 14:51:42,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:42,762 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:42,762 INFO L139 ounterexampleChecker]: Examining path program with hash 1514245917, occurence #1 [2024-11-21 14:51:42,762 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:42,762 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:42,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:42,763 INFO L85 PathProgramCache]: Analyzing trace with hash -890665661, now seen corresponding path program 1 times [2024-11-21 14:51:42,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:42,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199371284] [2024-11-21 14:51:42,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:42,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:51:42,801 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:51:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:51:42,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:51:42,867 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:51:42,867 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:51:42,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:51:42,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-11-21 14:51:42,869 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:51:42,869 WARN L246 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:51:42,869 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-11-21 14:51:42,920 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-11-21 14:51:42,923 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:51:42,960 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:51:42,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:51:42,962 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:51:42,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:51:46,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:46,932 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:46,932 INFO L139 ounterexampleChecker]: Examining path program with hash 1676156130, occurence #1 [2024-11-21 14:51:46,932 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:46,932 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:46,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:46,932 INFO L85 PathProgramCache]: Analyzing trace with hash 31568634, now seen corresponding path program 1 times [2024-11-21 14:51:46,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:46,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815019523] [2024-11-21 14:51:46,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:46,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:51:46,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:51:46,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:51:46,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815019523] [2024-11-21 14:51:46,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815019523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:51:46,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:51:46,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:51:46,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830102270] [2024-11-21 14:51:46,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:51:46,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:51:46,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:51:46,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:51:46,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:51:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:46,964 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:51:46,964 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-21 14:51:46,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:58,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-11-21 14:51:58,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:58,086 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:58,086 INFO L139 ounterexampleChecker]: Examining path program with hash -2138582514, occurence #1 [2024-11-21 14:51:58,086 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:58,086 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:58,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:58,087 INFO L85 PathProgramCache]: Analyzing trace with hash 4284926, now seen corresponding path program 1 times [2024-11-21 14:51:58,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:58,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399251008] [2024-11-21 14:51:58,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:58,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:51:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:51:58,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:51:58,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399251008] [2024-11-21 14:51:58,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399251008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:51:58,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:51:58,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:51:58,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263745857] [2024-11-21 14:51:58,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:51:58,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:51:58,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:51:58,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:51:58,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:51:58,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:58,251 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:51:58,251 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-21 14:51:58,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:58,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:59,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:59,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:51:59,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-11-21 14:51:59,387 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:59,388 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:59,388 INFO L139 ounterexampleChecker]: Examining path program with hash 381328189, occurence #1 [2024-11-21 14:51:59,388 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:59,388 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:59,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1669306624, now seen corresponding path program 2 times [2024-11-21 14:51:59,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:59,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657777362] [2024-11-21 14:51:59,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:59,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:51:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:51:59,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:51:59,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657777362] [2024-11-21 14:51:59,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657777362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:51:59,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:51:59,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:51:59,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118789917] [2024-11-21 14:51:59,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:51:59,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:51:59,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:51:59,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:51:59,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:51:59,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:59,824 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:51:59,825 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-21 14:51:59,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:59,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:51:59,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:03,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:03,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:52:03,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:52:03,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-11-21 14:52:03,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:52:03,840 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:52:03,840 INFO L139 ounterexampleChecker]: Examining path program with hash 24019613, occurence #1 [2024-11-21 14:52:03,840 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:52:03,840 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:52:03,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:52:03,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1993376500, now seen corresponding path program 1 times [2024-11-21 14:52:03,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:52:03,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105364188] [2024-11-21 14:52:03,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:52:03,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:52:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:52:03,882 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:52:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:52:03,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:52:03,943 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:52:03,943 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:52:03,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:52:03,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-11-21 14:52:03,945 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:52:03,945 WARN L246 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:52:03,946 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2024-11-21 14:52:03,995 INFO L143 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2024-11-21 14:52:03,999 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:52:04,029 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:52:04,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:52:04,029 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:52:04,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:52:08,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:52:08,669 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:52:08,669 INFO L139 ounterexampleChecker]: Examining path program with hash -21232280, occurence #1 [2024-11-21 14:52:08,669 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:52:08,669 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:52:08,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:52:08,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1707307024, now seen corresponding path program 1 times [2024-11-21 14:52:08,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:52:08,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762121004] [2024-11-21 14:52:08,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:52:08,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:52:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:52:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:52:08,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:52:08,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762121004] [2024-11-21 14:52:08,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762121004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:52:08,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:52:08,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:52:08,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20900143] [2024-11-21 14:52:08,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:52:08,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:52:08,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:52:08,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:52:08,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:52:08,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:08,701 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:52:08,702 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-21 14:52:08,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:20,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:20,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-11-21 14:52:20,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:52:20,636 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:52:20,637 INFO L139 ounterexampleChecker]: Examining path program with hash -1522405736, occurence #1 [2024-11-21 14:52:20,637 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:52:20,637 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:52:20,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:52:20,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1278600843, now seen corresponding path program 1 times [2024-11-21 14:52:20,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:52:20,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254425859] [2024-11-21 14:52:20,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:52:20,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:52:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:52:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:52:20,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:52:20,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254425859] [2024-11-21 14:52:20,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254425859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:52:20,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:52:20,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:52:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528734831] [2024-11-21 14:52:20,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:52:20,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:52:20,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:52:20,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:52:20,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:52:20,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:20,951 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:52:20,952 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-21 14:52:20,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:20,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:52:22,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-11-21 14:52:22,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:52:22,079 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:52:22,079 INFO L139 ounterexampleChecker]: Examining path program with hash -1676197624, occurence #1 [2024-11-21 14:52:22,079 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:52:22,079 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:52:22,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:52:22,079 INFO L85 PathProgramCache]: Analyzing trace with hash -249014045, now seen corresponding path program 2 times [2024-11-21 14:52:22,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:52:22,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947442537] [2024-11-21 14:52:22,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:52:22,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:52:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:52:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:52:22,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:52:22,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947442537] [2024-11-21 14:52:22,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947442537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:52:22,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:52:22,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:52:22,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95462578] [2024-11-21 14:52:22,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:52:22,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:52:22,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:52:22,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:52:22,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:52:22,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:22,472 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:52:22,472 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-21 14:52:22,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:22,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:52:22,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:26,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:26,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:52:26,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:52:26,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-11-21 14:52:26,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:52:26,745 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:52:26,745 INFO L139 ounterexampleChecker]: Examining path program with hash -633702809, occurence #1 [2024-11-21 14:52:26,745 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:52:26,745 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:52:26,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:52:26,745 INFO L85 PathProgramCache]: Analyzing trace with hash -46484468, now seen corresponding path program 1 times [2024-11-21 14:52:26,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:52:26,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356451058] [2024-11-21 14:52:26,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:52:26,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:52:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:52:26,787 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:52:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:52:26,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:52:26,878 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:52:26,879 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:52:26,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:52:26,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-11-21 14:52:26,881 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:52:26,881 WARN L246 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:52:26,881 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2024-11-21 14:52:26,933 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-11-21 14:52:26,936 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:52:26,977 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:52:26,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:52:26,978 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:52:26,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:52:31,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:52:31,760 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:52:31,761 INFO L139 ounterexampleChecker]: Examining path program with hash 973155926, occurence #1 [2024-11-21 14:52:31,761 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:52:31,761 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:52:31,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:52:31,761 INFO L85 PathProgramCache]: Analyzing trace with hash 482705994, now seen corresponding path program 1 times [2024-11-21 14:52:31,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:52:31,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686176507] [2024-11-21 14:52:31,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:52:31,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:52:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:52:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:52:31,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:52:31,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686176507] [2024-11-21 14:52:31,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686176507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:52:31,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:52:31,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:52:31,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767607128] [2024-11-21 14:52:31,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:52:31,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:52:31,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:52:31,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:52:31,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:52:31,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:31,795 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:52:31,796 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-21 14:52:31,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:45,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:45,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-11-21 14:52:45,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:52:45,241 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:52:45,242 INFO L139 ounterexampleChecker]: Examining path program with hash -1734700595, occurence #1 [2024-11-21 14:52:45,242 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:52:45,242 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:52:45,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:52:45,242 INFO L85 PathProgramCache]: Analyzing trace with hash -550657443, now seen corresponding path program 1 times [2024-11-21 14:52:45,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:52:45,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983671807] [2024-11-21 14:52:45,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:52:45,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:52:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:52:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:52:45,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:52:45,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983671807] [2024-11-21 14:52:45,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983671807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:52:45,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:52:45,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:52:45,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617735346] [2024-11-21 14:52:45,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:52:45,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:52:45,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:52:45,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:52:45,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:52:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:45,580 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:52:45,580 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-21 14:52:45,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:45,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:46,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:46,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:52:46,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-11-21 14:52:46,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:52:46,939 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:52:46,940 INFO L139 ounterexampleChecker]: Examining path program with hash 634693564, occurence #1 [2024-11-21 14:52:46,940 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:52:46,940 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:52:46,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:52:46,940 INFO L85 PathProgramCache]: Analyzing trace with hash -255274015, now seen corresponding path program 2 times [2024-11-21 14:52:46,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:52:46,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060332670] [2024-11-21 14:52:46,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:52:46,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:52:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:52:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:52:47,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:52:47,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060332670] [2024-11-21 14:52:47,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060332670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:52:47,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:52:47,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:52:47,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043073681] [2024-11-21 14:52:47,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:52:47,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:52:47,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:52:47,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:52:47,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:52:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:47,487 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:52:47,487 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-21 14:52:47,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:47,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:52:47,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:52:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:52:52,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-11-21 14:52:52,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:52:52,551 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:52:52,551 INFO L139 ounterexampleChecker]: Examining path program with hash -1431667830, occurence #1 [2024-11-21 14:52:52,551 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:52:52,552 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:52:52,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:52:52,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1874514837, now seen corresponding path program 1 times [2024-11-21 14:52:52,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:52:52,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369948678] [2024-11-21 14:52:52,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:52:52,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:52:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:52:52,597 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:52:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:52:52,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:52:52,672 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:52:52,672 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:52:52,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:52:52,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-11-21 14:52:52,674 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:52:52,675 WARN L246 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:52:52,675 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2024-11-21 14:52:52,730 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-11-21 14:52:52,733 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:52:52,920 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:52:52,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:52:52,921 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:52:52,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:52:58,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:52:58,651 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:52:58,651 INFO L139 ounterexampleChecker]: Examining path program with hash -2110578554, occurence #1 [2024-11-21 14:52:58,651 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:52:58,651 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:52:58,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:52:58,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1782886199, now seen corresponding path program 1 times [2024-11-21 14:52:58,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:52:58,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292262918] [2024-11-21 14:52:58,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:52:58,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:52:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:52:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:52:58,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:52:58,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292262918] [2024-11-21 14:52:58,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292262918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:52:58,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:52:58,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:52:58,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224234938] [2024-11-21 14:52:58,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:52:58,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:52:58,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:52:58,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:52:58,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:52:58,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:58,690 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:52:58,690 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-21 14:52:58,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:13,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:13,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-11-21 14:53:13,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:53:13,138 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:53:13,138 INFO L139 ounterexampleChecker]: Examining path program with hash 87699783, occurence #1 [2024-11-21 14:53:13,138 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:53:13,138 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:53:13,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:53:13,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1517236626, now seen corresponding path program 1 times [2024-11-21 14:53:13,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:53:13,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753017155] [2024-11-21 14:53:13,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:53:13,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:53:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:53:13,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:53:13,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:53:13,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753017155] [2024-11-21 14:53:13,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753017155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:53:13,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:53:13,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:53:13,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910681757] [2024-11-21 14:53:13,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:53:13,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:53:13,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:53:13,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:53:13,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:53:13,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:13,352 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:53:13,352 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-21 14:53:13,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:13,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:14,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:14,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:53:14,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-11-21 14:53:14,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:53:14,727 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:53:14,727 INFO L139 ounterexampleChecker]: Examining path program with hash -110603885, occurence #1 [2024-11-21 14:53:14,727 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:53:14,727 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:53:14,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:53:14,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1342218824, now seen corresponding path program 2 times [2024-11-21 14:53:14,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:53:14,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347903408] [2024-11-21 14:53:14,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:53:14,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:53:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:53:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:53:15,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:53:15,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347903408] [2024-11-21 14:53:15,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347903408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:53:15,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:53:15,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:53:15,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72605321] [2024-11-21 14:53:15,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:53:15,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:53:15,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:53:15,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:53:15,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:53:15,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:15,224 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:53:15,224 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-21 14:53:15,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:15,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:53:15,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:20,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:20,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:53:20,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:53:20,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-11-21 14:53:20,693 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:53:20,693 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:53:20,694 INFO L139 ounterexampleChecker]: Examining path program with hash -1010432207, occurence #1 [2024-11-21 14:53:20,694 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:53:20,694 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:53:20,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:53:20,694 INFO L85 PathProgramCache]: Analyzing trace with hash 155400449, now seen corresponding path program 1 times [2024-11-21 14:53:20,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:53:20,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325024051] [2024-11-21 14:53:20,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:53:20,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:53:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:53:20,754 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:53:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:53:20,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:53:20,846 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:53:20,846 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:53:20,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:53:20,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-11-21 14:53:20,849 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:53:20,849 WARN L246 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:53:20,849 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2024-11-21 14:53:20,908 INFO L143 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2024-11-21 14:53:20,912 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:53:20,957 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:53:20,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:53:20,958 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:53:20,958 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:53:26,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:53:26,917 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:53:26,917 INFO L139 ounterexampleChecker]: Examining path program with hash 2080760057, occurence #1 [2024-11-21 14:53:26,917 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:53:26,917 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:53:26,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:53:26,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1374408144, now seen corresponding path program 1 times [2024-11-21 14:53:26,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:53:26,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038097134] [2024-11-21 14:53:26,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:53:26,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:53:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:53:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:53:26,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:53:26,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038097134] [2024-11-21 14:53:26,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038097134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:53:26,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:53:26,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:53:26,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828590233] [2024-11-21 14:53:26,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:53:26,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:53:26,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:53:26,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:53:26,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:53:26,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:26,974 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:53:26,974 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-21 14:53:26,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:43,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:43,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-11-21 14:53:43,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:53:43,011 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:53:43,012 INFO L139 ounterexampleChecker]: Examining path program with hash -1756952083, occurence #1 [2024-11-21 14:53:43,012 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:53:43,012 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:53:43,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:53:43,012 INFO L85 PathProgramCache]: Analyzing trace with hash -140117947, now seen corresponding path program 1 times [2024-11-21 14:53:43,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:53:43,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459850666] [2024-11-21 14:53:43,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:53:43,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:53:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:53:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:53:43,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:53:43,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459850666] [2024-11-21 14:53:43,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459850666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:53:43,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:53:43,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:53:43,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791771432] [2024-11-21 14:53:43,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:53:43,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:53:43,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:53:43,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:53:43,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:53:43,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:43,427 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:53:43,427 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-21 14:53:43,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:43,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:44,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:44,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:53:44,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-11-21 14:53:44,621 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:53:44,621 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:53:44,621 INFO L139 ounterexampleChecker]: Examining path program with hash 1997676272, occurence #1 [2024-11-21 14:53:44,621 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:53:44,621 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:53:44,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:53:44,622 INFO L85 PathProgramCache]: Analyzing trace with hash 268834941, now seen corresponding path program 2 times [2024-11-21 14:53:44,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:53:44,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520406917] [2024-11-21 14:53:44,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:53:44,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:53:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:53:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:53:45,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:53:45,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520406917] [2024-11-21 14:53:45,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520406917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:53:45,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:53:45,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:53:45,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802738937] [2024-11-21 14:53:45,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:53:45,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:53:45,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:53:45,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:53:45,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:53:45,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:45,152 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:53:45,152 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-21 14:53:45,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:45,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:53:45,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:51,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:51,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:53:51,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:53:51,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-11-21 14:53:51,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:53:51,222 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:53:51,222 INFO L139 ounterexampleChecker]: Examining path program with hash -593474162, occurence #1 [2024-11-21 14:53:51,222 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:53:51,222 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:53:51,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:53:51,222 INFO L85 PathProgramCache]: Analyzing trace with hash -385773780, now seen corresponding path program 1 times [2024-11-21 14:53:51,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:53:51,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676924566] [2024-11-21 14:53:51,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:53:51,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:53:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:53:51,272 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:53:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:53:51,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:53:51,367 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:53:51,368 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:53:51,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:53:51,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-11-21 14:53:51,370 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:53:51,370 WARN L246 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:53:51,370 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2024-11-21 14:53:51,434 INFO L143 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2024-11-21 14:53:51,440 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:53:51,484 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:53:51,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:53:51,485 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:53:51,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:53:57,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:53:57,974 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:53:57,974 INFO L139 ounterexampleChecker]: Examining path program with hash -1688427851, occurence #1 [2024-11-21 14:53:57,974 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:53:57,974 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:53:57,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:53:57,975 INFO L85 PathProgramCache]: Analyzing trace with hash -692216922, now seen corresponding path program 1 times [2024-11-21 14:53:57,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:53:57,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890198331] [2024-11-21 14:53:57,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:53:57,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:53:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:53:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:53:58,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:53:58,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890198331] [2024-11-21 14:53:58,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890198331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:53:58,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:53:58,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:53:58,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131756941] [2024-11-21 14:53:58,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:53:58,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:53:58,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:53:58,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:53:58,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:53:58,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:58,015 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:53:58,015 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-21 14:53:58,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:15,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:15,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-11-21 14:54:15,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:54:15,571 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:54:15,572 INFO L139 ounterexampleChecker]: Examining path program with hash 144737226, occurence #1 [2024-11-21 14:54:15,572 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:54:15,572 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:54:15,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:54:15,572 INFO L85 PathProgramCache]: Analyzing trace with hash -216212121, now seen corresponding path program 1 times [2024-11-21 14:54:15,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:54:15,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513622392] [2024-11-21 14:54:15,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:54:15,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:54:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:54:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:54:15,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:54:15,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513622392] [2024-11-21 14:54:15,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513622392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:54:15,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:54:15,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:54:15,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228497965] [2024-11-21 14:54:15,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:54:15,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:54:15,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:54:15,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:54:15,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:54:15,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:15,782 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:54:15,782 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-21 14:54:15,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:15,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:17,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:17,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:54:17,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-11-21 14:54:17,036 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:54:17,036 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:54:17,036 INFO L139 ounterexampleChecker]: Examining path program with hash 1381273279, occurence #1 [2024-11-21 14:54:17,036 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:54:17,036 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:54:17,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:54:17,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1231269569, now seen corresponding path program 2 times [2024-11-21 14:54:17,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:54:17,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187041743] [2024-11-21 14:54:17,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:54:17,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:54:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:54:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:54:17,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:54:17,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187041743] [2024-11-21 14:54:17,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187041743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:54:17,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:54:17,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:54:17,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461376258] [2024-11-21 14:54:17,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:54:17,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:54:17,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:54:17,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:54:17,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:54:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:17,467 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:54:17,467 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-21 14:54:17,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:17,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:54:17,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:54:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:54:24,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-11-21 14:54:24,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:54:24,116 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:54:24,117 INFO L139 ounterexampleChecker]: Examining path program with hash 953165620, occurence #1 [2024-11-21 14:54:24,117 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:54:24,117 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:54:24,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:54:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash 700307854, now seen corresponding path program 1 times [2024-11-21 14:54:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:54:24,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288929819] [2024-11-21 14:54:24,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:54:24,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:54:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:54:24,176 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:54:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:54:24,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:54:24,278 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:54:24,278 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:54:24,278 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:54:24,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-11-21 14:54:24,280 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:54:24,281 WARN L246 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:54:24,281 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2024-11-21 14:54:24,347 INFO L143 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2024-11-21 14:54:24,351 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:54:24,393 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:54:24,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:54:24,394 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:54:24,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:54:32,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:54:32,140 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:54:32,141 INFO L139 ounterexampleChecker]: Examining path program with hash -1922549906, occurence #1 [2024-11-21 14:54:32,141 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:54:32,141 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:54:32,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:54:32,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1004594122, now seen corresponding path program 1 times [2024-11-21 14:54:32,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:54:32,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740692254] [2024-11-21 14:54:32,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:54:32,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:54:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:54:32,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:54:32,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:54:32,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740692254] [2024-11-21 14:54:32,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740692254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:54:32,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:54:32,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:54:32,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273668776] [2024-11-21 14:54:32,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:54:32,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:54:32,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:54:32,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:54:32,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:54:32,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:32,187 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:54:32,187 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-21 14:54:32,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:50,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:50,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-11-21 14:54:50,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:54:50,863 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:54:50,864 INFO L139 ounterexampleChecker]: Examining path program with hash 602271957, occurence #1 [2024-11-21 14:54:50,864 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:54:50,864 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:54:50,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:54:50,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1075055618, now seen corresponding path program 1 times [2024-11-21 14:54:50,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:54:50,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368268729] [2024-11-21 14:54:50,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:54:50,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:54:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:54:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:54:51,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:54:51,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368268729] [2024-11-21 14:54:51,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368268729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:54:51,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:54:51,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:54:51,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980383908] [2024-11-21 14:54:51,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:54:51,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:54:51,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:54:51,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:54:51,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:54:51,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:51,091 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:54:51,092 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-21 14:54:51,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:51,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:52,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:52,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:54:52,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-11-21 14:54:52,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:54:52,337 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:54:52,338 INFO L139 ounterexampleChecker]: Examining path program with hash 2073050145, occurence #1 [2024-11-21 14:54:52,338 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:54:52,338 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:54:52,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:54:52,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1316292632, now seen corresponding path program 2 times [2024-11-21 14:54:52,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:54:52,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487915056] [2024-11-21 14:54:52,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:54:52,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:54:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:54:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:54:52,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:54:52,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487915056] [2024-11-21 14:54:52,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487915056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:54:52,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:54:52,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:54:52,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357868495] [2024-11-21 14:54:52,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:54:52,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:54:52,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:54:52,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:54:52,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:54:52,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:52,922 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:54:52,922 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-21 14:54:52,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:52,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:54:52,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:00,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:00,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:55:00,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:55:00,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-11-21 14:55:00,117 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:55:00,117 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:55:00,117 INFO L139 ounterexampleChecker]: Examining path program with hash -781649078, occurence #1 [2024-11-21 14:55:00,117 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:55:00,117 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:55:00,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:55:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1155610149, now seen corresponding path program 1 times [2024-11-21 14:55:00,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:55:00,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20407707] [2024-11-21 14:55:00,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:55:00,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:55:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:55:00,177 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:55:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:55:00,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:55:00,296 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:55:00,296 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:55:00,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:55:00,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-11-21 14:55:00,299 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:55:00,299 WARN L246 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:55:00,299 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2024-11-21 14:55:00,364 INFO L143 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2024-11-21 14:55:00,368 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:55:00,418 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:55:00,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:55:00,418 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:55:00,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:55:07,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:55:07,787 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:55:07,787 INFO L139 ounterexampleChecker]: Examining path program with hash 1560111718, occurence #1 [2024-11-21 14:55:07,787 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:55:07,787 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:55:07,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:55:07,787 INFO L85 PathProgramCache]: Analyzing trace with hash -525776073, now seen corresponding path program 1 times [2024-11-21 14:55:07,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:55:07,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431910943] [2024-11-21 14:55:07,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:55:07,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:55:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:55:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:55:08,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:55:08,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431910943] [2024-11-21 14:55:08,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431910943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:55:08,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:55:08,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:55:08,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056442722] [2024-11-21 14:55:08,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:55:08,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:55:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:55:08,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:55:08,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:55:08,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:08,017 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:55:08,018 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-21 14:55:08,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:28,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:28,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-11-21 14:55:28,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:55:28,137 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:55:28,137 INFO L139 ounterexampleChecker]: Examining path program with hash -983155104, occurence #1 [2024-11-21 14:55:28,137 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:55:28,138 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:55:28,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:55:28,138 INFO L85 PathProgramCache]: Analyzing trace with hash -297318007, now seen corresponding path program 1 times [2024-11-21 14:55:28,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:55:28,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191706079] [2024-11-21 14:55:28,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:55:28,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:55:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:55:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:55:28,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:55:28,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191706079] [2024-11-21 14:55:28,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191706079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:55:28,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:55:28,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:55:28,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009162980] [2024-11-21 14:55:28,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:55:28,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:55:28,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:55:28,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:55:28,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:55:28,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:28,358 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:55:28,358 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-21 14:55:28,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:28,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:29,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:29,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:55:29,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-11-21 14:55:29,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:55:29,665 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:55:29,666 INFO L139 ounterexampleChecker]: Examining path program with hash 352018882, occurence #1 [2024-11-21 14:55:29,666 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:55:29,666 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:55:29,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:55:29,666 INFO L85 PathProgramCache]: Analyzing trace with hash -953039169, now seen corresponding path program 2 times [2024-11-21 14:55:29,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:55:29,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80898686] [2024-11-21 14:55:29,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:55:29,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:55:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:55:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:55:30,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:55:30,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80898686] [2024-11-21 14:55:30,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80898686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:55:30,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:55:30,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:55:30,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255560263] [2024-11-21 14:55:30,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:55:30,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:55:30,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:55:30,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:55:30,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:55:30,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:30,152 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:55:30,152 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-21 14:55:30,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:30,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:55:30,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:55:37,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:55:37,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-11-21 14:55:37,818 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:55:37,818 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:55:37,818 INFO L139 ounterexampleChecker]: Examining path program with hash 1984313707, occurence #1 [2024-11-21 14:55:37,818 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:55:37,818 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:55:37,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:55:37,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1932092386, now seen corresponding path program 1 times [2024-11-21 14:55:37,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:55:37,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177451289] [2024-11-21 14:55:37,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:55:37,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:55:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:55:37,879 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:55:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:55:37,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:55:37,999 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:55:37,999 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:55:38,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:55:38,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-11-21 14:55:38,003 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:55:38,004 WARN L246 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:55:38,004 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2024-11-21 14:55:38,077 INFO L143 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2024-11-21 14:55:38,081 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:55:38,135 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:55:38,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:55:38,136 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:55:38,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:55:46,367 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:55:46,367 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:55:46,368 INFO L139 ounterexampleChecker]: Examining path program with hash 33063975, occurence #1 [2024-11-21 14:55:46,368 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:55:46,368 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:55:46,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:55:46,368 INFO L85 PathProgramCache]: Analyzing trace with hash 827617002, now seen corresponding path program 1 times [2024-11-21 14:55:46,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:55:46,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119740751] [2024-11-21 14:55:46,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:55:46,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:55:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:55:46,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:55:46,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:55:46,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119740751] [2024-11-21 14:55:46,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119740751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:55:46,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:55:46,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:55:46,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35157706] [2024-11-21 14:55:46,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:55:46,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:55:46,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:55:46,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:55:46,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:55:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:46,416 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:55:46,416 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-21 14:55:46,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:07,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-11-21 14:56:07,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:56:07,954 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:56:07,955 INFO L139 ounterexampleChecker]: Examining path program with hash -1847080958, occurence #1 [2024-11-21 14:56:07,955 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:56:07,955 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:56:07,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:56:07,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1095148921, now seen corresponding path program 1 times [2024-11-21 14:56:07,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:56:07,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394829309] [2024-11-21 14:56:07,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:56:07,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:56:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:56:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:56:08,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:56:08,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394829309] [2024-11-21 14:56:08,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394829309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:56:08,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:56:08,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:56:08,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821420356] [2024-11-21 14:56:08,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:56:08,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:56:08,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:56:08,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:56:08,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:56:08,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:08,357 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:56:08,357 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-21 14:56:08,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:08,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:56:09,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-11-21 14:56:09,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:56:09,735 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:56:09,736 INFO L139 ounterexampleChecker]: Examining path program with hash -1597350512, occurence #1 [2024-11-21 14:56:09,736 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:56:09,736 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:56:09,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:56:09,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1323228643, now seen corresponding path program 2 times [2024-11-21 14:56:09,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:56:09,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997142358] [2024-11-21 14:56:09,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:56:09,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:56:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:56:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:56:10,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:56:10,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997142358] [2024-11-21 14:56:10,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997142358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:56:10,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:56:10,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:56:10,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993513353] [2024-11-21 14:56:10,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:56:10,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:56:10,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:56:10,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:56:10,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:56:10,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:10,242 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:56:10,243 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-21 14:56:10,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:10,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:56:10,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:18,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:56:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:56:18,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-11-21 14:56:18,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:56:18,707 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:56:18,707 INFO L139 ounterexampleChecker]: Examining path program with hash -173654343, occurence #1 [2024-11-21 14:56:18,707 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:56:18,707 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:56:18,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:56:18,708 INFO L85 PathProgramCache]: Analyzing trace with hash 485453622, now seen corresponding path program 1 times [2024-11-21 14:56:18,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:56:18,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998323274] [2024-11-21 14:56:18,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:56:18,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:56:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:56:18,771 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:56:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:56:18,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:56:18,889 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:56:18,889 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:56:18,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:56:18,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-11-21 14:56:18,892 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:56:18,893 WARN L246 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:56:18,893 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2024-11-21 14:56:18,956 INFO L143 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2024-11-21 14:56:19,110 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:56:19,174 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:56:19,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:56:19,175 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:56:19,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:56:27,830 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:56:27,830 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:56:27,830 INFO L139 ounterexampleChecker]: Examining path program with hash -1045992437, occurence #1 [2024-11-21 14:56:27,830 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:56:27,830 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:56:27,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:56:27,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1446703376, now seen corresponding path program 1 times [2024-11-21 14:56:27,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:56:27,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145058666] [2024-11-21 14:56:27,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:56:27,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:56:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:56:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:56:27,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:56:27,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145058666] [2024-11-21 14:56:27,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145058666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:56:27,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:56:27,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:56:27,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238074787] [2024-11-21 14:56:27,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:56:27,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:56:27,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:56:27,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:56:27,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:56:27,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:27,882 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:56:27,882 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-21 14:56:27,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:51,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:51,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-11-21 14:56:51,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:56:51,122 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:56:51,122 INFO L139 ounterexampleChecker]: Examining path program with hash 516684998, occurence #1 [2024-11-21 14:56:51,122 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:56:51,122 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:56:51,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:56:51,123 INFO L85 PathProgramCache]: Analyzing trace with hash -72610012, now seen corresponding path program 1 times [2024-11-21 14:56:51,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:56:51,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779519155] [2024-11-21 14:56:51,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:56:51,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:56:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:56:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:56:51,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:56:51,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779519155] [2024-11-21 14:56:51,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779519155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:56:51,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:56:51,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:56:51,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668346878] [2024-11-21 14:56:51,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:56:51,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:56:51,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:56:51,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:56:51,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:56:51,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:51,368 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:56:51,368 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-21 14:56:51,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:51,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:52,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:52,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:56:52,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-11-21 14:56:52,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:56:52,874 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:56:52,874 INFO L139 ounterexampleChecker]: Examining path program with hash -742282455, occurence #1 [2024-11-21 14:56:52,874 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:56:52,874 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:56:52,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:56:52,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1394521210, now seen corresponding path program 2 times [2024-11-21 14:56:52,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:56:52,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501048486] [2024-11-21 14:56:52,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:56:52,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:56:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:56:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:56:53,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:56:53,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501048486] [2024-11-21 14:56:53,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501048486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:56:53,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:56:53,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:56:53,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230916249] [2024-11-21 14:56:53,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:56:53,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:56:53,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:56:53,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:56:53,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:56:53,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:53,474 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:56:53,474 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-21 14:56:53,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:53,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:56:53,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:02,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:02,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:57:02,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:57:02,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-11-21 14:57:02,797 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:57:02,797 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:57:02,797 INFO L139 ounterexampleChecker]: Examining path program with hash -1387828724, occurence #1 [2024-11-21 14:57:02,797 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:57:02,797 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:57:02,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:57:02,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1805482284, now seen corresponding path program 1 times [2024-11-21 14:57:02,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:57:02,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785221657] [2024-11-21 14:57:02,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:57:02,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:57:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:57:02,880 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:57:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:57:03,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:57:03,021 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:57:03,021 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:57:03,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:57:03,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-11-21 14:57:03,025 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:57:03,025 WARN L246 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:57:03,025 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2024-11-21 14:57:03,104 INFO L143 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2024-11-21 14:57:03,110 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:57:03,167 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:57:03,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:57:03,168 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:57:03,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:57:12,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:57:12,957 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:57:12,957 INFO L139 ounterexampleChecker]: Examining path program with hash -803455116, occurence #1 [2024-11-21 14:57:12,957 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:57:12,957 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:57:12,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:57:12,958 INFO L85 PathProgramCache]: Analyzing trace with hash 626924120, now seen corresponding path program 1 times [2024-11-21 14:57:12,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:57:12,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884131056] [2024-11-21 14:57:12,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:57:12,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:57:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:57:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:57:13,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:57:13,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884131056] [2024-11-21 14:57:13,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884131056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:57:13,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:57:13,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:57:13,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657329067] [2024-11-21 14:57:13,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:57:13,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:57:13,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:57:13,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:57:13,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:57:13,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:13,011 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:57:13,011 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-21 14:57:13,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:39,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:39,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-11-21 14:57:39,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:57:39,688 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:57:39,689 INFO L139 ounterexampleChecker]: Examining path program with hash -940188394, occurence #1 [2024-11-21 14:57:39,689 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:57:39,689 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:57:39,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:57:39,689 INFO L85 PathProgramCache]: Analyzing trace with hash 523883764, now seen corresponding path program 1 times [2024-11-21 14:57:39,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:57:39,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464430897] [2024-11-21 14:57:39,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:57:39,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:57:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:57:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:57:39,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:57:39,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464430897] [2024-11-21 14:57:39,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464430897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:57:39,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:57:39,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:57:39,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882080793] [2024-11-21 14:57:39,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:57:39,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:57:39,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:57:39,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:57:39,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:57:39,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:39,978 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:57:39,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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-21 14:57:39,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:39,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:41,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:57:41,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-11-21 14:57:41,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:57:41,440 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:57:41,440 INFO L139 ounterexampleChecker]: Examining path program with hash 291451605, occurence #1 [2024-11-21 14:57:41,441 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:57:41,441 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:57:41,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:57:41,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1195994470, now seen corresponding path program 2 times [2024-11-21 14:57:41,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:57:41,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946752779] [2024-11-21 14:57:41,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:57:41,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:57:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:57:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:57:42,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:57:42,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946752779] [2024-11-21 14:57:42,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946752779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:57:42,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:57:42,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:57:42,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907841616] [2024-11-21 14:57:42,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:57:42,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:57:42,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:57:42,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:57:42,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:57:42,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:42,087 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:57:42,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 4 states have internal predecessors, (490), 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-21 14:57:42,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:42,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:57:42,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:57:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:57:52,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-11-21 14:57:52,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:57:52,033 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:57:52,033 INFO L139 ounterexampleChecker]: Examining path program with hash 1890609997, occurence #1 [2024-11-21 14:57:52,033 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:57:52,034 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:57:52,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:57:52,034 INFO L85 PathProgramCache]: Analyzing trace with hash -908759149, now seen corresponding path program 1 times [2024-11-21 14:57:52,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:57:52,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507535026] [2024-11-21 14:57:52,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:57:52,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:57:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:57:52,108 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:57:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:57:52,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:57:52,524 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:57:52,525 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:57:52,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:57:52,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-11-21 14:57:52,532 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:57:52,538 WARN L246 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:57:52,538 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2024-11-21 14:57:52,674 INFO L143 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2024-11-21 14:57:52,688 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:57:52,803 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:57:52,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:57:52,806 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:57:52,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:58:04,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:58:04,002 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:58:04,002 INFO L139 ounterexampleChecker]: Examining path program with hash -531526863, occurence #1 [2024-11-21 14:58:04,002 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:58:04,002 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:58:04,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:58:04,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2076751815, now seen corresponding path program 1 times [2024-11-21 14:58:04,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:58:04,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123338447] [2024-11-21 14:58:04,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:58:04,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:58:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:58:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:58:04,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:58:04,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123338447] [2024-11-21 14:58:04,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123338447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:58:04,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:58:04,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:58:04,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732415810] [2024-11-21 14:58:04,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:58:04,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:58:04,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:58:04,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:58:04,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:58:04,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:04,061 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:58:04,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 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-21 14:58:04,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:31,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:31,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-11-21 14:58:31,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:58:31,903 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:58:31,903 INFO L139 ounterexampleChecker]: Examining path program with hash 679286627, occurence #1 [2024-11-21 14:58:31,903 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:58:31,903 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:58:31,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:58:31,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1696401921, now seen corresponding path program 1 times [2024-11-21 14:58:31,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:58:31,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619470843] [2024-11-21 14:58:31,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:58:31,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:58:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:58:32,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:58:32,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:58:32,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619470843] [2024-11-21 14:58:32,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619470843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:58:32,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:58:32,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:58:32,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433753683] [2024-11-21 14:58:32,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:58:32,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:58:32,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:58:32,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:58:32,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:58:32,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:32,460 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:58:32,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 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-21 14:58:32,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:32,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:34,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:34,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:58:34,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-11-21 14:58:34,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:58:34,637 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:58:34,637 INFO L139 ounterexampleChecker]: Examining path program with hash 1274357499, occurence #1 [2024-11-21 14:58:34,637 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:58:34,637 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:58:34,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:58:34,638 INFO L85 PathProgramCache]: Analyzing trace with hash 809533293, now seen corresponding path program 2 times [2024-11-21 14:58:34,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:58:34,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784724851] [2024-11-21 14:58:34,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:58:34,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:58:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:58:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:58:35,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:58:35,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784724851] [2024-11-21 14:58:35,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784724851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:58:35,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:58:35,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:58:35,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673320724] [2024-11-21 14:58:35,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:58:35,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:58:35,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:58:35,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:58:35,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:58:35,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:35,691 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:58:35,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 4 states have internal predecessors, (508), 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-21 14:58:35,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:35,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:58:35,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:58:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:58:46,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-11-21 14:58:46,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:58:46,340 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:58:46,340 INFO L139 ounterexampleChecker]: Examining path program with hash 976565516, occurence #1 [2024-11-21 14:58:46,340 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:58:46,340 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:58:46,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:58:46,340 INFO L85 PathProgramCache]: Analyzing trace with hash 392893973, now seen corresponding path program 1 times [2024-11-21 14:58:46,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:58:46,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615485125] [2024-11-21 14:58:46,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:58:46,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:58:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:58:46,416 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:58:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:58:46,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:58:46,524 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:58:46,524 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:58:46,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:58:46,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-11-21 14:58:46,527 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:58:46,527 WARN L246 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:58:46,527 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2024-11-21 14:58:46,605 INFO L143 ThreadInstanceAdder]: Constructed 30 joinOtherThreadTransitions. [2024-11-21 14:58:46,609 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:58:46,670 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:58:46,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:58:46,671 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:58:46,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:58:58,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:58:58,625 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:58:58,625 INFO L139 ounterexampleChecker]: Examining path program with hash -556281412, occurence #1 [2024-11-21 14:58:58,625 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:58:58,625 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:58:58,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:58:58,626 INFO L85 PathProgramCache]: Analyzing trace with hash 65557290, now seen corresponding path program 1 times [2024-11-21 14:58:58,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:58:58,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675574781] [2024-11-21 14:58:58,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:58:58,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:58:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:58:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:58:58,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:58:58,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675574781] [2024-11-21 14:58:58,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675574781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:58:58,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:58:58,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:58:58,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208235999] [2024-11-21 14:58:58,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:58:58,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:58:58,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:58:58,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:58:58,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:58:58,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:58,708 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:58:58,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 108.0) internal successors, (216), 2 states have internal predecessors, (216), 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-21 14:58:58,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:59:29,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:59:29,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-11-21 14:59:29,560 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:59:29,560 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:59:29,560 INFO L139 ounterexampleChecker]: Examining path program with hash -929952338, occurence #1 [2024-11-21 14:59:29,560 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:59:29,560 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:59:29,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:59:29,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1648306202, now seen corresponding path program 1 times [2024-11-21 14:59:29,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:59:29,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676565497] [2024-11-21 14:59:29,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:59:29,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:59:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:59:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:59:29,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:59:29,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676565497] [2024-11-21 14:59:29,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676565497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:59:29,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:59:29,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:59:29,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402337585] [2024-11-21 14:59:29,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:59:29,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:59:29,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:59:29,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:59:29,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:59:29,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:59:29,855 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:59:29,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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-21 14:59:29,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:59:29,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:59:31,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:59:31,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:59:31,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-11-21 14:59:31,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:59:31,422 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:59:31,423 INFO L139 ounterexampleChecker]: Examining path program with hash 994308726, occurence #1 [2024-11-21 14:59:31,423 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:59:31,423 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:59:31,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:59:31,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1114169860, now seen corresponding path program 2 times [2024-11-21 14:59:31,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:59:31,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936121540] [2024-11-21 14:59:31,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:59:31,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:59:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:59:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:59:32,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:59:32,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936121540] [2024-11-21 14:59:32,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936121540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:59:32,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:59:32,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:59:32,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810260939] [2024-11-21 14:59:32,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:59:32,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:59:32,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:59:32,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:59:32,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:59:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:59:32,150 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:59:32,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.2) internal successors, (526), 4 states have internal predecessors, (526), 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-21 14:59:32,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:59:32,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:59:32,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:59:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:59:44,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:59:44,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:59:44,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-11-21 14:59:44,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:59:44,958 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:59:44,958 INFO L139 ounterexampleChecker]: Examining path program with hash 1733188671, occurence #1 [2024-11-21 14:59:44,958 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:59:44,958 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:59:44,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:59:44,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1692624822, now seen corresponding path program 1 times [2024-11-21 14:59:44,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:59:44,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091190139] [2024-11-21 14:59:44,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:59:44,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:59:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:59:45,042 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:59:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:59:45,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:59:45,192 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:59:45,192 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:59:45,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:59:45,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-11-21 14:59:45,195 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:59:45,195 WARN L246 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:59:45,195 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2024-11-21 14:59:45,279 INFO L143 ThreadInstanceAdder]: Constructed 31 joinOtherThreadTransitions. [2024-11-21 14:59:45,283 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:59:45,332 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:59:45,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:59:45,332 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:59:45,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:59:57,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:59:57,056 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:59:57,057 INFO L139 ounterexampleChecker]: Examining path program with hash 1143782140, occurence #1 [2024-11-21 14:59:57,057 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:59:57,057 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:59:57,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:59:57,057 INFO L85 PathProgramCache]: Analyzing trace with hash -31760086, now seen corresponding path program 1 times [2024-11-21 14:59:57,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:59:57,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45439162] [2024-11-21 14:59:57,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:59:57,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:59:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:59:57,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:59:57,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:59:57,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45439162] [2024-11-21 14:59:57,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45439162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:59:57,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:59:57,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:59:57,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629839710] [2024-11-21 14:59:57,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:59:57,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:59:57,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:59:57,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:59:57,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:59:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:59:57,119 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:59:57,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 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-21 14:59:57,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:00:30,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:00:30,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-11-21 15:00:30,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 15:00:30,037 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 15:00:30,037 INFO L139 ounterexampleChecker]: Examining path program with hash 1348424757, occurence #1 [2024-11-21 15:00:30,037 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 15:00:30,037 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 15:00:30,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 15:00:30,038 INFO L85 PathProgramCache]: Analyzing trace with hash -22013048, now seen corresponding path program 1 times [2024-11-21 15:00:30,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 15:00:30,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774803506] [2024-11-21 15:00:30,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 15:00:30,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 15:00:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 15:00:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 15:00:30,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 15:00:30,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774803506] [2024-11-21 15:00:30,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774803506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 15:00:30,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 15:00:30,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 15:00:30,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218727180] [2024-11-21 15:00:30,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 15:00:30,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 15:00:30,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 15:00:30,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 15:00:30,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 15:00:30,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:00:30,342 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 15:00:30,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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-21 15:00:30,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:00:30,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:00:32,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:00:32,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 15:00:32,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-11-21 15:00:32,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 15:00:32,001 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 15:00:32,002 INFO L139 ounterexampleChecker]: Examining path program with hash 1637157916, occurence #1 [2024-11-21 15:00:32,002 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 15:00:32,002 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 15:00:32,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 15:00:32,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1609448704, now seen corresponding path program 2 times [2024-11-21 15:00:32,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 15:00:32,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841217200] [2024-11-21 15:00:32,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 15:00:32,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 15:00:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 15:00:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 15:00:32,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 15:00:32,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841217200] [2024-11-21 15:00:32,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841217200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 15:00:32,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 15:00:32,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 15:00:32,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383217946] [2024-11-21 15:00:32,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 15:00:32,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 15:00:32,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 15:00:32,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 15:00:32,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 15:00:32,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:00:32,653 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 15:00:32,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 4 states have internal predecessors, (544), 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-21 15:00:32,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:00:32,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 15:00:32,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:00:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:00:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 15:00:45,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 15:00:45,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-11-21 15:00:45,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 15:00:45,676 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 15:00:45,676 INFO L139 ounterexampleChecker]: Examining path program with hash 1250872172, occurence #1 [2024-11-21 15:00:45,676 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 15:00:45,676 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 15:00:45,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 15:00:45,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1563777400, now seen corresponding path program 1 times [2024-11-21 15:00:45,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 15:00:45,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155410909] [2024-11-21 15:00:45,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 15:00:45,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 15:00:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 15:00:45,806 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 15:00:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 15:00:46,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 15:00:46,043 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 15:00:46,043 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 15:00:46,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 15:00:46,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-11-21 15:00:46,048 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 15:00:46,049 WARN L246 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 15:00:46,049 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2024-11-21 15:00:46,131 INFO L143 ThreadInstanceAdder]: Constructed 32 joinOtherThreadTransitions. [2024-11-21 15:00:46,136 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 15:00:46,220 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 15:00:46,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 15:00:46,223 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;@7bfac196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 15:00:46,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 15:00:58,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 15:00:58,799 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 15:00:58,800 INFO L139 ounterexampleChecker]: Examining path program with hash 2055016826, occurence #1 [2024-11-21 15:00:58,800 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 15:00:58,800 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 15:00:58,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 15:00:58,800 INFO L85 PathProgramCache]: Analyzing trace with hash -19650206, now seen corresponding path program 1 times [2024-11-21 15:00:58,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 15:00:58,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043267091] [2024-11-21 15:00:58,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 15:00:58,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 15:00:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 15:00:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 15:00:58,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 15:00:58,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043267091] [2024-11-21 15:00:58,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043267091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 15:00:58,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 15:00:58,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 15:00:58,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424279164] [2024-11-21 15:00:58,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 15:00:58,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 15:00:58,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 15:00:58,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 15:00:58,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 15:00:58,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:00:58,866 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 15:00:58,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 115.0) internal successors, (230), 2 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-21 15:00:58,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:01:33,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:01:33,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-11-21 15:01:33,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 15:01:33,904 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 15:01:33,905 INFO L139 ounterexampleChecker]: Examining path program with hash -1062447260, occurence #1 [2024-11-21 15:01:33,905 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 15:01:33,905 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 15:01:33,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 15:01:33,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1218110150, now seen corresponding path program 1 times [2024-11-21 15:01:33,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 15:01:33,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152256435] [2024-11-21 15:01:33,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 15:01:33,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 15:01:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 15:01:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 15:01:34,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 15:01:34,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152256435] [2024-11-21 15:01:34,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152256435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 15:01:34,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 15:01:34,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 15:01:34,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549736937] [2024-11-21 15:01:34,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 15:01:34,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 15:01:34,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 15:01:34,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 15:01:34,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 15:01:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:01:34,305 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 15:01:34,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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-21 15:01:34,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:01:34,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:01:35,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:01:35,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 15:01:35,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-11-21 15:01:35,855 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 15:01:35,855 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 15:01:35,855 INFO L139 ounterexampleChecker]: Examining path program with hash -2123962103, occurence #1 [2024-11-21 15:01:35,855 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 15:01:35,855 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 15:01:35,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 15:01:35,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2141701236, now seen corresponding path program 2 times [2024-11-21 15:01:35,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 15:01:35,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625640216] [2024-11-21 15:01:35,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 15:01:35,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 15:01:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 15:01:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 15:01:36,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 15:01:36,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625640216] [2024-11-21 15:01:36,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625640216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 15:01:36,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 15:01:36,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 15:01:36,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179326527] [2024-11-21 15:01:36,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 15:01:36,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 15:01:36,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 15:01:36,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 15:01:36,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 15:01:36,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:01:36,644 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 15:01:36,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 4 states have internal predecessors, (562), 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-21 15:01:36,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 15:01:36,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 15:01:36,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15