./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/09_fmaxsym-zero.i --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_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/09_fmaxsym-zero.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 41cf9d90b654ba629ed26494b45977a61fd5035aced9f092d4e43a94133522bd --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-23 22:33:00,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 22:33:00,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-23 22:33:00,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 22:33:00,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 22:33:00,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 22:33:00,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 22:33:00,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 22:33:00,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 22:33:00,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 22:33:00,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 22:33:00,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 22:33:00,671 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 22:33:00,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 22:33:00,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 22:33:00,673 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 22:33:00,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-23 22:33:00,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 22:33:00,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 22:33:00,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 22:33:00,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 22:33:00,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 22:33:00,673 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 22:33:00,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 22:33:00,673 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 22:33:00,673 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 22:33:00,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 22:33:00,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 22:33:00,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 22:33:00,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 22:33:00,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 22:33:00,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 22:33:00,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 22:33:00,674 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 22:33:00,674 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 22:33:00,674 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 22:33:00,674 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-23 22:33:00,674 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 22:33:00,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-23 22:33:00,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 22:33:00,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 22:33:00,674 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 22:33:00,674 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 22:33:00,674 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 -> 41cf9d90b654ba629ed26494b45977a61fd5035aced9f092d4e43a94133522bd 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 -> NECESSARY_AND_SUFFICIENT [2025-01-23 22:33:00,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 22:33:00,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 22:33:00,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 22:33:00,927 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 22:33:00,928 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 22:33:00,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/09_fmaxsym-zero.i [2025-01-23 22:33:02,087 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/c87c6ad32/9dadb3eb0e62400fa12c5c2af956c571/FLAGf7df1ac43 [2025-01-23 22:33:02,322 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 22:33:02,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/09_fmaxsym-zero.i [2025-01-23 22:33:02,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/c87c6ad32/9dadb3eb0e62400fa12c5c2af956c571/FLAGf7df1ac43 [2025-01-23 22:33:02,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/c87c6ad32/9dadb3eb0e62400fa12c5c2af956c571 [2025-01-23 22:33:02,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 22:33:02,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 22:33:02,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 22:33:02,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 22:33:02,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 22:33:02,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 10:33:02" (1/1) ... [2025-01-23 22:33:02,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea29670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 10:33:02, skipping insertion in model container [2025-01-23 22:33:02,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 10:33:02" (1/1) ... [2025-01-23 22:33:02,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 22:33:02,638 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/09_fmaxsym-zero.i[30725,30738] [2025-01-23 22:33:02,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 22:33:02,664 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 22:33:02,732 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/09_fmaxsym-zero.i[30725,30738] [2025-01-23 22:33:02,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 22:33:02,759 INFO L204 MainTranslator]: Completed translation [2025-01-23 22:33:02,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 10:33:02 WrapperNode [2025-01-23 22:33:02,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 22:33:02,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 22:33:02,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 22:33:02,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 22:33:02,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 10:33:02" (1/1) ... [2025-01-23 22:33:02,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 10:33:02" (1/1) ... [2025-01-23 22:33:02,791 INFO L138 Inliner]: procedures = 164, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2025-01-23 22:33:02,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 22:33:02,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 22:33:02,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 22:33:02,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 22:33:02,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 10:33:02" (1/1) ... [2025-01-23 22:33:02,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 10:33:02" (1/1) ... [2025-01-23 22:33:02,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 10:33:02" (1/1) ... [2025-01-23 22:33:02,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 10:33:02" (1/1) ... [2025-01-23 22:33:02,807 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 10:33:02" (1/1) ... [2025-01-23 22:33:02,808 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 10:33:02" (1/1) ... [2025-01-23 22:33:02,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 10:33:02" (1/1) ... [2025-01-23 22:33:02,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 10:33:02" (1/1) ... [2025-01-23 22:33:02,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 10:33:02" (1/1) ... [2025-01-23 22:33:02,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 22:33:02,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 22:33:02,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 22:33:02,823 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 22:33:02,823 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 10:33:02" (1/1) ... [2025-01-23 22:33:02,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 22:33:02,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 22:33:02,850 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 22:33:02,853 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 22:33:02,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-23 22:33:02,871 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-23 22:33:02,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-23 22:33:02,871 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-23 22:33:02,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 22:33:02,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-23 22:33:02,871 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-23 22:33:02,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 22:33:02,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 22:33:02,873 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 22:33:02,960 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 22:33:02,961 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 22:33:03,062 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 22:33:03,063 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 22:33:03,153 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 22:33:03,153 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-23 22:33:03,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 10:33:03 BoogieIcfgContainer [2025-01-23 22:33:03,153 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 22:33:03,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 22:33:03,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 22:33:03,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 22:33:03,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 10:33:02" (1/3) ... [2025-01-23 22:33:03,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386f678c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 10:33:03, skipping insertion in model container [2025-01-23 22:33:03,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 10:33:02" (2/3) ... [2025-01-23 22:33:03,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386f678c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 10:33:03, skipping insertion in model container [2025-01-23 22:33:03,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 10:33:03" (3/3) ... [2025-01-23 22:33:03,162 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym-zero.i [2025-01-23 22:33:03,172 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 22:33:03,173 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym-zero.i that has 2 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-23 22:33:03,173 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 22:33:03,205 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 22:33:03,232 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:33:03,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 22:33:03,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 22:33:03,234 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 22:33:03,236 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 22:33:03,283 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 22:33:03,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2025-01-23 22:33:03,303 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23278314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:33:03,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 22:33:03,513 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:33:03,514 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:03,514 INFO L139 ounterexampleChecker]: Examining path program with hash 920878176, occurence #1 [2025-01-23 22:33:03,514 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:03,514 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:03,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:03,517 INFO L85 PathProgramCache]: Analyzing trace with hash -327199495, now seen corresponding path program 1 times [2025-01-23 22:33:03,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:03,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957702603] [2025-01-23 22:33:03,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:03,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:03,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-23 22:33:03,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-23 22:33:03,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:03,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:03,713 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 22:33:03,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:03,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957702603] [2025-01-23 22:33:03,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957702603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:03,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:03,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:33:03,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035318622] [2025-01-23 22:33:03,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:03,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:33:03,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:03,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:33:03,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:33:03,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:03,738 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:03,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.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 22:33:03,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:03,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:03,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 22:33:03,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-23 22:33:03,938 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-23 22:33:03,939 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2025-01-23 22:33:03,943 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:33:03,944 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 22:33:03,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 22:33:03,944 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;@23278314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:33:03,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 22:33:03,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 22:33:03,957 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:03,957 INFO L139 ounterexampleChecker]: Examining path program with hash 2070276538, occurence #1 [2025-01-23 22:33:03,957 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:03,957 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:03,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash -906096431, now seen corresponding path program 1 times [2025-01-23 22:33:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:03,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699812508] [2025-01-23 22:33:03,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:03,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:03,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-23 22:33:03,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-23 22:33:03,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:03,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:04,069 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 22:33:04,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:04,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699812508] [2025-01-23 22:33:04,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699812508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:04,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:04,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:33:04,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013485214] [2025-01-23 22:33:04,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:04,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:33:04,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:04,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:33:04,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:33:04,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:04,070 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:04,070 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 22:33:04,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:04,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:04,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-23 22:33:04,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 22:33:04,104 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:04,104 INFO L139 ounterexampleChecker]: Examining path program with hash -881763016, occurence #1 [2025-01-23 22:33:04,104 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:04,104 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:04,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:04,105 INFO L85 PathProgramCache]: Analyzing trace with hash -906064718, now seen corresponding path program 1 times [2025-01-23 22:33:04,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:04,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180642860] [2025-01-23 22:33:04,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:04,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:04,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-23 22:33:04,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-23 22:33:04,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:04,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 22:33:04,137 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 22:33:04,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-23 22:33:04,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-23 22:33:04,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:04,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 22:33:04,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 22:33:04,181 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 22:33:04,182 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-01-23 22:33:04,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-23 22:33:04,183 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 22:33:04,185 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2025-01-23 22:33:04,185 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 22:33:04,185 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-23 22:33:04,202 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 22:33:04,204 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:33:04,210 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 22:33:04,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 22:33:04,212 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;@23278314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:33:04,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 22:33:04,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 22:33:04,562 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:04,562 INFO L139 ounterexampleChecker]: Examining path program with hash 1799055066, occurence #1 [2025-01-23 22:33:04,562 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:04,562 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:04,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:04,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1360706299, now seen corresponding path program 1 times [2025-01-23 22:33:04,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:04,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436528771] [2025-01-23 22:33:04,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:04,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:04,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-23 22:33:04,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-23 22:33:04,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:04,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:04,652 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 22:33:04,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:04,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436528771] [2025-01-23 22:33:04,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436528771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:04,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:04,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:33:04,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352807012] [2025-01-23 22:33:04,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:04,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:33:04,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:04,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:33:04,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:33:04,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:04,655 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:04,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 22:33:04,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:04,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:04,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-23 22:33:04,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 22:33:04,889 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:04,889 INFO L139 ounterexampleChecker]: Examining path program with hash 731916491, occurence #1 [2025-01-23 22:33:04,889 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:04,889 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:04,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:04,889 INFO L85 PathProgramCache]: Analyzing trace with hash 909140795, now seen corresponding path program 1 times [2025-01-23 22:33:04,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:04,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091312083] [2025-01-23 22:33:04,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:04,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:04,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-23 22:33:04,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-23 22:33:04,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:04,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:04,995 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 22:33:04,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:04,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091312083] [2025-01-23 22:33:04,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091312083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:04,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:04,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:33:04,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994439669] [2025-01-23 22:33:04,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:04,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:33:04,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:04,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:33:04,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:33:04,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:04,997 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:04,997 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 22:33:04,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:04,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:05,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:05,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:05,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-23 22:33:05,090 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 22:33:05,090 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:05,090 INFO L139 ounterexampleChecker]: Examining path program with hash 446654984, occurence #1 [2025-01-23 22:33:05,090 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:05,090 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:05,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:05,091 INFO L85 PathProgramCache]: Analyzing trace with hash 909172508, now seen corresponding path program 1 times [2025-01-23 22:33:05,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:05,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703421768] [2025-01-23 22:33:05,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:05,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:05,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-23 22:33:05,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-23 22:33:05,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:05,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 22:33:05,155 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 22:33:05,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-23 22:33:05,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-23 22:33:05,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:05,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 22:33:05,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 22:33:05,204 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 22:33:05,205 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-01-23 22:33:05,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-23 22:33:05,206 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-23 22:33:05,206 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2025-01-23 22:33:05,207 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 22:33:05,207 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-23 22:33:05,221 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 22:33:05,224 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:33:05,232 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 22:33:05,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2025-01-23 22:33:05,234 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;@23278314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:33:05,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 22:33:05,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:33:05,745 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:05,745 INFO L139 ounterexampleChecker]: Examining path program with hash 293691187, occurence #1 [2025-01-23 22:33:05,745 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:05,745 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:05,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:05,746 INFO L85 PathProgramCache]: Analyzing trace with hash 669562024, now seen corresponding path program 1 times [2025-01-23 22:33:05,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:05,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32805425] [2025-01-23 22:33:05,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:05,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:05,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-23 22:33:05,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-23 22:33:05,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:05,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:05,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 22:33:05,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:05,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32805425] [2025-01-23 22:33:05,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32805425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:05,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:05,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:33:05,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768267067] [2025-01-23 22:33:05,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:05,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:33:05,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:05,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:33:05,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:33:05,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:05,808 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:05,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 22:33:05,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:06,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:06,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-23 22:33:06,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:33:06,081 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:06,082 INFO L139 ounterexampleChecker]: Examining path program with hash -1276729685, occurence #1 [2025-01-23 22:33:06,082 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:06,082 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:06,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:06,082 INFO L85 PathProgramCache]: Analyzing trace with hash 336302293, now seen corresponding path program 1 times [2025-01-23 22:33:06,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:06,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352482912] [2025-01-23 22:33:06,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:06,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:06,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-23 22:33:06,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-23 22:33:06,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:06,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:06,172 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 22:33:06,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:06,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352482912] [2025-01-23 22:33:06,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352482912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:06,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:06,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 22:33:06,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232040238] [2025-01-23 22:33:06,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:06,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 22:33:06,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:06,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 22:33:06,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-23 22:33:06,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:06,173 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:06,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 22:33:06,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:06,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:06,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:06,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:06,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-23 22:33:06,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:33:06,250 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:06,250 INFO L139 ounterexampleChecker]: Examining path program with hash 54855516, occurence #1 [2025-01-23 22:33:06,250 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:06,250 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:06,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:06,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1404473543, now seen corresponding path program 1 times [2025-01-23 22:33:06,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:06,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411521195] [2025-01-23 22:33:06,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:06,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:06,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-23 22:33:06,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-23 22:33:06,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:06,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:06,335 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 22:33:06,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:06,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411521195] [2025-01-23 22:33:06,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411521195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:06,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:06,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:33:06,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937218541] [2025-01-23 22:33:06,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:06,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:33:06,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:06,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:33:06,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:33:06,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:06,337 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:06,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 22:33:06,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:06,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:06,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:06,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:06,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:06,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:06,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-23 22:33:06,504 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:33:06,504 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:06,504 INFO L139 ounterexampleChecker]: Examining path program with hash 195957782, occurence #1 [2025-01-23 22:33:06,504 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:06,504 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:06,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:06,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1854017103, now seen corresponding path program 1 times [2025-01-23 22:33:06,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:06,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901632529] [2025-01-23 22:33:06,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:06,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:06,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-23 22:33:06,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-23 22:33:06,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:06,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:06,622 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 22:33:06,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:06,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901632529] [2025-01-23 22:33:06,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901632529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:06,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:06,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:33:06,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234408341] [2025-01-23 22:33:06,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:06,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:33:06,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:06,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:33:06,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:33:06,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:06,623 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:06,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 22:33:06,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:06,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:06,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:06,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:08,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 22:33:08,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-23 22:33:08,753 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-23 22:33:08,753 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE (1/4) [2025-01-23 22:33:08,754 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:33:08,755 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 22:33:08,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 22:33:08,755 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;@23278314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:33:08,756 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 22:33:08,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 22:33:08,760 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:08,761 INFO L139 ounterexampleChecker]: Examining path program with hash 1970752289, occurence #1 [2025-01-23 22:33:08,761 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:08,761 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:08,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:08,761 INFO L85 PathProgramCache]: Analyzing trace with hash -795978440, now seen corresponding path program 1 times [2025-01-23 22:33:08,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:08,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166661150] [2025-01-23 22:33:08,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:08,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:08,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-23 22:33:08,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-23 22:33:08,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:08,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:08,803 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 22:33:08,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:08,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166661150] [2025-01-23 22:33:08,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166661150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:08,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:08,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:33:08,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025155461] [2025-01-23 22:33:08,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:08,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:33:08,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:08,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:33:08,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:33:08,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:08,805 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:08,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 22:33:08,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:08,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:08,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-23 22:33:08,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 22:33:08,851 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:08,851 INFO L139 ounterexampleChecker]: Examining path program with hash -2010213887, occurence #1 [2025-01-23 22:33:08,851 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:08,851 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:08,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:08,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1063967269, now seen corresponding path program 1 times [2025-01-23 22:33:08,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:08,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797202892] [2025-01-23 22:33:08,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:08,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:08,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-23 22:33:08,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-23 22:33:08,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:08,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:08,915 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 22:33:08,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:08,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797202892] [2025-01-23 22:33:08,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797202892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:08,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:08,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 22:33:08,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017685961] [2025-01-23 22:33:08,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:08,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 22:33:08,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:08,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 22:33:08,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-23 22:33:08,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:08,917 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:08,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 22:33:08,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:08,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:08,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:08,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:08,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-23 22:33:08,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 22:33:08,981 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:08,981 INFO L139 ounterexampleChecker]: Examining path program with hash 954462903, occurence #1 [2025-01-23 22:33:08,982 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:08,982 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:08,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:08,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1079332983, now seen corresponding path program 1 times [2025-01-23 22:33:08,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:08,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459818695] [2025-01-23 22:33:08,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:08,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:08,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-23 22:33:08,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-23 22:33:08,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:08,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:09,040 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 22:33:09,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:09,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459818695] [2025-01-23 22:33:09,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459818695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:09,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:09,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:33:09,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139870007] [2025-01-23 22:33:09,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:09,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:33:09,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:09,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:33:09,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:33:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:09,042 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:09,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 22:33:09,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:09,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:09,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:09,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:09,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:09,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:09,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-23 22:33:09,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 22:33:09,115 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:09,115 INFO L139 ounterexampleChecker]: Examining path program with hash 856362409, occurence #1 [2025-01-23 22:33:09,115 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:09,115 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:09,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:09,116 INFO L85 PathProgramCache]: Analyzing trace with hash 701002753, now seen corresponding path program 1 times [2025-01-23 22:33:09,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:09,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263632664] [2025-01-23 22:33:09,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:09,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:09,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-23 22:33:09,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-23 22:33:09,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:09,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:09,203 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 22:33:09,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:09,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263632664] [2025-01-23 22:33:09,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263632664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:09,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:09,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:33:09,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829111601] [2025-01-23 22:33:09,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:09,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:33:09,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:09,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:33:09,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:33:09,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:09,204 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:09,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 22:33:09,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:09,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:09,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:09,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:09,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:09,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:09,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:09,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:09,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-23 22:33:09,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 22:33:09,253 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:09,253 INFO L139 ounterexampleChecker]: Examining path program with hash 1808683500, occurence #1 [2025-01-23 22:33:09,253 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:09,253 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:09,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:09,254 INFO L85 PathProgramCache]: Analyzing trace with hash 701034466, now seen corresponding path program 1 times [2025-01-23 22:33:09,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:09,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59008951] [2025-01-23 22:33:09,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:09,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:09,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-23 22:33:09,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-23 22:33:09,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:09,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 22:33:09,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 22:33:09,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-23 22:33:09,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-23 22:33:09,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:09,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 22:33:09,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 22:33:09,368 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 22:33:09,368 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-01-23 22:33:09,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-23 22:33:09,369 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-23 22:33:09,369 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/4) [2025-01-23 22:33:09,369 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 22:33:09,369 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-23 22:33:09,392 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 22:33:09,393 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:33:09,404 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 22:33:09,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2025-01-23 22:33:09,405 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;@23278314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:33:09,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 22:33:10,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:33:10,001 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:10,001 INFO L139 ounterexampleChecker]: Examining path program with hash 1201512367, occurence #1 [2025-01-23 22:33:10,001 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:10,001 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:10,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:10,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2100463868, now seen corresponding path program 1 times [2025-01-23 22:33:10,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:10,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853925046] [2025-01-23 22:33:10,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:10,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:10,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-23 22:33:10,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-23 22:33:10,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:10,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:10,066 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 22:33:10,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:10,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853925046] [2025-01-23 22:33:10,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853925046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:10,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:10,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:33:10,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206915353] [2025-01-23 22:33:10,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:10,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:33:10,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:10,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:33:10,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:33:10,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:10,069 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:10,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 22:33:10,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:10,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:10,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-23 22:33:10,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:33:10,325 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:10,325 INFO L139 ounterexampleChecker]: Examining path program with hash 710458771, occurence #1 [2025-01-23 22:33:10,325 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:10,325 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:10,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:10,326 INFO L85 PathProgramCache]: Analyzing trace with hash -864876319, now seen corresponding path program 1 times [2025-01-23 22:33:10,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:10,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787744190] [2025-01-23 22:33:10,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:10,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:10,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-23 22:33:10,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-23 22:33:10,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:10,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:10,387 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 22:33:10,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:10,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787744190] [2025-01-23 22:33:10,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787744190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:10,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:10,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 22:33:10,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584083142] [2025-01-23 22:33:10,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:10,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 22:33:10,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:10,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 22:33:10,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-23 22:33:10,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:10,390 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:10,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 22:33:10,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:10,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:10,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:10,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:10,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-23 22:33:10,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:33:10,453 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:10,453 INFO L139 ounterexampleChecker]: Examining path program with hash 1787701943, occurence #1 [2025-01-23 22:33:10,453 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:10,453 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:10,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:10,454 INFO L85 PathProgramCache]: Analyzing trace with hash 681427109, now seen corresponding path program 1 times [2025-01-23 22:33:10,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:10,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525169471] [2025-01-23 22:33:10,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:10,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:10,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-23 22:33:10,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-23 22:33:10,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:10,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:10,507 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 22:33:10,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:10,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525169471] [2025-01-23 22:33:10,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525169471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:10,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:10,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:33:10,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648287566] [2025-01-23 22:33:10,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:10,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:33:10,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:10,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:33:10,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:33:10,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:10,509 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:10,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 22:33:10,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:10,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:10,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:10,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:10,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:10,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:10,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-23 22:33:10,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:33:10,668 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:10,668 INFO L139 ounterexampleChecker]: Examining path program with hash 1237284219, occurence #1 [2025-01-23 22:33:10,668 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:10,668 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:10,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:10,668 INFO L85 PathProgramCache]: Analyzing trace with hash -996960604, now seen corresponding path program 1 times [2025-01-23 22:33:10,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:10,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206907548] [2025-01-23 22:33:10,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:10,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:10,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-23 22:33:10,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-23 22:33:10,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:10,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:10,735 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 22:33:10,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:10,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206907548] [2025-01-23 22:33:10,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206907548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:10,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:10,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:33:10,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428649653] [2025-01-23 22:33:10,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:10,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:33:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:10,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:33:10,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:33:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:10,736 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:10,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 22:33:10,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:10,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:10,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:10,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:28,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:28,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:28,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:28,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:28,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 22:33:28,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-23 22:33:28,977 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-23 22:33:28,977 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread3of4ForFork0 was SAFE (1/5) [2025-01-23 22:33:28,979 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:33:28,979 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 22:33:28,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread4of4ForFork0 ======== [2025-01-23 22:33:28,979 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;@23278314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:33:28,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 22:33:28,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:33:28,986 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:28,986 INFO L139 ounterexampleChecker]: Examining path program with hash 352403684, occurence #1 [2025-01-23 22:33:28,986 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:28,986 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:28,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:28,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1769292813, now seen corresponding path program 1 times [2025-01-23 22:33:28,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:28,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994109850] [2025-01-23 22:33:28,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:28,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:28,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-23 22:33:29,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-23 22:33:29,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:29,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:29,077 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 22:33:29,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:29,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994109850] [2025-01-23 22:33:29,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994109850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:29,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:29,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:33:29,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551002273] [2025-01-23 22:33:29,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:29,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:33:29,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:29,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:33:29,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:33:29,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:29,079 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:29,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 22:33:29,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:29,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:29,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-23 22:33:29,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:33:29,138 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:29,138 INFO L139 ounterexampleChecker]: Examining path program with hash -1986894871, occurence #1 [2025-01-23 22:33:29,138 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:29,138 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:29,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:29,139 INFO L85 PathProgramCache]: Analyzing trace with hash -194239584, now seen corresponding path program 1 times [2025-01-23 22:33:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:29,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509867095] [2025-01-23 22:33:29,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:29,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-23 22:33:29,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-23 22:33:29,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:29,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:29,232 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 22:33:29,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:29,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509867095] [2025-01-23 22:33:29,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509867095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:29,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:29,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-23 22:33:29,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66653722] [2025-01-23 22:33:29,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:29,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-23 22:33:29,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:29,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-23 22:33:29,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-23 22:33:29,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:29,233 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:29,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 22:33:29,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:29,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:29,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:29,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:29,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-23 22:33:29,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:33:29,326 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:29,326 INFO L139 ounterexampleChecker]: Examining path program with hash 223135540, occurence #1 [2025-01-23 22:33:29,326 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:29,326 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:29,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:29,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1762480298, now seen corresponding path program 1 times [2025-01-23 22:33:29,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:29,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039445104] [2025-01-23 22:33:29,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:29,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:29,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-23 22:33:29,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-23 22:33:29,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:29,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:29,395 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 22:33:29,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:29,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039445104] [2025-01-23 22:33:29,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039445104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:29,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:29,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:33:29,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25738114] [2025-01-23 22:33:29,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:29,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:33:29,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:29,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:33:29,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:33:29,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:29,396 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:29,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 22:33:29,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:29,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:29,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:29,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:29,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:29,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-23 22:33:29,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:33:29,469 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:29,469 INFO L139 ounterexampleChecker]: Examining path program with hash 454248114, occurence #1 [2025-01-23 22:33:29,469 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:29,469 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:29,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:29,469 INFO L85 PathProgramCache]: Analyzing trace with hash 100033943, now seen corresponding path program 1 times [2025-01-23 22:33:29,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:29,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128354872] [2025-01-23 22:33:29,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:29,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:29,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-23 22:33:29,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-23 22:33:29,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:29,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:29,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 22:33:29,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:29,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128354872] [2025-01-23 22:33:29,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128354872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:29,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:29,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 22:33:29,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270477133] [2025-01-23 22:33:29,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:29,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 22:33:29,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:29,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 22:33:29,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-23 22:33:29,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:29,548 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:29,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 22:33:29,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:29,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:29,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:29,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:29,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:29,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:29,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:29,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:29,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-23 22:33:29,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:33:29,633 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:29,633 INFO L139 ounterexampleChecker]: Examining path program with hash 1335969045, occurence #1 [2025-01-23 22:33:29,633 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:29,633 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:29,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1600919899, now seen corresponding path program 1 times [2025-01-23 22:33:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:29,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875204472] [2025-01-23 22:33:29,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:29,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-23 22:33:29,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-23 22:33:29,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:29,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:29,767 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 22:33:29,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:29,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875204472] [2025-01-23 22:33:29,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875204472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:29,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:29,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:33:29,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813853997] [2025-01-23 22:33:29,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:29,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:33:29,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:29,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:33:29,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:33:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:29,768 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:29,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 22:33:29,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:29,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:29,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:29,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:29,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:53,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:53,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:53,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:53,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:33:53,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:33:53,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 22:33:53,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-23 22:33:53,761 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-23 22:33:53,761 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread4of4ForFork0 was SAFE (2/5) [2025-01-23 22:33:53,763 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:33:53,764 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 22:33:53,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of4ForFork0 ======== [2025-01-23 22:33:53,764 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;@23278314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:33:53,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 22:33:53,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:33:53,766 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:33:53,766 INFO L139 ounterexampleChecker]: Examining path program with hash 1826966629, occurence #1 [2025-01-23 22:33:53,766 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:33:53,766 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:33:53,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:33:53,766 INFO L85 PathProgramCache]: Analyzing trace with hash -47862011, now seen corresponding path program 1 times [2025-01-23 22:33:53,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:33:53,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693214163] [2025-01-23 22:33:53,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:33:53,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:33:53,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-23 22:33:53,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-23 22:33:53,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:33:53,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:33:53,794 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 22:33:53,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:33:53,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693214163] [2025-01-23 22:33:53,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693214163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:33:53,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:33:53,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:33:53,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449587034] [2025-01-23 22:33:53,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:33:53,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:33:53,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:33:53,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:33:53,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:33:53,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:33:53,795 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:33:53,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.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 22:33:53,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:08,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:08,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 22:34:08,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-23 22:34:08,320 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-23 22:34:08,320 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread1of4ForFork0 was SAFE (3/5) [2025-01-23 22:34:08,321 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:34:08,321 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 22:34:08,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread2of4ForFork0 ======== [2025-01-23 22:34:08,321 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;@23278314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:34:08,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 22:34:08,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:34:08,324 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:34:08,324 INFO L139 ounterexampleChecker]: Examining path program with hash -1915729272, occurence #1 [2025-01-23 22:34:08,324 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:34:08,324 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:34:08,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:34:08,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1916896060, now seen corresponding path program 1 times [2025-01-23 22:34:08,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:34:08,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670225979] [2025-01-23 22:34:08,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:34:08,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:34:08,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-23 22:34:08,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-23 22:34:08,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:34:08,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:34:08,354 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 22:34:08,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:34:08,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670225979] [2025-01-23 22:34:08,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670225979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:34:08,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:34:08,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:34:08,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291258711] [2025-01-23 22:34:08,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:34:08,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:34:08,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:34:08,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:34:08,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:34:08,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:08,356 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:34:08,356 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 22:34:08,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:08,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:08,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-23 22:34:08,382 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:34:08,382 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:34:08,382 INFO L139 ounterexampleChecker]: Examining path program with hash 1212183696, occurence #1 [2025-01-23 22:34:08,382 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:34:08,382 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:34:08,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:34:08,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1423045981, now seen corresponding path program 1 times [2025-01-23 22:34:08,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:34:08,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442148558] [2025-01-23 22:34:08,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:34:08,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:34:08,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-23 22:34:08,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-23 22:34:08,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:34:08,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:34:08,413 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 22:34:08,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:34:08,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442148558] [2025-01-23 22:34:08,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442148558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:34:08,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:34:08,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:34:08,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163910523] [2025-01-23 22:34:08,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:34:08,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:34:08,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:34:08,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:34:08,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:34:08,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:08,414 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:34:08,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 22:34:08,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:08,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:22,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:22,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:22,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 22:34:22,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-23 22:34:22,663 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 22:34:22,663 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread2of4ForFork0 was SAFE (4/5) [2025-01-23 22:34:22,664 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:34:22,664 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 22:34:22,664 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 22:34:22,665 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;@23278314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:34:22,665 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 22:34:22,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 22:34:22,668 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:34:22,668 INFO L139 ounterexampleChecker]: Examining path program with hash 972315310, occurence #1 [2025-01-23 22:34:22,668 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:34:22,668 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:34:22,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:34:22,669 INFO L85 PathProgramCache]: Analyzing trace with hash 516675375, now seen corresponding path program 1 times [2025-01-23 22:34:22,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:34:22,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97332339] [2025-01-23 22:34:22,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:34:22,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:34:22,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-23 22:34:22,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-23 22:34:22,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:34:22,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:34:22,715 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 22:34:22,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:34:22,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97332339] [2025-01-23 22:34:22,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97332339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:34:22,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:34:22,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:34:22,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510077271] [2025-01-23 22:34:22,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:34:22,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:34:22,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:34:22,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:34:22,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:34:22,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:22,716 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:34:22,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 22:34:22,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:22,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:22,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-23 22:34:22,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 22:34:22,765 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:34:22,765 INFO L139 ounterexampleChecker]: Examining path program with hash 1334296594, occurence #1 [2025-01-23 22:34:22,765 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:34:22,765 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:34:22,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:34:22,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1980627044, now seen corresponding path program 1 times [2025-01-23 22:34:22,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:34:22,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498774885] [2025-01-23 22:34:22,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:34:22,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:34:22,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-23 22:34:22,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-23 22:34:22,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:34:22,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:34:22,829 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 22:34:22,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:34:22,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498774885] [2025-01-23 22:34:22,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498774885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:34:22,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:34:22,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-23 22:34:22,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967156618] [2025-01-23 22:34:22,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:34:22,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-23 22:34:22,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:34:22,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-23 22:34:22,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-23 22:34:22,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:22,831 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:34:22,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 22:34:22,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:22,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:22,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:22,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:34:22,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-23 22:34:22,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 22:34:22,911 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:34:22,911 INFO L139 ounterexampleChecker]: Examining path program with hash -1641252853, occurence #1 [2025-01-23 22:34:22,911 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:34:22,911 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:34:22,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:34:22,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1526471206, now seen corresponding path program 1 times [2025-01-23 22:34:22,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:34:22,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138570582] [2025-01-23 22:34:22,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:34:22,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:34:22,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-23 22:34:22,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-23 22:34:22,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:34:22,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:34:22,958 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 22:34:22,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:34:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138570582] [2025-01-23 22:34:22,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138570582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:34:22,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:34:22,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:34:22,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342878930] [2025-01-23 22:34:22,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:34:22,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:34:22,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:34:22,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:34:22,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:34:22,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:22,960 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:34:22,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 22:34:22,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:22,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:34:22,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:23,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:34:23,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-23 22:34:23,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 22:34:23,025 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:34:23,025 INFO L139 ounterexampleChecker]: Examining path program with hash 1521382407, occurence #1 [2025-01-23 22:34:23,025 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:34:23,025 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:34:23,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:34:23,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1643358163, now seen corresponding path program 1 times [2025-01-23 22:34:23,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:34:23,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179451556] [2025-01-23 22:34:23,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:34:23,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:34:23,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-23 22:34:23,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-23 22:34:23,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:34:23,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:34:23,079 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 22:34:23,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:34:23,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179451556] [2025-01-23 22:34:23,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179451556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:34:23,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:34:23,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 22:34:23,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095442763] [2025-01-23 22:34:23,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:34:23,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 22:34:23,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:34:23,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 22:34:23,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-23 22:34:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:23,081 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:34:23,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 22:34:23,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:34:23,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:23,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:34:23,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:34:23,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-23 22:34:23,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 22:34:23,164 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:34:23,164 INFO L139 ounterexampleChecker]: Examining path program with hash -478051035, occurence #1 [2025-01-23 22:34:23,164 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:34:23,164 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:34:23,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:34:23,164 INFO L85 PathProgramCache]: Analyzing trace with hash 885750423, now seen corresponding path program 1 times [2025-01-23 22:34:23,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:34:23,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078188026] [2025-01-23 22:34:23,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:34:23,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:34:23,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-23 22:34:23,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-23 22:34:23,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:34:23,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:34:23,224 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 22:34:23,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:34:23,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078188026] [2025-01-23 22:34:23,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078188026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:34:23,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:34:23,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:34:23,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811792765] [2025-01-23 22:34:23,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:34:23,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:34:23,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:34:23,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:34:23,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:34:23,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:23,225 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:34:23,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 22:34:23,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:34:23,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:34:23,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:23,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:34:23,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:34:23,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-23 22:34:23,290 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 22:34:23,290 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:34:23,290 INFO L139 ounterexampleChecker]: Examining path program with hash -1789319986, occurence #1 [2025-01-23 22:34:23,290 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:34:23,290 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:34:23,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:34:23,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1798344294, now seen corresponding path program 1 times [2025-01-23 22:34:23,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:34:23,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417581463] [2025-01-23 22:34:23,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:34:23,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:34:23,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-23 22:34:23,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-23 22:34:23,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:34:23,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:34:23,344 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 22:34:23,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:34:23,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417581463] [2025-01-23 22:34:23,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417581463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:34:23,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:34:23,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:34:23,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190899311] [2025-01-23 22:34:23,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:34:23,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:34:23,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:34:23,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:34:23,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:34:23,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:23,345 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:34:23,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 22:34:23,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:34:23,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:34:23,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:23,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:34:23,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 22:34:23,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:23,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-23 22:34:23,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 22:34:23,402 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:34:23,402 INFO L139 ounterexampleChecker]: Examining path program with hash 134528978, occurence #1 [2025-01-23 22:34:23,402 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:34:23,402 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:34:23,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:34:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1798376007, now seen corresponding path program 1 times [2025-01-23 22:34:23,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:34:23,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952670547] [2025-01-23 22:34:23,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:34:23,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:34:23,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-23 22:34:23,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-23 22:34:23,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:34:23,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 22:34:23,472 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 22:34:23,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-23 22:34:23,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-23 22:34:23,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:34:23,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 22:34:23,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 22:34:23,547 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 22:34:23,547 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-01-23 22:34:23,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-23 22:34:23,548 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-23 22:34:23,548 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (5/5) [2025-01-23 22:34:23,548 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 22:34:23,548 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-23 22:34:23,570 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 22:34:23,571 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:34:23,582 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 22:34:23,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread2of5ForFork0 ======== [2025-01-23 22:34:23,583 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;@23278314, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 22:34:23,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 22:34:24,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:34:24,078 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:34:24,078 INFO L139 ounterexampleChecker]: Examining path program with hash -1907626089, occurence #1 [2025-01-23 22:34:24,078 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:34:24,078 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:34:24,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:34:24,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1775026644, now seen corresponding path program 1 times [2025-01-23 22:34:24,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:34:24,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695676597] [2025-01-23 22:34:24,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:34:24,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:34:24,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-23 22:34:24,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-23 22:34:24,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:34:24,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:34:24,105 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 22:34:24,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:34:24,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695676597] [2025-01-23 22:34:24,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695676597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:34:24,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:34:24,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:34:24,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528129059] [2025-01-23 22:34:24,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:34:24,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:34:24,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:34:24,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:34:24,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:34:24,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:24,106 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:34:24,106 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 22:34:24,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:24,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:24,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-23 22:34:24,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 22:34:24,313 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 22:34:24,313 INFO L139 ounterexampleChecker]: Examining path program with hash 1301590681, occurence #1 [2025-01-23 22:34:24,313 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 22:34:24,313 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 22:34:24,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 22:34:24,313 INFO L85 PathProgramCache]: Analyzing trace with hash 747303831, now seen corresponding path program 1 times [2025-01-23 22:34:24,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 22:34:24,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810459903] [2025-01-23 22:34:24,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 22:34:24,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 22:34:24,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-23 22:34:24,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-23 22:34:24,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 22:34:24,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 22:34:24,341 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 22:34:24,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 22:34:24,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810459903] [2025-01-23 22:34:24,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810459903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 22:34:24,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 22:34:24,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 22:34:24,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451386095] [2025-01-23 22:34:24,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 22:34:24,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 22:34:24,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 22:34:24,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 22:34:24,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 22:34:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 22:34:24,342 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 22:34:24,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 22:34:24,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 22:34:24,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.