./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis SUFFICIENT --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ebd41074 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/46_monabsex2_vs.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 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-23 15:42:20,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 15:42:20,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-23 15:42:20,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 15:42:20,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 15:42:20,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 15:42:20,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 15:42:20,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 15:42:20,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 15:42:20,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 15:42:20,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 15:42:20,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 15:42:20,298 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 15:42:20,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 15:42:20,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 15:42:20,299 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 15:42:20,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-23 15:42:20,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 15:42:20,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 15:42:20,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 15:42:20,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 15:42:20,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 15:42:20,299 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 15:42:20,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 15:42:20,300 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 15:42:20,300 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 15:42:20,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 15:42:20,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 15:42:20,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 15:42:20,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 15:42:20,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 15:42:20,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 15:42:20,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 15:42:20,300 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 15:42:20,300 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 15:42:20,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 15:42:20,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-23 15:42:20,301 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 15:42:20,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-23 15:42:20,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 15:42:20,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 15:42:20,301 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 15:42:20,301 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 15:42:20,301 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 -> 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> SUFFICIENT [2025-01-23 15:42:20,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 15:42:20,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 15:42:20,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 15:42:20,543 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 15:42:20,543 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 15:42:20,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i [2025-01-23 15:42:21,662 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/d464a95b8/290dbfa53a2b46a79ab114dad50b7072/FLAG7084a54d9 [2025-01-23 15:42:21,917 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 15:42:21,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/46_monabsex2_vs.i [2025-01-23 15:42:21,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/d464a95b8/290dbfa53a2b46a79ab114dad50b7072/FLAG7084a54d9 [2025-01-23 15:42:22,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/d464a95b8/290dbfa53a2b46a79ab114dad50b7072 [2025-01-23 15:42:22,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 15:42:22,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 15:42:22,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 15:42:22,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 15:42:22,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 15:42:22,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 03:42:22" (1/1) ... [2025-01-23 15:42:22,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eb1761d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:42:22, skipping insertion in model container [2025-01-23 15:42:22,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 03:42:22" (1/1) ... [2025-01-23 15:42:22,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 15:42:22,438 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/46_monabsex2_vs.i[30494,30507] [2025-01-23 15:42:22,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 15:42:22,450 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 15:42:22,518 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/46_monabsex2_vs.i[30494,30507] [2025-01-23 15:42:22,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 15:42:22,547 INFO L204 MainTranslator]: Completed translation [2025-01-23 15:42:22,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:42:22 WrapperNode [2025-01-23 15:42:22,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 15:42:22,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 15:42:22,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 15:42:22,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 15:42:22,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:42:22" (1/1) ... [2025-01-23 15:42:22,568 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:42:22" (1/1) ... [2025-01-23 15:42:22,579 INFO L138 Inliner]: procedures = 168, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 16 [2025-01-23 15:42:22,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 15:42:22,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 15:42:22,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 15:42:22,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 15:42:22,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:42:22" (1/1) ... [2025-01-23 15:42:22,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:42:22" (1/1) ... [2025-01-23 15:42:22,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:42:22" (1/1) ... [2025-01-23 15:42:22,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:42:22" (1/1) ... [2025-01-23 15:42:22,591 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:42:22" (1/1) ... [2025-01-23 15:42:22,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:42:22" (1/1) ... [2025-01-23 15:42:22,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:42:22" (1/1) ... [2025-01-23 15:42:22,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:42:22" (1/1) ... [2025-01-23 15:42:22,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:42:22" (1/1) ... [2025-01-23 15:42:22,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 15:42:22,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 15:42:22,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 15:42:22,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 15:42:22,599 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:42:22" (1/1) ... [2025-01-23 15:42:22,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 15:42:22,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 15:42:22,620 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) [2025-01-23 15:42:22,622 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 [2025-01-23 15:42:22,638 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-23 15:42:22,638 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-23 15:42:22,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-23 15:42:22,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 15:42:22,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-23 15:42:22,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-23 15:42:22,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 15:42:22,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 15:42:22,639 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-23 15:42:22,706 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 15:42:22,707 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 15:42:22,757 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 15:42:22,757 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 15:42:22,793 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 15:42:22,793 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-23 15:42:22,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 03:42:22 BoogieIcfgContainer [2025-01-23 15:42:22,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 15:42:22,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 15:42:22,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 15:42:22,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 15:42:22,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 03:42:22" (1/3) ... [2025-01-23 15:42:22,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497010fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 03:42:22, skipping insertion in model container [2025-01-23 15:42:22,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:42:22" (2/3) ... [2025-01-23 15:42:22,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497010fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 03:42:22, skipping insertion in model container [2025-01-23 15:42:22,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 03:42:22" (3/3) ... [2025-01-23 15:42:22,800 INFO L128 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs.i [2025-01-23 15:42:22,810 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 15:42:22,811 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 46_monabsex2_vs.i that has 2 procedures, 11 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-23 15:42:22,811 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 15:42:22,831 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 15:42:22,854 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:22,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 15:42:22,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 15:42:22,856 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) [2025-01-23 15:42:22,857 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 [2025-01-23 15:42:22,897 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:42:22,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2025-01-23 15:42:22,918 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:22,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:42:22,969 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:22,969 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:22,971 INFO L139 ounterexampleChecker]: Examining path program with hash -1098527425, occurence #1 [2025-01-23 15:42:22,971 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:22,971 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:22,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:22,974 INFO L85 PathProgramCache]: Analyzing trace with hash 95412403, now seen corresponding path program 1 times [2025-01-23 15:42:22,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:22,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78627577] [2025-01-23 15:42:22,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:22,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:23,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-23 15:42:23,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-23 15:42:23,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:23,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:23,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:23,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78627577] [2025-01-23 15:42:23,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78627577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:23,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:23,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-23 15:42:23,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783371696] [2025-01-23 15:42:23,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:23,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:23,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:23,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:23,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:23,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:23,182 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:23,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2025-01-23 15:42:23,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:23,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:23,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 15:42:23,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-23 15:42:23,232 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-23 15:42:23,234 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2025-01-23 15:42:23,235 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:23,236 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:42:23,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 15:42:23,237 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:23,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:42:23,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:42:23,239 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:23,239 INFO L139 ounterexampleChecker]: Examining path program with hash 930766286, occurence #1 [2025-01-23 15:42:23,239 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:23,239 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:23,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:23,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1497008287, now seen corresponding path program 1 times [2025-01-23 15:42:23,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:23,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9287267] [2025-01-23 15:42:23,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:23,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:23,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-23 15:42:23,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-23 15:42:23,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:23,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:23,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:23,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9287267] [2025-01-23 15:42:23,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9287267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:23,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:23,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:42:23,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569580655] [2025-01-23 15:42:23,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:23,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:23,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:23,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:23,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:23,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:23,318 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:23,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) 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) [2025-01-23 15:42:23,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:23,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:23,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-23 15:42:23,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:42:23,330 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:23,330 INFO L139 ounterexampleChecker]: Examining path program with hash -1150423962, occurence #1 [2025-01-23 15:42:23,330 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:23,330 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:23,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1529563289, now seen corresponding path program 1 times [2025-01-23 15:42:23,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:23,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097422284] [2025-01-23 15:42:23,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:23,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:23,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-23 15:42:23,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-23 15:42:23,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:23,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:42:23,339 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 15:42:23,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-23 15:42:23,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-23 15:42:23,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:23,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:42:23,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 15:42:23,352 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 15:42:23,352 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-01-23 15:42:23,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-23 15:42:23,353 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 15:42:23,353 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2025-01-23 15:42:23,353 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 15:42:23,353 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-23 15:42:23,360 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 15:42:23,365 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:23,371 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:42:23,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 15:42:23,372 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:23,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:42:23,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:42:23,426 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:23,426 INFO L139 ounterexampleChecker]: Examining path program with hash 73701306, occurence #1 [2025-01-23 15:42:23,426 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:23,426 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:23,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:23,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1617942, now seen corresponding path program 1 times [2025-01-23 15:42:23,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:23,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462444871] [2025-01-23 15:42:23,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:23,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:23,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-23 15:42:23,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-23 15:42:23,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:23,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:23,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:23,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462444871] [2025-01-23 15:42:23,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462444871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:23,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:23,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:42:23,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245406074] [2025-01-23 15:42:23,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:23,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:23,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:23,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:23,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:23,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:23,512 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:23,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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) [2025-01-23 15:42:23,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:23,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:23,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-23 15:42:23,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:42:23,587 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:23,587 INFO L139 ounterexampleChecker]: Examining path program with hash 1958531516, occurence #1 [2025-01-23 15:42:23,587 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:23,587 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:23,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:23,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2026048322, now seen corresponding path program 1 times [2025-01-23 15:42:23,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:23,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945552442] [2025-01-23 15:42:23,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:23,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:23,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-23 15:42:23,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-23 15:42:23,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:23,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:23,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:23,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945552442] [2025-01-23 15:42:23,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945552442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:23,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:23,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:42:23,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123694301] [2025-01-23 15:42:23,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:23,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:23,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:23,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:23,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:23,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:23,637 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:23,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2025-01-23 15:42:23,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:23,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:23,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:23,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:23,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-23 15:42:23,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:42:23,680 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:23,680 INFO L139 ounterexampleChecker]: Examining path program with hash 1568850602, occurence #1 [2025-01-23 15:42:23,680 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:23,680 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:23,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:23,680 INFO L85 PathProgramCache]: Analyzing trace with hash 866953478, now seen corresponding path program 1 times [2025-01-23 15:42:23,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:23,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709953818] [2025-01-23 15:42:23,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:23,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:23,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-23 15:42:23,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-23 15:42:23,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:23,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:42:23,688 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 15:42:23,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-23 15:42:23,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-23 15:42:23,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:23,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:42:23,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 15:42:23,696 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 15:42:23,696 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-01-23 15:42:23,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-23 15:42:23,697 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-23 15:42:23,697 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2025-01-23 15:42:23,697 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 15:42:23,697 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-23 15:42:23,706 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 15:42:23,709 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:23,713 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:42:23,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2025-01-23 15:42:23,715 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:23,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:42:23,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:23,804 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:23,804 INFO L139 ounterexampleChecker]: Examining path program with hash 992461057, occurence #1 [2025-01-23 15:42:23,804 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:23,804 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:23,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:23,804 INFO L85 PathProgramCache]: Analyzing trace with hash 452630007, now seen corresponding path program 1 times [2025-01-23 15:42:23,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:23,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237973341] [2025-01-23 15:42:23,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:23,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:23,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-23 15:42:23,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-23 15:42:23,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:23,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:23,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:23,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237973341] [2025-01-23 15:42:23,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237973341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:23,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:23,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:42:23,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167449801] [2025-01-23 15:42:23,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:23,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:23,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:23,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:23,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:23,859 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:23,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:42:23,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:23,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:23,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-23 15:42:23,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:23,930 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:23,930 INFO L139 ounterexampleChecker]: Examining path program with hash -1351243610, occurence #1 [2025-01-23 15:42:23,930 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:23,930 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:23,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:23,930 INFO L85 PathProgramCache]: Analyzing trace with hash -873637268, now seen corresponding path program 1 times [2025-01-23 15:42:23,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:23,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692734749] [2025-01-23 15:42:23,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:23,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:23,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-23 15:42:23,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-23 15:42:23,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:23,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:23,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:23,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692734749] [2025-01-23 15:42:23,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692734749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:23,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:23,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:42:23,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138618245] [2025-01-23 15:42:23,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:23,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:23,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:23,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:23,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:23,983 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:23,983 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) [2025-01-23 15:42:23,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:23,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:24,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:24,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:24,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 15:42:24,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-23 15:42:24,556 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 15:42:24,557 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE (1/4) [2025-01-23 15:42:24,558 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:24,559 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:42:24,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 15:42:24,560 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:24,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:42:24,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:42:24,567 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:24,568 INFO L139 ounterexampleChecker]: Examining path program with hash 1367854707, occurence #1 [2025-01-23 15:42:24,568 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:24,568 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:24,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:24,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1185744143, now seen corresponding path program 1 times [2025-01-23 15:42:24,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:24,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878535389] [2025-01-23 15:42:24,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:24,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:24,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-23 15:42:24,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-23 15:42:24,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:24,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:24,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:24,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878535389] [2025-01-23 15:42:24,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878535389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:24,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:24,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:42:24,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758471198] [2025-01-23 15:42:24,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:24,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:24,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:24,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:24,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:24,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:24,614 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:24,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) [2025-01-23 15:42:24,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:24,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:24,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-23 15:42:24,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:42:24,633 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:24,633 INFO L139 ounterexampleChecker]: Examining path program with hash 126157350, occurence #1 [2025-01-23 15:42:24,633 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:24,633 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:24,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:24,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2046787516, now seen corresponding path program 1 times [2025-01-23 15:42:24,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:24,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25923124] [2025-01-23 15:42:24,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:24,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:24,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-23 15:42:24,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-23 15:42:24,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:24,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:24,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:24,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25923124] [2025-01-23 15:42:24,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25923124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:24,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:24,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:42:24,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600600113] [2025-01-23 15:42:24,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:24,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:24,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:24,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:24,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:24,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:24,673 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:24,673 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) [2025-01-23 15:42:24,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:24,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:24,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:24,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-23 15:42:24,696 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:42:24,696 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:24,696 INFO L139 ounterexampleChecker]: Examining path program with hash 68532913, occurence #1 [2025-01-23 15:42:24,696 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:24,696 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:24,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:24,697 INFO L85 PathProgramCache]: Analyzing trace with hash 980046240, now seen corresponding path program 1 times [2025-01-23 15:42:24,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:24,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716838321] [2025-01-23 15:42:24,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:24,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:24,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-23 15:42:24,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-23 15:42:24,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:24,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:42:24,708 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 15:42:24,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-23 15:42:24,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-23 15:42:24,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:24,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:42:24,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 15:42:24,720 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 15:42:24,720 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-01-23 15:42:24,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-23 15:42:24,721 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-23 15:42:24,721 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/4) [2025-01-23 15:42:24,721 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 15:42:24,721 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-23 15:42:24,732 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 15:42:24,733 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:24,738 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:42:24,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2025-01-23 15:42:24,738 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:24,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:42:24,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:24,847 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:24,847 INFO L139 ounterexampleChecker]: Examining path program with hash -950165371, occurence #1 [2025-01-23 15:42:24,848 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:24,848 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:24,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:24,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1946142909, now seen corresponding path program 1 times [2025-01-23 15:42:24,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:24,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655116103] [2025-01-23 15:42:24,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:24,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:24,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-23 15:42:24,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-23 15:42:24,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:24,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:24,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:24,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655116103] [2025-01-23 15:42:24,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655116103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:24,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:24,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:42:24,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984699938] [2025-01-23 15:42:24,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:24,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:24,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:24,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:24,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:24,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:24,893 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:24,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:42:24,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:24,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:24,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-23 15:42:24,946 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:24,946 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:24,947 INFO L139 ounterexampleChecker]: Examining path program with hash -1621637562, occurence #1 [2025-01-23 15:42:24,947 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:24,947 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:24,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:24,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1779654280, now seen corresponding path program 1 times [2025-01-23 15:42:24,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:24,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532195666] [2025-01-23 15:42:24,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:24,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:24,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-23 15:42:24,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-23 15:42:24,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:24,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:24,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:24,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532195666] [2025-01-23 15:42:24,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532195666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:24,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:24,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:42:24,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006465551] [2025-01-23 15:42:24,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:24,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:24,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:24,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:24,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:24,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:24,972 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:24,973 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) [2025-01-23 15:42:24,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:24,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:25,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:25,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:25,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 15:42:25,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-23 15:42:25,868 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 15:42:25,868 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread3of4ForFork0 was SAFE (1/5) [2025-01-23 15:42:25,869 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:25,870 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:42:25,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread4of4ForFork0 ======== [2025-01-23 15:42:25,870 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:25,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:42:25,873 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:25,875 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:25,875 INFO L139 ounterexampleChecker]: Examining path program with hash -1586841111, occurence #1 [2025-01-23 15:42:25,875 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:25,875 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:25,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:25,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1756123418, now seen corresponding path program 1 times [2025-01-23 15:42:25,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:25,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173670769] [2025-01-23 15:42:25,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:25,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:25,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-23 15:42:25,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-23 15:42:25,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:25,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:25,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:25,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173670769] [2025-01-23 15:42:25,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173670769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:25,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:25,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:42:25,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700416386] [2025-01-23 15:42:25,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:25,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:25,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:25,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:25,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:25,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:25,923 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:25,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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) [2025-01-23 15:42:25,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:25,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:25,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-23 15:42:25,946 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:25,946 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:25,946 INFO L139 ounterexampleChecker]: Examining path program with hash -454621094, occurence #1 [2025-01-23 15:42:25,946 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:25,947 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:25,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:25,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1545210213, now seen corresponding path program 1 times [2025-01-23 15:42:25,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:25,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620565127] [2025-01-23 15:42:25,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:25,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:25,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-23 15:42:25,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-23 15:42:25,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:25,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:25,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:25,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620565127] [2025-01-23 15:42:25,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620565127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:25,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:25,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:42:25,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873381318] [2025-01-23 15:42:25,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:25,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:25,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:25,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:25,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:25,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:25,995 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:25,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2025-01-23 15:42:25,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:25,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:26,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 15:42:26,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-23 15:42:26,474 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 15:42:26,474 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread4of4ForFork0 was SAFE (2/5) [2025-01-23 15:42:26,476 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:26,477 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:42:26,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of4ForFork0 ======== [2025-01-23 15:42:26,478 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:26,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:42:26,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:26,480 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:26,480 INFO L139 ounterexampleChecker]: Examining path program with hash 468006959, occurence #1 [2025-01-23 15:42:26,480 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:26,481 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:26,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:26,481 INFO L85 PathProgramCache]: Analyzing trace with hash 334960640, now seen corresponding path program 1 times [2025-01-23 15:42:26,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:26,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745040063] [2025-01-23 15:42:26,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:26,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:26,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-23 15:42:26,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-23 15:42:26,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:26,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:26,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:26,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745040063] [2025-01-23 15:42:26,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745040063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:26,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:26,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-23 15:42:26,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197183281] [2025-01-23 15:42:26,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:26,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:26,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:26,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:26,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:26,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:26,501 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:26,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2025-01-23 15:42:26,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:26,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:26,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-23 15:42:26,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:26,823 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:26,823 INFO L139 ounterexampleChecker]: Examining path program with hash 944693817, occurence #1 [2025-01-23 15:42:26,823 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:26,823 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:26,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:26,824 INFO L85 PathProgramCache]: Analyzing trace with hash 325758109, now seen corresponding path program 1 times [2025-01-23 15:42:26,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:26,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362926933] [2025-01-23 15:42:26,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:26,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:26,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-23 15:42:26,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-23 15:42:26,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:26,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:26,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:26,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362926933] [2025-01-23 15:42:26,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362926933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:26,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:26,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:42:26,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123917088] [2025-01-23 15:42:26,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:26,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:26,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:26,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:26,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:26,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:26,845 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:26,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2025-01-23 15:42:26,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:26,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:27,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:27,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:27,058 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 15:42:27,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-23 15:42:27,059 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 15:42:27,059 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread1of4ForFork0 was SAFE (3/5) [2025-01-23 15:42:27,060 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:27,060 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:42:27,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread2of4ForFork0 ======== [2025-01-23 15:42:27,061 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:27,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:42:27,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:27,062 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:27,062 INFO L139 ounterexampleChecker]: Examining path program with hash 1852444560, occurence #1 [2025-01-23 15:42:27,062 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:27,062 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:27,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:27,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1824398559, now seen corresponding path program 1 times [2025-01-23 15:42:27,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:27,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458786839] [2025-01-23 15:42:27,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:27,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:27,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-23 15:42:27,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-23 15:42:27,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:27,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:27,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:27,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458786839] [2025-01-23 15:42:27,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458786839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:27,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:27,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:42:27,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770286431] [2025-01-23 15:42:27,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:27,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:27,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:27,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:27,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:27,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:27,087 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:27,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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) [2025-01-23 15:42:27,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:27,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:27,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-23 15:42:27,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:27,097 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:27,097 INFO L139 ounterexampleChecker]: Examining path program with hash -752542183, occurence #1 [2025-01-23 15:42:27,097 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:27,097 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:27,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:27,098 INFO L85 PathProgramCache]: Analyzing trace with hash 771600342, now seen corresponding path program 1 times [2025-01-23 15:42:27,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:27,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373510319] [2025-01-23 15:42:27,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:27,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:27,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-23 15:42:27,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-23 15:42:27,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:27,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:27,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:27,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:27,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373510319] [2025-01-23 15:42:27,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373510319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:27,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:27,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:42:27,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541459225] [2025-01-23 15:42:27,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:27,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:27,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:27,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:27,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:27,117 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:27,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:42:27,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:27,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:27,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:27,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:27,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 15:42:27,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-23 15:42:27,483 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 15:42:27,483 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread2of4ForFork0 was SAFE (4/5) [2025-01-23 15:42:27,484 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:27,484 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:42:27,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 15:42:27,484 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:27,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:42:27,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:42:27,488 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:27,488 INFO L139 ounterexampleChecker]: Examining path program with hash 260651920, occurence #1 [2025-01-23 15:42:27,488 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:27,488 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:27,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:27,488 INFO L85 PathProgramCache]: Analyzing trace with hash 287552900, now seen corresponding path program 1 times [2025-01-23 15:42:27,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:27,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441810834] [2025-01-23 15:42:27,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:27,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:27,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-23 15:42:27,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-23 15:42:27,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:27,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:27,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:27,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:27,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441810834] [2025-01-23 15:42:27,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441810834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:27,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:27,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:42:27,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545266074] [2025-01-23 15:42:27,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:27,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:27,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:27,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:27,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:27,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:27,530 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:27,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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) [2025-01-23 15:42:27,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:27,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:27,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-23 15:42:27,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:42:27,547 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:27,548 INFO L139 ounterexampleChecker]: Examining path program with hash 823274936, occurence #1 [2025-01-23 15:42:27,548 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:27,548 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:27,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1111679993, now seen corresponding path program 1 times [2025-01-23 15:42:27,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:27,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283037782] [2025-01-23 15:42:27,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:27,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:27,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-23 15:42:27,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-23 15:42:27,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:27,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:27,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:27,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:27,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283037782] [2025-01-23 15:42:27,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283037782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:27,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:27,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:42:27,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202450946] [2025-01-23 15:42:27,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:27,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:27,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:27,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:27,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:27,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:27,578 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:27,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:42:27,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:27,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:27,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:27,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:27,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-23 15:42:27,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:42:27,604 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:27,604 INFO L139 ounterexampleChecker]: Examining path program with hash -308955944, occurence #1 [2025-01-23 15:42:27,605 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:27,605 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:27,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:27,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1391626504, now seen corresponding path program 1 times [2025-01-23 15:42:27,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:27,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178982678] [2025-01-23 15:42:27,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:27,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:27,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-23 15:42:27,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-23 15:42:27,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:27,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:42:27,616 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 15:42:27,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-23 15:42:27,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-23 15:42:27,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:27,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:42:27,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 15:42:27,625 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 15:42:27,625 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-01-23 15:42:27,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-23 15:42:27,626 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-23 15:42:27,626 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (5/5) [2025-01-23 15:42:27,626 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 15:42:27,627 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-23 15:42:27,636 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 15:42:27,638 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:27,646 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:42:27,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread2of5ForFork0 ======== [2025-01-23 15:42:27,647 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:27,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:42:27,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:27,746 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:27,746 INFO L139 ounterexampleChecker]: Examining path program with hash -1411655773, occurence #1 [2025-01-23 15:42:27,746 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:27,746 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:27,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:27,747 INFO L85 PathProgramCache]: Analyzing trace with hash 15335334, now seen corresponding path program 1 times [2025-01-23 15:42:27,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:27,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319365354] [2025-01-23 15:42:27,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:27,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:27,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-23 15:42:27,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-23 15:42:27,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:27,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:27,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:27,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319365354] [2025-01-23 15:42:27,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319365354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:27,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:27,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:42:27,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926166899] [2025-01-23 15:42:27,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:27,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:27,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:27,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:27,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:27,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:27,774 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:27,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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) [2025-01-23 15:42:27,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:27,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:27,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-23 15:42:27,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:27,842 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:27,842 INFO L139 ounterexampleChecker]: Examining path program with hash 2035317982, occurence #1 [2025-01-23 15:42:27,843 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:27,843 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:27,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:27,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1155137008, now seen corresponding path program 1 times [2025-01-23 15:42:27,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:27,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699239338] [2025-01-23 15:42:27,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:27,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:27,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-23 15:42:27,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-23 15:42:27,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:27,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:27,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:27,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:27,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699239338] [2025-01-23 15:42:27,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699239338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:27,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:27,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:42:27,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709629685] [2025-01-23 15:42:27,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:27,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:27,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:27,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:27,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:27,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:27,870 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:27,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:42:27,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:27,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:30,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:30,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:30,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 15:42:30,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-23 15:42:30,085 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 15:42:30,085 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread2of5ForFork0 was SAFE (1/6) [2025-01-23 15:42:30,086 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:30,086 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:42:30,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of5ForFork0 ======== [2025-01-23 15:42:30,087 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:30,087 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:42:30,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:30,088 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:30,088 INFO L139 ounterexampleChecker]: Examining path program with hash -1474025611, occurence #1 [2025-01-23 15:42:30,088 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:30,088 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:30,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:30,092 INFO L85 PathProgramCache]: Analyzing trace with hash 816890239, now seen corresponding path program 1 times [2025-01-23 15:42:30,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:30,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422680724] [2025-01-23 15:42:30,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:30,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:30,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-23 15:42:30,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-23 15:42:30,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:30,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:30,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:30,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422680724] [2025-01-23 15:42:30,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422680724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:30,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:30,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-23 15:42:30,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811829112] [2025-01-23 15:42:30,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:30,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:30,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:30,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:30,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:30,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:30,108 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:30,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2025-01-23 15:42:30,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:31,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:31,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-23 15:42:31,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:31,418 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:31,418 INFO L139 ounterexampleChecker]: Examining path program with hash 1339839742, occurence #1 [2025-01-23 15:42:31,418 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:31,418 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:31,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:31,418 INFO L85 PathProgramCache]: Analyzing trace with hash -36815882, now seen corresponding path program 1 times [2025-01-23 15:42:31,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:31,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583289766] [2025-01-23 15:42:31,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:31,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:31,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-23 15:42:31,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-23 15:42:31,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:31,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:31,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:31,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583289766] [2025-01-23 15:42:31,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583289766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:31,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:31,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:42:31,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542621654] [2025-01-23 15:42:31,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:31,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:31,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:31,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:31,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:31,434 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:31,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2025-01-23 15:42:31,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:31,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:32,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:32,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:32,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 15:42:32,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-23 15:42:32,162 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 15:42:32,162 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread1of5ForFork0 was SAFE (2/6) [2025-01-23 15:42:32,163 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:32,164 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:42:32,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 15:42:32,164 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:32,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:42:32,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:42:32,167 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:32,167 INFO L139 ounterexampleChecker]: Examining path program with hash -754897261, occurence #1 [2025-01-23 15:42:32,167 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:32,167 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:32,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:32,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1319197851, now seen corresponding path program 1 times [2025-01-23 15:42:32,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:32,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141018692] [2025-01-23 15:42:32,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:32,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:32,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-23 15:42:32,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-23 15:42:32,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:32,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:32,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:32,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:32,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141018692] [2025-01-23 15:42:32,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141018692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:32,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:32,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:42:32,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110621307] [2025-01-23 15:42:32,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:32,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:32,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:32,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:32,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:32,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:32,216 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:32,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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) [2025-01-23 15:42:32,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:32,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:32,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-23 15:42:32,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:42:32,239 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:32,239 INFO L139 ounterexampleChecker]: Examining path program with hash -1963538737, occurence #1 [2025-01-23 15:42:32,239 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:32,239 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:32,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:32,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1102502833, now seen corresponding path program 1 times [2025-01-23 15:42:32,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:32,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576222768] [2025-01-23 15:42:32,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:32,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:32,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-23 15:42:32,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-23 15:42:32,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:32,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:32,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:32,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576222768] [2025-01-23 15:42:32,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576222768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:32,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:32,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:42:32,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102180349] [2025-01-23 15:42:32,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:32,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:32,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:32,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:32,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:32,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:32,280 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:32,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2025-01-23 15:42:32,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:32,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:32,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:32,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:32,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-23 15:42:32,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:42:32,312 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:32,313 INFO L139 ounterexampleChecker]: Examining path program with hash 540775842, occurence #1 [2025-01-23 15:42:32,313 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:32,313 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:32,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1602093373, now seen corresponding path program 1 times [2025-01-23 15:42:32,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:32,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064719141] [2025-01-23 15:42:32,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:32,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:32,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-23 15:42:32,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-23 15:42:32,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:32,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:42:32,322 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 15:42:32,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-23 15:42:32,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-23 15:42:32,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:32,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:42:32,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 15:42:32,339 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 15:42:32,339 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-01-23 15:42:32,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-23 15:42:32,340 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-23 15:42:32,340 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/6) [2025-01-23 15:42:32,340 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 15:42:32,340 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-01-23 15:42:32,354 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 15:42:32,356 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:32,363 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:42:32,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread6of6ForFork0 ======== [2025-01-23 15:42:32,364 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:32,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:42:32,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:32,545 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:32,545 INFO L139 ounterexampleChecker]: Examining path program with hash -1501768725, occurence #1 [2025-01-23 15:42:32,545 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:32,545 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:32,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:32,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1536263690, now seen corresponding path program 1 times [2025-01-23 15:42:32,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:32,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628714258] [2025-01-23 15:42:32,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:32,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:32,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-23 15:42:32,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-23 15:42:32,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:32,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:32,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:32,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628714258] [2025-01-23 15:42:32,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628714258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:32,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:32,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:42:32,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021889165] [2025-01-23 15:42:32,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:32,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:32,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:32,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:32,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:32,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:32,589 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:32,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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) [2025-01-23 15:42:32,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:32,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:32,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-23 15:42:32,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:32,653 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:32,653 INFO L139 ounterexampleChecker]: Examining path program with hash -1006727447, occurence #1 [2025-01-23 15:42:32,654 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:32,654 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:32,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:32,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1847406194, now seen corresponding path program 1 times [2025-01-23 15:42:32,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:32,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468764462] [2025-01-23 15:42:32,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:32,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:32,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-23 15:42:32,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-23 15:42:32,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:32,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:32,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:32,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468764462] [2025-01-23 15:42:32,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468764462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:32,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:32,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:42:32,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876934504] [2025-01-23 15:42:32,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:32,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:32,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:32,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:32,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:32,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:32,692 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:32,692 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) [2025-01-23 15:42:32,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:32,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:43,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:43,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 15:42:43,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-23 15:42:43,289 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 15:42:43,289 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread6of6ForFork0 was SAFE (1/7) [2025-01-23 15:42:43,290 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:43,290 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:42:43,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of6ForFork0 ======== [2025-01-23 15:42:43,291 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:43,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:42:43,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:43,292 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:43,292 INFO L139 ounterexampleChecker]: Examining path program with hash 2107093229, occurence #1 [2025-01-23 15:42:43,292 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:43,292 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:43,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:43,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1452463135, now seen corresponding path program 1 times [2025-01-23 15:42:43,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:43,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105813497] [2025-01-23 15:42:43,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:43,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:43,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-23 15:42:43,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-23 15:42:43,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:43,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:43,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:43,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:43,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105813497] [2025-01-23 15:42:43,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105813497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:43,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:43,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-23 15:42:43,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381872656] [2025-01-23 15:42:43,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:43,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:43,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:43,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:43,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:43,323 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:43,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2025-01-23 15:42:43,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:55,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:55,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-23 15:42:55,035 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:55,036 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:55,036 INFO L139 ounterexampleChecker]: Examining path program with hash 644461736, occurence #1 [2025-01-23 15:42:55,036 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:55,036 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:55,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:55,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1802548080, now seen corresponding path program 1 times [2025-01-23 15:42:55,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:55,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194086745] [2025-01-23 15:42:55,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:55,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:55,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-23 15:42:55,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-23 15:42:55,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:55,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:55,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:55,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194086745] [2025-01-23 15:42:55,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194086745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:55,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:55,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:42:55,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320403171] [2025-01-23 15:42:55,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:55,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:55,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:55,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:55,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:55,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:55,050 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:55,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2025-01-23 15:42:55,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:55,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:58,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:58,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:58,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 15:42:58,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-23 15:42:58,709 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 15:42:58,709 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread1of6ForFork0 was SAFE (2/7) [2025-01-23 15:42:58,710 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:58,710 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:42:58,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread5of6ForFork0 ======== [2025-01-23 15:42:58,710 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:42:58,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:42:58,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:58,712 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:58,712 INFO L139 ounterexampleChecker]: Examining path program with hash -1157386934, occurence #1 [2025-01-23 15:42:58,712 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:58,712 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:58,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:58,713 INFO L85 PathProgramCache]: Analyzing trace with hash -211384103, now seen corresponding path program 1 times [2025-01-23 15:42:58,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:58,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159018953] [2025-01-23 15:42:58,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:58,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:58,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-23 15:42:58,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-23 15:42:58,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:58,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:58,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:58,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159018953] [2025-01-23 15:42:58,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159018953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:58,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:58,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:42:58,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302732305] [2025-01-23 15:42:58,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:58,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:58,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:58,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:58,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:58,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:58,740 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:58,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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) [2025-01-23 15:42:58,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:58,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-23 15:42:58,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:42:58,764 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:42:58,764 INFO L139 ounterexampleChecker]: Examining path program with hash -393263850, occurence #1 [2025-01-23 15:42:58,764 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:42:58,764 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:42:58,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:42:58,764 INFO L85 PathProgramCache]: Analyzing trace with hash -367905187, now seen corresponding path program 1 times [2025-01-23 15:42:58,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:42:58,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877415853] [2025-01-23 15:42:58,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:42:58,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:42:58,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-23 15:42:58,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-23 15:42:58,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:42:58,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:42:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:42:58,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:42:58,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877415853] [2025-01-23 15:42:58,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877415853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:42:58,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:42:58,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:42:58,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39796648] [2025-01-23 15:42:58,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:42:58,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:42:58,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:42:58,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:42:58,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:42:58,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:42:58,792 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:42:58,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:42:58,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:42:58,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:43:07,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:43:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:43:07,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 15:43:07,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-23 15:43:07,460 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 15:43:07,460 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread5of6ForFork0 was SAFE (3/7) [2025-01-23 15:43:07,460 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:43:07,461 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:43:07,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 15:43:07,461 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:43:07,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:43:07,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:43:07,463 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:43:07,463 INFO L139 ounterexampleChecker]: Examining path program with hash -159545287, occurence #1 [2025-01-23 15:43:07,464 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:43:07,464 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:43:07,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:43:07,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1119295980, now seen corresponding path program 1 times [2025-01-23 15:43:07,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:43:07,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649691837] [2025-01-23 15:43:07,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:43:07,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:43:07,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-23 15:43:07,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-23 15:43:07,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:43:07,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:43:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:43:07,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:43:07,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649691837] [2025-01-23 15:43:07,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649691837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:43:07,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:43:07,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:43:07,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850060172] [2025-01-23 15:43:07,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:43:07,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:43:07,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:43:07,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:43:07,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:43:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:43:07,498 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:43:07,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:43:07,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:43:07,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:43:07,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-23 15:43:07,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:43:07,521 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:43:07,521 INFO L139 ounterexampleChecker]: Examining path program with hash 1822266213, occurence #1 [2025-01-23 15:43:07,521 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:43:07,521 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:43:07,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:43:07,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1535811432, now seen corresponding path program 1 times [2025-01-23 15:43:07,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:43:07,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251351937] [2025-01-23 15:43:07,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:43:07,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:43:07,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-23 15:43:07,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-23 15:43:07,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:43:07,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:43:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:43:07,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:43:07,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251351937] [2025-01-23 15:43:07,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251351937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:43:07,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:43:07,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:43:07,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739026138] [2025-01-23 15:43:07,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:43:07,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:43:07,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:43:07,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:43:07,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:43:07,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:43:07,549 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:43:07,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2025-01-23 15:43:07,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:43:07,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:43:07,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:43:07,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:43:07,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-23 15:43:07,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 15:43:07,728 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:43:07,728 INFO L139 ounterexampleChecker]: Examining path program with hash -369470682, occurence #1 [2025-01-23 15:43:07,728 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:43:07,728 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:43:07,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:43:07,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2093080800, now seen corresponding path program 1 times [2025-01-23 15:43:07,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:43:07,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45370770] [2025-01-23 15:43:07,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:43:07,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:43:07,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-23 15:43:07,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-23 15:43:07,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:43:07,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:43:07,736 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 15:43:07,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-23 15:43:07,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-23 15:43:07,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:43:07,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 15:43:07,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 15:43:07,753 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 15:43:07,753 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-01-23 15:43:07,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-23 15:43:07,754 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-23 15:43:07,755 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (4/7) [2025-01-23 15:43:07,755 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 15:43:07,755 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-01-23 15:43:07,765 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 15:43:07,767 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:43:07,773 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:43:07,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread5of7ForFork0 ======== [2025-01-23 15:43:07,774 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:43:07,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:43:07,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:43:07,951 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:43:07,951 INFO L139 ounterexampleChecker]: Examining path program with hash -706235444, occurence #1 [2025-01-23 15:43:07,951 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:43:07,951 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:43:07,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:43:07,951 INFO L85 PathProgramCache]: Analyzing trace with hash 606269762, now seen corresponding path program 1 times [2025-01-23 15:43:07,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:43:07,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611317564] [2025-01-23 15:43:07,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:43:07,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:43:07,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-23 15:43:07,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-23 15:43:07,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:43:07,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:43:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:43:07,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:43:07,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611317564] [2025-01-23 15:43:07,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611317564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:43:07,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:43:07,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:43:07,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326164087] [2025-01-23 15:43:07,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:43:07,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:43:07,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:43:07,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:43:07,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:43:07,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:43:07,976 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:43:07,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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) [2025-01-23 15:43:07,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:43:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:43:08,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-23 15:43:08,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:43:08,034 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:43:08,034 INFO L139 ounterexampleChecker]: Examining path program with hash -1708987166, occurence #1 [2025-01-23 15:43:08,034 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:43:08,034 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:43:08,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:43:08,035 INFO L85 PathProgramCache]: Analyzing trace with hash -272280767, now seen corresponding path program 1 times [2025-01-23 15:43:08,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:43:08,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311520790] [2025-01-23 15:43:08,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:43:08,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:43:08,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-23 15:43:08,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-23 15:43:08,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:43:08,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:43:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:43:08,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:43:08,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311520790] [2025-01-23 15:43:08,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311520790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:43:08,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:43:08,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:43:08,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380454723] [2025-01-23 15:43:08,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:43:08,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:43:08,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:43:08,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:43:08,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:43:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:43:08,056 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:43:08,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:43:08,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:43:08,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:44:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:44:13,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:44:13,797 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 15:44:13,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-23 15:44:13,798 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 15:44:13,798 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread5of7ForFork0 was SAFE (1/8) [2025-01-23 15:44:13,799 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:44:13,800 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:44:13,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread6of7ForFork0 ======== [2025-01-23 15:44:13,800 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:44:13,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:44:13,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:44:13,804 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:44:13,804 INFO L139 ounterexampleChecker]: Examining path program with hash -1265276332, occurence #1 [2025-01-23 15:44:13,805 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:44:13,805 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:44:13,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:44:13,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1884953607, now seen corresponding path program 1 times [2025-01-23 15:44:13,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:44:13,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130598930] [2025-01-23 15:44:13,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:44:13,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:44:13,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-23 15:44:13,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-23 15:44:13,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:44:13,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:44:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:44:13,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:44:13,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130598930] [2025-01-23 15:44:13,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130598930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:44:13,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:44:13,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:44:13,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809501764] [2025-01-23 15:44:13,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:44:13,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:44:13,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:44:13,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:44:13,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:44:13,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:44:13,839 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:44:13,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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) [2025-01-23 15:44:13,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:44:13,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:44:13,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-23 15:44:13,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:44:13,863 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:44:13,863 INFO L139 ounterexampleChecker]: Examining path program with hash -1974212953, occurence #1 [2025-01-23 15:44:13,863 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:44:13,863 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:44:13,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:44:13,863 INFO L85 PathProgramCache]: Analyzing trace with hash 523841144, now seen corresponding path program 1 times [2025-01-23 15:44:13,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:44:13,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815387498] [2025-01-23 15:44:13,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:44:13,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:44:13,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-23 15:44:13,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-23 15:44:13,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:44:13,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:44:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:44:14,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:44:14,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815387498] [2025-01-23 15:44:14,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815387498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:44:14,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:44:14,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:44:14,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641527057] [2025-01-23 15:44:14,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:44:14,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:44:14,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:44:14,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:44:14,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:44:14,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:44:14,156 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:44:14,156 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) [2025-01-23 15:44:14,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:44:14,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:45:17,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:45:17,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:45:17,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 15:45:17,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-23 15:45:17,142 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 15:45:17,142 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread6of7ForFork0 was SAFE (2/8) [2025-01-23 15:45:17,143 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:45:17,143 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:45:17,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread4of7ForFork0 ======== [2025-01-23 15:45:17,143 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:45:17,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:45:17,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:45:17,145 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:45:17,145 INFO L139 ounterexampleChecker]: Examining path program with hash -574389117, occurence #1 [2025-01-23 15:45:17,145 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:45:17,145 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:45:17,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:45:17,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2108979212, now seen corresponding path program 1 times [2025-01-23 15:45:17,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:45:17,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622181748] [2025-01-23 15:45:17,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:45:17,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:45:17,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-23 15:45:17,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-23 15:45:17,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:45:17,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:45:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:45:17,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:45:17,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622181748] [2025-01-23 15:45:17,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622181748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:45:17,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:45:17,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:45:17,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608252914] [2025-01-23 15:45:17,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:45:17,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:45:17,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:45:17,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:45:17,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:45:17,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:45:17,165 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:45:17,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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) [2025-01-23 15:45:17,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:45:17,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:45:17,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-23 15:45:17,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:45:17,182 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:45:17,182 INFO L139 ounterexampleChecker]: Examining path program with hash -64879447, occurence #1 [2025-01-23 15:45:17,182 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:45:17,182 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:45:17,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:45:17,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1000190347, now seen corresponding path program 1 times [2025-01-23 15:45:17,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:45:17,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414954333] [2025-01-23 15:45:17,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:45:17,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:45:17,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-23 15:45:17,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-23 15:45:17,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:45:17,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:45:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:45:17,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:45:17,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414954333] [2025-01-23 15:45:17,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414954333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:45:17,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:45:17,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:45:17,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447127706] [2025-01-23 15:45:17,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:45:17,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:45:17,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:45:17,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:45:17,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:45:17,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:45:17,199 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:45:17,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2025-01-23 15:45:17,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:45:17,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:46:18,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:46:18,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:46:18,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 15:46:18,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-23 15:46:18,774 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 15:46:18,779 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread4of7ForFork0 was SAFE (3/8) [2025-01-23 15:46:18,779 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:46:18,780 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:46:18,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of7ForFork0 ======== [2025-01-23 15:46:18,780 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;@60561f34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:46:18,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:46:18,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:46:18,783 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:46:18,783 INFO L139 ounterexampleChecker]: Examining path program with hash 1237177211, occurence #1 [2025-01-23 15:46:18,783 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:46:18,783 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:46:18,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:46:18,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1341275799, now seen corresponding path program 1 times [2025-01-23 15:46:18,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:46:18,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589775412] [2025-01-23 15:46:18,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:46:18,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:46:18,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-23 15:46:18,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-23 15:46:18,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:46:18,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:46:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:46:18,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:46:18,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589775412] [2025-01-23 15:46:18,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589775412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:46:18,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:46:18,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:46:18,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401993475] [2025-01-23 15:46:18,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:46:18,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:46:18,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:46:18,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:46:18,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:46:18,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:46:18,805 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:46:18,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:46:18,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:46:18,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:46:18,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-23 15:46:18,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:46:18,818 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:46:18,818 INFO L139 ounterexampleChecker]: Examining path program with hash 379861512, occurence #1 [2025-01-23 15:46:18,818 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:46:18,818 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:46:18,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:46:18,818 INFO L85 PathProgramCache]: Analyzing trace with hash 138022806, now seen corresponding path program 1 times [2025-01-23 15:46:18,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:46:18,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201692238] [2025-01-23 15:46:18,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:46:18,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:46:18,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-23 15:46:18,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-23 15:46:18,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:46:18,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:46:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:46:18,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:46:18,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201692238] [2025-01-23 15:46:18,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201692238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:46:18,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:46:18,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:46:18,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564683462] [2025-01-23 15:46:18,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:46:18,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:46:18,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:46:18,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:46:18,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:46:18,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:46:18,833 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:46:18,833 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) [2025-01-23 15:46:18,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:46:18,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.