./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i --full-output --traceabstraction.commutativity.condition.synthesis SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1c4755c5 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 ../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.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 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 --traceabstraction.commutativity.condition.synthesis SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.3.0-dev-1c4755c-m [2024-12-17 10:44:24,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-17 10:44:24,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-12-17 10:44:24,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-17 10:44:24,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-17 10:44:24,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-17 10:44:24,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-17 10:44:24,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-17 10:44:24,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-17 10:44:24,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-17 10:44:24,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-17 10:44:24,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-17 10:44:24,424 INFO L153 SettingsManager]: * Use SBE=true [2024-12-17 10:44:24,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-17 10:44:24,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-17 10:44:24,425 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-17 10:44:24,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-17 10:44:24,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-17 10:44:24,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-17 10:44:24,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-17 10:44:24,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-17 10:44:24,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-17 10:44:24,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-17 10:44:24,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-17 10:44:24,425 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-17 10:44:24,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-17 10:44:24,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-17 10:44:24,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-17 10:44:24,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-17 10:44:24,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-17 10:44:24,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-17 10:44:24,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-17 10:44:24,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-17 10:44:24,426 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-17 10:44:24,426 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2024-12-17 10:44:24,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-17 10:44:24,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-17 10:44:24,427 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-12-17 10:44:24,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-17 10:44:24,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-17 10:44:24,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-12-17 10:44:24,427 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-12-17 10:44:24,427 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-12-17 10:44:24,427 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 -> 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> SUFFICIENT [2024-12-17 10:44:24,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-17 10:44:24,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-17 10:44:24,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-17 10:44:24,733 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-17 10:44:24,733 INFO L274 PluginConnector]: CDTParser initialized [2024-12-17 10:44:24,734 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2024-12-17 10:44:26,056 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/ddefc860b/50f64c2faa62472b8c90ac1d9dc83d94/FLAG70ea7bcd1 [2024-12-17 10:44:26,394 INFO L384 CDTParser]: Found 1 translation units. [2024-12-17 10:44:26,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2024-12-17 10:44:26,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/ddefc860b/50f64c2faa62472b8c90ac1d9dc83d94/FLAG70ea7bcd1 [2024-12-17 10:44:26,434 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/ddefc860b/50f64c2faa62472b8c90ac1d9dc83d94 [2024-12-17 10:44:26,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-17 10:44:26,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-17 10:44:26,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-17 10:44:26,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-17 10:44:26,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-17 10:44:26,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:44:26" (1/1) ... [2024-12-17 10:44:26,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c775eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:44:26, skipping insertion in model container [2024-12-17 10:44:26,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:44:26" (1/1) ... [2024-12-17 10:44:26,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-17 10:44:26,691 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i[30570,30583] [2024-12-17 10:44:26,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-17 10:44:26,711 INFO L200 MainTranslator]: Completed pre-run [2024-12-17 10:44:26,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i[30570,30583] [2024-12-17 10:44:26,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-17 10:44:26,788 INFO L204 MainTranslator]: Completed translation [2024-12-17 10:44:26,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:44:26 WrapperNode [2024-12-17 10:44:26,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-17 10:44:26,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-17 10:44:26,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-17 10:44:26,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-17 10:44:26,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:44:26" (1/1) ... [2024-12-17 10:44:26,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:44:26" (1/1) ... [2024-12-17 10:44:26,826 INFO L138 Inliner]: procedures = 164, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2024-12-17 10:44:26,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-17 10:44:26,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-17 10:44:26,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-17 10:44:26,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-17 10:44:26,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:44:26" (1/1) ... [2024-12-17 10:44:26,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:44:26" (1/1) ... [2024-12-17 10:44:26,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:44:26" (1/1) ... [2024-12-17 10:44:26,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:44:26" (1/1) ... [2024-12-17 10:44:26,841 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:44:26" (1/1) ... [2024-12-17 10:44:26,842 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:44:26" (1/1) ... [2024-12-17 10:44:26,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:44:26" (1/1) ... [2024-12-17 10:44:26,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:44:26" (1/1) ... [2024-12-17 10:44:26,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:44:26" (1/1) ... [2024-12-17 10:44:26,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-17 10:44:26,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-17 10:44:26,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-17 10:44:26,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-17 10:44:26,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:44:26" (1/1) ... [2024-12-17 10:44:26,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-17 10:44:26,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 10:44:26,877 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-12-17 10:44:26,879 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-12-17 10:44:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-12-17 10:44:26,895 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-12-17 10:44:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-12-17 10:44:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-17 10:44:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-17 10:44:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-12-17 10:44:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-17 10:44:26,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-17 10:44:26,896 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-17 10:44:27,000 INFO L234 CfgBuilder]: Building ICFG [2024-12-17 10:44:27,002 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-17 10:44:27,155 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-17 10:44:27,155 INFO L283 CfgBuilder]: Performing block encoding [2024-12-17 10:44:27,266 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-17 10:44:27,267 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-17 10:44:27,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:44:27 BoogieIcfgContainer [2024-12-17 10:44:27,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-17 10:44:27,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-17 10:44:27,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-17 10:44:27,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-17 10:44:27,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:44:26" (1/3) ... [2024-12-17 10:44:27,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2810bbad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:44:27, skipping insertion in model container [2024-12-17 10:44:27,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:44:26" (2/3) ... [2024-12-17 10:44:27,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2810bbad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:44:27, skipping insertion in model container [2024-12-17 10:44:27,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:44:27" (3/3) ... [2024-12-17 10:44:27,280 INFO L128 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2024-12-17 10:44:27,294 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-17 10:44:27,297 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 48_ticket_lock_low_contention_vs-pthread.i that has 2 procedures, 24 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2024-12-17 10:44:27,297 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-17 10:44:27,341 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-17 10:44:27,381 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:27,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-12-17 10:44:27,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 10:44:27,386 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-12-17 10:44:27,389 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-12-17 10:44:27,451 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:44:27,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-12-17 10:44:27,474 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;@23f9552d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:27,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-17 10:44:27,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:27,643 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:27,645 INFO L139 ounterexampleChecker]: Examining path program with hash -1527263087, occurence #1 [2024-12-17 10:44:27,645 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:27,645 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:27,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash -520023768, now seen corresponding path program 1 times [2024-12-17 10:44:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:27,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208573598] [2024-12-17 10:44:27,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:27,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:27,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:27,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208573598] [2024-12-17 10:44:27,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208573598] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:27,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:27,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:27,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36597143] [2024-12-17 10:44:27,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:27,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:27,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:27,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:27,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:27,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:27,953 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:27,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-12-17 10:44:27,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:28,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:28,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-17 10:44:28,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:28,204 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:28,204 INFO L139 ounterexampleChecker]: Examining path program with hash 404045102, occurence #1 [2024-12-17 10:44:28,204 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:28,204 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:28,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:28,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1321307228, now seen corresponding path program 1 times [2024-12-17 10:44:28,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:28,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240243724] [2024-12-17 10:44:28,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:28,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:28,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240243724] [2024-12-17 10:44:28,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240243724] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:28,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:28,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:28,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801928253] [2024-12-17 10:44:28,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:28,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:28,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:28,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:28,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:28,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:28,372 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:28,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-12-17 10:44:28,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:28,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:28,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:28,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:28,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-17 10:44:28,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-17 10:44:28,538 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-12-17 10:44:28,542 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-12-17 10:44:28,545 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:28,546 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:44:28,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 10:44:28,547 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;@23f9552d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:28,547 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 10:44:28,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:44:28,549 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:28,549 INFO L139 ounterexampleChecker]: Examining path program with hash 181509906, occurence #1 [2024-12-17 10:44:28,549 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:28,549 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:28,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:28,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2071616802, now seen corresponding path program 1 times [2024-12-17 10:44:28,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:28,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266380112] [2024-12-17 10:44:28,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:28,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:28,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:28,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266380112] [2024-12-17 10:44:28,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266380112] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:28,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:28,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 10:44:28,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077291448] [2024-12-17 10:44:28,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:28,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 10:44:28,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:28,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 10:44:28,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 10:44:28,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:28,581 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:28,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-12-17 10:44:28,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:28,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-17 10:44:28,596 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:44:28,596 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:28,596 INFO L139 ounterexampleChecker]: Examining path program with hash -628666848, occurence #1 [2024-12-17 10:44:28,596 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:28,596 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:28,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:28,596 INFO L85 PathProgramCache]: Analyzing trace with hash 909838558, now seen corresponding path program 1 times [2024-12-17 10:44:28,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:28,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533923769] [2024-12-17 10:44:28,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:28,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:28,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:28,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533923769] [2024-12-17 10:44:28,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533923769] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:28,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:28,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:28,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920165319] [2024-12-17 10:44:28,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:28,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:28,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:28,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:28,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:28,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:28,688 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:28,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-12-17 10:44:28,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:28,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:28,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:28,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-17 10:44:28,745 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:44:28,745 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:28,746 INFO L139 ounterexampleChecker]: Examining path program with hash -2071130419, occurence #1 [2024-12-17 10:44:28,746 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:28,746 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:28,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:28,746 INFO L85 PathProgramCache]: Analyzing trace with hash 548620830, now seen corresponding path program 1 times [2024-12-17 10:44:28,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:28,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264781553] [2024-12-17 10:44:28,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:28,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 10:44:28,764 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 10:44:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 10:44:28,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 10:44:28,791 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 10:44:28,791 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 10:44:28,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 10:44:28,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-17 10:44:28,793 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-12-17 10:44:28,793 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2024-12-17 10:44:28,794 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 10:44:28,794 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-12-17 10:44:28,811 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-17 10:44:28,813 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:28,819 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:44:28,819 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 10:44:28,820 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;@23f9552d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:28,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 10:44:28,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:44:28,824 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:28,824 INFO L139 ounterexampleChecker]: Examining path program with hash 348796426, occurence #1 [2024-12-17 10:44:28,824 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:28,824 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:28,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:28,824 INFO L85 PathProgramCache]: Analyzing trace with hash -557216318, now seen corresponding path program 1 times [2024-12-17 10:44:28,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:28,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128613524] [2024-12-17 10:44:28,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:28,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:28,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:28,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128613524] [2024-12-17 10:44:28,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128613524] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:28,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:28,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 10:44:28,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256776419] [2024-12-17 10:44:28,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:28,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 10:44:28,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:28,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 10:44:28,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 10:44:28,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:28,868 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:28,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-12-17 10:44:28,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:28,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-17 10:44:28,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:44:28,886 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:28,886 INFO L139 ounterexampleChecker]: Examining path program with hash -1155215657, occurence #1 [2024-12-17 10:44:28,886 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:28,886 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:28,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:28,887 INFO L85 PathProgramCache]: Analyzing trace with hash 611613406, now seen corresponding path program 1 times [2024-12-17 10:44:28,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:28,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731981286] [2024-12-17 10:44:28,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:28,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:28,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:28,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731981286] [2024-12-17 10:44:28,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731981286] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:28,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:28,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:28,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517568353] [2024-12-17 10:44:28,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:28,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:28,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:28,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:28,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:28,949 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:28,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-12-17 10:44:28,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:28,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:29,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:29,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:29,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-17 10:44:29,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:44:29,290 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:29,290 INFO L139 ounterexampleChecker]: Examining path program with hash -4002021, occurence #1 [2024-12-17 10:44:29,290 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:29,290 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:29,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:29,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2059262637, now seen corresponding path program 1 times [2024-12-17 10:44:29,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:29,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055052437] [2024-12-17 10:44:29,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:29,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 10:44:29,304 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 10:44:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 10:44:29,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 10:44:29,317 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 10:44:29,318 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 10:44:29,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 10:44:29,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-17 10:44:29,322 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-12-17 10:44:29,322 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/3) [2024-12-17 10:44:29,322 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 10:44:29,322 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-12-17 10:44:29,335 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-17 10:44:29,337 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:29,343 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:44:29,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-12-17 10:44:29,343 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;@23f9552d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:29,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-17 10:44:29,650 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:29,652 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:29,653 INFO L139 ounterexampleChecker]: Examining path program with hash -167051335, occurence #1 [2024-12-17 10:44:29,653 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:29,653 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:29,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:29,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1425617924, now seen corresponding path program 1 times [2024-12-17 10:44:29,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:29,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572932829] [2024-12-17 10:44:29,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:29,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:29,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:29,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572932829] [2024-12-17 10:44:29,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572932829] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:29,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:29,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:29,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712130404] [2024-12-17 10:44:29,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:29,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:29,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:29,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:29,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:29,760 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:29,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-12-17 10:44:29,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:30,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:30,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-17 10:44:30,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:30,127 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:30,127 INFO L139 ounterexampleChecker]: Examining path program with hash 390482852, occurence #1 [2024-12-17 10:44:30,127 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:30,127 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:30,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:30,128 INFO L85 PathProgramCache]: Analyzing trace with hash -12219256, now seen corresponding path program 1 times [2024-12-17 10:44:30,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:30,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224302765] [2024-12-17 10:44:30,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:30,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:30,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:30,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224302765] [2024-12-17 10:44:30,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224302765] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:30,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:30,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:30,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393896394] [2024-12-17 10:44:30,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:30,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:30,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:30,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:30,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:30,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:30,231 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:30,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-12-17 10:44:30,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:30,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:31,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:31,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:31,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-17 10:44:31,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-17 10:44:31,019 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-12-17 10:44:31,019 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE (1/4) [2024-12-17 10:44:31,020 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:31,021 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:44:31,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 10:44:31,022 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;@23f9552d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:31,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 10:44:31,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:44:31,023 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:31,023 INFO L139 ounterexampleChecker]: Examining path program with hash 1949581737, occurence #1 [2024-12-17 10:44:31,023 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:31,024 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:31,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:31,024 INFO L85 PathProgramCache]: Analyzing trace with hash -5584941, now seen corresponding path program 1 times [2024-12-17 10:44:31,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:31,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119717116] [2024-12-17 10:44:31,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:31,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:31,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:31,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119717116] [2024-12-17 10:44:31,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119717116] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:31,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:31,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 10:44:31,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341627372] [2024-12-17 10:44:31,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:31,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 10:44:31,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:31,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 10:44:31,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 10:44:31,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:31,035 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:31,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-12-17 10:44:31,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:31,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:31,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-17 10:44:31,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:44:31,047 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:31,047 INFO L139 ounterexampleChecker]: Examining path program with hash -881354608, occurence #1 [2024-12-17 10:44:31,047 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:31,047 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:31,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:31,048 INFO L85 PathProgramCache]: Analyzing trace with hash 532317022, now seen corresponding path program 1 times [2024-12-17 10:44:31,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:31,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348845394] [2024-12-17 10:44:31,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:31,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:31,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-12-17 10:44:31,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:31,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348845394] [2024-12-17 10:44:31,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348845394] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:31,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:31,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:31,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872271313] [2024-12-17 10:44:31,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:31,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:31,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:31,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:31,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:31,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:31,101 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:31,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-12-17 10:44:31,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:31,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:31,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:31,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:31,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-17 10:44:31,179 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:44:31,179 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:31,179 INFO L139 ounterexampleChecker]: Examining path program with hash -1363630746, occurence #1 [2024-12-17 10:44:31,179 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:31,179 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:31,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:31,180 INFO L85 PathProgramCache]: Analyzing trace with hash -520976793, now seen corresponding path program 1 times [2024-12-17 10:44:31,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:31,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391774684] [2024-12-17 10:44:31,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:31,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 10:44:31,196 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 10:44:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 10:44:31,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 10:44:31,211 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 10:44:31,211 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 10:44:31,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 10:44:31,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-17 10:44:31,212 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-12-17 10:44:31,213 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/4) [2024-12-17 10:44:31,213 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 10:44:31,213 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-12-17 10:44:31,225 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-17 10:44:31,227 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:31,235 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:44:31,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2024-12-17 10:44:31,236 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;@23f9552d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:31,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-17 10:44:31,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:31,582 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:31,582 INFO L139 ounterexampleChecker]: Examining path program with hash -1701872822, occurence #1 [2024-12-17 10:44:31,582 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:31,582 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:31,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:31,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1385348850, now seen corresponding path program 1 times [2024-12-17 10:44:31,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:31,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076086444] [2024-12-17 10:44:31,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:31,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:31,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-12-17 10:44:31,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:31,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076086444] [2024-12-17 10:44:31,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076086444] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:31,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:31,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:31,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927991921] [2024-12-17 10:44:31,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:31,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:31,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:31,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:31,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:31,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:31,655 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:31,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-12-17 10:44:31,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:32,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-17 10:44:32,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:32,139 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:32,139 INFO L139 ounterexampleChecker]: Examining path program with hash 885861596, occurence #1 [2024-12-17 10:44:32,139 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:32,139 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:32,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:32,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1761045494, now seen corresponding path program 1 times [2024-12-17 10:44:32,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:32,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19958348] [2024-12-17 10:44:32,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:32,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:32,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-12-17 10:44:32,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:32,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19958348] [2024-12-17 10:44:32,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19958348] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:32,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:32,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:32,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805646990] [2024-12-17 10:44:32,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:32,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:32,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:32,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:32,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:32,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:32,224 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:32,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-12-17 10:44:32,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:32,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:33,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:33,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-17 10:44:33,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-17 10:44:33,897 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-12-17 10:44:33,897 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread3of4ForFork0 was SAFE (1/5) [2024-12-17 10:44:33,899 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:33,900 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:44:33,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread4of4ForFork0 ======== [2024-12-17 10:44:33,900 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;@23f9552d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:33,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-17 10:44:33,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:33,906 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:33,906 INFO L139 ounterexampleChecker]: Examining path program with hash 919140686, occurence #1 [2024-12-17 10:44:33,907 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:33,907 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:33,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:33,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1271980511, now seen corresponding path program 1 times [2024-12-17 10:44:33,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:33,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808301377] [2024-12-17 10:44:33,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:33,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:34,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-12-17 10:44:34,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:34,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808301377] [2024-12-17 10:44:34,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808301377] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:34,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:34,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:34,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905483788] [2024-12-17 10:44:34,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:34,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:34,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:34,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:34,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:34,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:34,010 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:34,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-12-17 10:44:34,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:34,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:34,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-17 10:44:34,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:34,081 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:34,081 INFO L139 ounterexampleChecker]: Examining path program with hash -1064831360, occurence #1 [2024-12-17 10:44:34,081 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:34,081 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:34,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:34,082 INFO L85 PathProgramCache]: Analyzing trace with hash 104240933, now seen corresponding path program 1 times [2024-12-17 10:44:34,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:34,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797045880] [2024-12-17 10:44:34,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:34,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:34,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:34,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797045880] [2024-12-17 10:44:34,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797045880] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:34,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:34,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:34,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907870196] [2024-12-17 10:44:34,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:34,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:34,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:34,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:34,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:34,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:34,172 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:34,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-12-17 10:44:34,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:34,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:35,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:35,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:35,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-17 10:44:35,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-17 10:44:35,294 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-12-17 10:44:35,295 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread4of4ForFork0 was SAFE (2/5) [2024-12-17 10:44:35,299 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:35,302 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:44:35,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of4ForFork0 ======== [2024-12-17 10:44:35,303 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;@23f9552d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:35,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-17 10:44:35,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:35,305 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:35,305 INFO L139 ounterexampleChecker]: Examining path program with hash -1203564643, occurence #1 [2024-12-17 10:44:35,305 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:35,305 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:35,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:35,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1213917803, now seen corresponding path program 1 times [2024-12-17 10:44:35,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:35,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891808896] [2024-12-17 10:44:35,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:35,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:35,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:35,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:35,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891808896] [2024-12-17 10:44:35,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891808896] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:35,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:35,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:35,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292651018] [2024-12-17 10:44:35,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:35,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:35,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:35,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:35,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:35,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:35,348 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:35,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-12-17 10:44:35,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:37,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:37,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-17 10:44:37,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:37,164 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:37,164 INFO L139 ounterexampleChecker]: Examining path program with hash -1464945130, occurence #1 [2024-12-17 10:44:37,164 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:37,164 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:37,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:37,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2041683758, now seen corresponding path program 1 times [2024-12-17 10:44:37,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:37,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901562387] [2024-12-17 10:44:37,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:37,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:37,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:37,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901562387] [2024-12-17 10:44:37,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901562387] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:37,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:37,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:37,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617359671] [2024-12-17 10:44:37,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:37,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:37,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:37,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:37,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:37,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:37,222 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:37,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-12-17 10:44:37,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:37,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:37,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:37,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:37,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-17 10:44:37,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-17 10:44:37,924 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-12-17 10:44:37,924 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread1of4ForFork0 was SAFE (3/5) [2024-12-17 10:44:37,926 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:37,926 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:44:37,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread2of4ForFork0 ======== [2024-12-17 10:44:37,927 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;@23f9552d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:37,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-17 10:44:37,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:37,930 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:37,930 INFO L139 ounterexampleChecker]: Examining path program with hash -134929233, occurence #1 [2024-12-17 10:44:37,930 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:37,930 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:37,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:37,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1974464978, now seen corresponding path program 1 times [2024-12-17 10:44:37,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:37,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630782255] [2024-12-17 10:44:37,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:37,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:37,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:37,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630782255] [2024-12-17 10:44:37,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630782255] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:37,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:37,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:37,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152907448] [2024-12-17 10:44:37,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:37,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:37,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:37,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:37,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:37,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:37,969 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:37,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-12-17 10:44:37,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:38,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:38,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-17 10:44:38,005 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:38,005 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:38,005 INFO L139 ounterexampleChecker]: Examining path program with hash -1886506824, occurence #1 [2024-12-17 10:44:38,005 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:38,005 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:38,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:38,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1960225872, now seen corresponding path program 1 times [2024-12-17 10:44:38,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:38,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032212234] [2024-12-17 10:44:38,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:38,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:38,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:38,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032212234] [2024-12-17 10:44:38,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032212234] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:38,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:38,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:38,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606685065] [2024-12-17 10:44:38,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:38,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:38,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:38,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:38,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:38,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:38,046 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:38,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-12-17 10:44:38,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:38,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:38,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:38,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:38,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-17 10:44:38,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-17 10:44:38,709 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-12-17 10:44:38,709 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread2of4ForFork0 was SAFE (4/5) [2024-12-17 10:44:38,710 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:38,711 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:44:38,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 10:44:38,711 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;@23f9552d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:38,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 10:44:38,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:44:38,712 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:38,712 INFO L139 ounterexampleChecker]: Examining path program with hash -444411166, occurence #1 [2024-12-17 10:44:38,712 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:38,712 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:38,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:38,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1637207029, now seen corresponding path program 1 times [2024-12-17 10:44:38,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:38,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250668587] [2024-12-17 10:44:38,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:38,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:38,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:38,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250668587] [2024-12-17 10:44:38,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250668587] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:38,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:38,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 10:44:38,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983359114] [2024-12-17 10:44:38,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:38,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 10:44:38,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:38,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 10:44:38,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 10:44:38,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:38,728 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:38,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-12-17 10:44:38,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:38,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:38,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-17 10:44:38,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:44:38,740 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:38,740 INFO L139 ounterexampleChecker]: Examining path program with hash 2021452731, occurence #1 [2024-12-17 10:44:38,740 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:38,740 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:38,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1491640158, now seen corresponding path program 1 times [2024-12-17 10:44:38,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:38,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333042063] [2024-12-17 10:44:38,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:38,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:38,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:38,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333042063] [2024-12-17 10:44:38,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333042063] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:38,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:38,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:38,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819236505] [2024-12-17 10:44:38,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:38,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:38,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:38,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:38,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:38,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:38,774 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:38,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-12-17 10:44:38,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:38,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:38,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:38,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:38,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-17 10:44:38,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:44:38,849 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:38,849 INFO L139 ounterexampleChecker]: Examining path program with hash -1509460910, occurence #1 [2024-12-17 10:44:38,849 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:38,849 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:38,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:38,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1219411988, now seen corresponding path program 1 times [2024-12-17 10:44:38,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:38,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116132094] [2024-12-17 10:44:38,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:38,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 10:44:38,863 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 10:44:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 10:44:38,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 10:44:38,880 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 10:44:38,880 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 10:44:38,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 10:44:38,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-17 10:44:38,881 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-12-17 10:44:38,881 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (5/5) [2024-12-17 10:44:38,881 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 10:44:38,881 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-12-17 10:44:38,898 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-17 10:44:38,900 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:38,910 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:44:38,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread2of5ForFork0 ======== [2024-12-17 10:44:38,912 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;@23f9552d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:38,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-17 10:44:39,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:39,149 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:39,149 INFO L139 ounterexampleChecker]: Examining path program with hash -1745522894, occurence #1 [2024-12-17 10:44:39,149 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:39,150 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:39,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:39,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1978615877, now seen corresponding path program 1 times [2024-12-17 10:44:39,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:39,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990786150] [2024-12-17 10:44:39,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:39,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:39,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:39,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990786150] [2024-12-17 10:44:39,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990786150] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:39,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:39,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:39,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423108929] [2024-12-17 10:44:39,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:39,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:39,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:39,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:39,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:39,197 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:39,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-12-17 10:44:39,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:39,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-17 10:44:39,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:39,693 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:39,693 INFO L139 ounterexampleChecker]: Examining path program with hash 1730500903, occurence #1 [2024-12-17 10:44:39,693 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:39,693 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:39,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:39,694 INFO L85 PathProgramCache]: Analyzing trace with hash 516490023, now seen corresponding path program 1 times [2024-12-17 10:44:39,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:39,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727519206] [2024-12-17 10:44:39,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:39,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:39,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:39,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727519206] [2024-12-17 10:44:39,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727519206] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:39,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:39,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:39,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025223439] [2024-12-17 10:44:39,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:39,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:39,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:39,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:39,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:39,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:39,743 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:39,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-12-17 10:44:39,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:39,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:43,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:43,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:43,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-17 10:44:43,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-17 10:44:43,247 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-12-17 10:44:43,247 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread2of5ForFork0 was SAFE (1/6) [2024-12-17 10:44:43,248 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:43,249 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:44:43,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of5ForFork0 ======== [2024-12-17 10:44:43,249 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;@23f9552d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:43,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-17 10:44:43,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:43,252 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:43,252 INFO L139 ounterexampleChecker]: Examining path program with hash -978762368, occurence #1 [2024-12-17 10:44:43,252 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:43,252 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:43,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash -668328854, now seen corresponding path program 1 times [2024-12-17 10:44:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:43,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470602271] [2024-12-17 10:44:43,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:43,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:43,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:43,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470602271] [2024-12-17 10:44:43,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470602271] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:43,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:43,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:43,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026648610] [2024-12-17 10:44:43,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:43,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:43,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:43,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:43,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:43,287 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:43,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-12-17 10:44:43,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:55,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:55,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-17 10:44:55,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:55,926 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:55,927 INFO L139 ounterexampleChecker]: Examining path program with hash -511664389, occurence #1 [2024-12-17 10:44:55,927 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:55,927 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:55,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:55,927 INFO L85 PathProgramCache]: Analyzing trace with hash 544617858, now seen corresponding path program 1 times [2024-12-17 10:44:55,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:55,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790788131] [2024-12-17 10:44:55,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:55,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:55,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:55,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790788131] [2024-12-17 10:44:55,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790788131] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:55,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:55,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:55,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525608420] [2024-12-17 10:44:55,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:55,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:55,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:55,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:55,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:55,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:55,964 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:55,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-12-17 10:44:55,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:55,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:57,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:57,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-17 10:44:57,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-17 10:44:57,432 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-12-17 10:44:57,432 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread1of5ForFork0 was SAFE (2/6) [2024-12-17 10:44:57,434 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:57,434 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:44:57,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 10:44:57,435 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23f9552d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:57,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-17 10:44:57,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:44:57,435 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:57,436 INFO L139 ounterexampleChecker]: Examining path program with hash -1905749143, occurence #1 [2024-12-17 10:44:57,436 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:57,436 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:57,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:57,436 INFO L85 PathProgramCache]: Analyzing trace with hash -8170562, now seen corresponding path program 1 times [2024-12-17 10:44:57,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:57,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067617894] [2024-12-17 10:44:57,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:57,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:57,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:57,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067617894] [2024-12-17 10:44:57,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067617894] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:57,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:57,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 10:44:57,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301056390] [2024-12-17 10:44:57,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:57,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 10:44:57,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:57,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 10:44:57,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 10:44:57,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:57,444 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:57,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-12-17 10:44:57,445 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:57,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:57,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-17 10:44:57,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:44:57,453 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:57,453 INFO L139 ounterexampleChecker]: Examining path program with hash 2003508095, occurence #1 [2024-12-17 10:44:57,453 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:57,453 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:57,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:57,454 INFO L85 PathProgramCache]: Analyzing trace with hash 452163806, now seen corresponding path program 1 times [2024-12-17 10:44:57,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:57,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820501375] [2024-12-17 10:44:57,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:57,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:57,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:57,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820501375] [2024-12-17 10:44:57,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820501375] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:57,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:57,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:57,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662164551] [2024-12-17 10:44:57,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:57,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:57,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:57,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:57,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:57,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:57,476 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:57,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-12-17 10:44:57,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:57,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:57,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:57,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:57,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-17 10:44:57,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:44:57,564 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:57,564 INFO L139 ounterexampleChecker]: Examining path program with hash -143987219, occurence #1 [2024-12-17 10:44:57,565 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:57,565 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:57,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash 435807772, now seen corresponding path program 1 times [2024-12-17 10:44:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:57,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943693698] [2024-12-17 10:44:57,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 10:44:57,579 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 10:44:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 10:44:57,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 10:44:57,601 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 10:44:57,602 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-17 10:44:57,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-17 10:44:57,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-17 10:44:57,604 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-12-17 10:44:57,604 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (3/6) [2024-12-17 10:44:57,605 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 10:44:57,605 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-12-17 10:44:57,624 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-17 10:44:57,625 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:57,635 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:44:57,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread6of6ForFork0 ======== [2024-12-17 10:44:57,637 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;@23f9552d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:44:57,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-17 10:44:58,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:58,132 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:58,132 INFO L139 ounterexampleChecker]: Examining path program with hash 1180173757, occurence #1 [2024-12-17 10:44:58,132 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:58,132 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:58,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:58,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1259234493, now seen corresponding path program 1 times [2024-12-17 10:44:58,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:58,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88613916] [2024-12-17 10:44:58,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:58,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:44:58,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:58,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88613916] [2024-12-17 10:44:58,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88613916] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:58,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:58,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:58,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009462958] [2024-12-17 10:44:58,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:58,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:58,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:58,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:58,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:58,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:58,196 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:58,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-12-17 10:44:58,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:58,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-17 10:44:58,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:44:58,905 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:44:58,905 INFO L139 ounterexampleChecker]: Examining path program with hash -1372672717, occurence #1 [2024-12-17 10:44:58,905 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:44:58,905 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:44:58,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:44:58,906 INFO L85 PathProgramCache]: Analyzing trace with hash 265632615, now seen corresponding path program 1 times [2024-12-17 10:44:58,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:44:58,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933042428] [2024-12-17 10:44:58,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:44:58,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:44:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:44:58,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-12-17 10:44:58,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:44:58,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933042428] [2024-12-17 10:44:58,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933042428] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:44:58,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:44:58,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:44:58,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663375017] [2024-12-17 10:44:58,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:44:58,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:44:58,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:44:58,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:44:58,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:44:58,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:44:58,996 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:44:58,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-12-17 10:44:58,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:44:58,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:45:16,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:45:16,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:45:16,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-12-17 10:45:16,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-17 10:45:16,083 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-12-17 10:45:16,083 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread6of6ForFork0 was SAFE (1/7) [2024-12-17 10:45:16,084 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:45:16,085 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:45:16,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of6ForFork0 ======== [2024-12-17 10:45:16,085 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;@23f9552d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:45:16,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-17 10:45:16,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-17 10:45:16,087 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:45:16,087 INFO L139 ounterexampleChecker]: Examining path program with hash 461390446, occurence #1 [2024-12-17 10:45:16,087 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:45:16,087 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:45:16,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:45:16,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1460933542, now seen corresponding path program 1 times [2024-12-17 10:45:16,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:45:16,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578645771] [2024-12-17 10:45:16,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:45:16,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:45:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:45:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:45:16,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:45:16,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578645771] [2024-12-17 10:45:16,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578645771] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:45:16,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:45:16,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:45:16,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117107308] [2024-12-17 10:45:16,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:45:16,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:45:16,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:45:16,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:45:16,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:45:16,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:45:16,113 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:45:16,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-12-17 10:45:16,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.