./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NONE --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/weaver/mult-dist.wvr.c -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 c31f1603fd15e011308b2e8fcd1cd45b23f0b00ac0b8b466c4f212460081639c --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NONE --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-23 11:25:17,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 11:25:17,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-23 11:25:17,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 11:25:17,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 11:25:17,893 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 11:25:17,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 11:25:17,895 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 11:25:17,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 11:25:17,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 11:25:17,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 11:25:17,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 11:25:17,897 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 11:25:17,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 11:25:17,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 11:25:17,898 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 11:25:17,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-23 11:25:17,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 11:25:17,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 11:25:17,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 11:25:17,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 11:25:17,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 11:25:17,898 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 11:25:17,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 11:25:17,899 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 11:25:17,899 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 11:25:17,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 11:25:17,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 11:25:17,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 11:25:17,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 11:25:17,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 11:25:17,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 11:25:17,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 11:25:17,900 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 11:25:17,900 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 11:25:17,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 11:25:17,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-23 11:25:17,901 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 11:25:17,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-23 11:25:17,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 11:25:17,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 11:25:17,901 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 11:25:17,901 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 11:25:17,901 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 -> c31f1603fd15e011308b2e8fcd1cd45b23f0b00ac0b8b466c4f212460081639c 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 -> NONE [2025-01-23 11:25:18,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 11:25:18,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 11:25:18,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 11:25:18,245 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 11:25:18,245 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 11:25:18,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c [2025-01-23 11:25:19,562 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/0cb1edddf/154281d6dcb646099b7cf22d02240f82/FLAG758fbe81e [2025-01-23 11:25:19,775 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 11:25:19,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2025-01-23 11:25:19,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/0cb1edddf/154281d6dcb646099b7cf22d02240f82/FLAG758fbe81e [2025-01-23 11:25:19,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/0cb1edddf/154281d6dcb646099b7cf22d02240f82 [2025-01-23 11:25:19,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 11:25:19,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 11:25:19,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 11:25:19,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 11:25:19,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 11:25:19,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 11:25:19" (1/1) ... [2025-01-23 11:25:19,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@563a55f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:25:19, skipping insertion in model container [2025-01-23 11:25:19,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 11:25:19" (1/1) ... [2025-01-23 11:25:19,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 11:25:19,968 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/weaver/mult-dist.wvr.c[2155,2168] [2025-01-23 11:25:19,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 11:25:19,982 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 11:25:20,047 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/weaver/mult-dist.wvr.c[2155,2168] [2025-01-23 11:25:20,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 11:25:20,064 INFO L204 MainTranslator]: Completed translation [2025-01-23 11:25:20,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:25:20 WrapperNode [2025-01-23 11:25:20,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 11:25:20,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 11:25:20,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 11:25:20,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 11:25:20,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:25:20" (1/1) ... [2025-01-23 11:25:20,077 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:25:20" (1/1) ... [2025-01-23 11:25:20,092 INFO L138 Inliner]: procedures = 21, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2025-01-23 11:25:20,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 11:25:20,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 11:25:20,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 11:25:20,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 11:25:20,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:25:20" (1/1) ... [2025-01-23 11:25:20,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:25:20" (1/1) ... [2025-01-23 11:25:20,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:25:20" (1/1) ... [2025-01-23 11:25:20,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:25:20" (1/1) ... [2025-01-23 11:25:20,109 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:25:20" (1/1) ... [2025-01-23 11:25:20,113 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:25:20" (1/1) ... [2025-01-23 11:25:20,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:25:20" (1/1) ... [2025-01-23 11:25:20,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:25:20" (1/1) ... [2025-01-23 11:25:20,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:25:20" (1/1) ... [2025-01-23 11:25:20,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 11:25:20,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 11:25:20,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 11:25:20,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 11:25:20,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:25:20" (1/1) ... [2025-01-23 11:25:20,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 11:25:20,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 11:25:20,155 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 11:25:20,158 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 11:25:20,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 11:25:20,182 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-23 11:25:20,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-23 11:25:20,182 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-23 11:25:20,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-23 11:25:20,182 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-23 11:25:20,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-23 11:25:20,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-23 11:25:20,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 11:25:20,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 11:25:20,183 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 11:25:20,265 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 11:25:20,267 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 11:25:20,401 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 11:25:20,401 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 11:25:20,527 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 11:25:20,527 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-23 11:25:20,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 11:25:20 BoogieIcfgContainer [2025-01-23 11:25:20,527 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 11:25:20,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 11:25:20,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 11:25:20,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 11:25:20,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 11:25:19" (1/3) ... [2025-01-23 11:25:20,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e4d65c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 11:25:20, skipping insertion in model container [2025-01-23 11:25:20,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:25:20" (2/3) ... [2025-01-23 11:25:20,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e4d65c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 11:25:20, skipping insertion in model container [2025-01-23 11:25:20,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 11:25:20" (3/3) ... [2025-01-23 11:25:20,538 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2025-01-23 11:25:20,552 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 11:25:20,554 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-dist.wvr.c that has 4 procedures, 23 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-23 11:25:20,554 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 11:25:20,614 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-23 11:25:20,653 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 11:25:20,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 11:25:20,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 11:25:20,658 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 11:25:20,661 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 11:25:20,729 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 11:25:20,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 11:25:20,746 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;@60ef4741, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 11:25:20,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-23 11:25:21,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 11:25:21,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 11:25:21,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2022854732, now seen corresponding path program 1 times [2025-01-23 11:25:21,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 11:25:21,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585594422] [2025-01-23 11:25:21,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 11:25:21,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 11:25:21,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-23 11:25:21,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-23 11:25:21,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 11:25:21,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 11:25:22,081 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 11:25:22,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 11:25:22,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585594422] [2025-01-23 11:25:22,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585594422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 11:25:22,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 11:25:22,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-23 11:25:22,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667774616] [2025-01-23 11:25:22,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 11:25:22,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-23 11:25:22,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 11:25:22,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-23 11:25:22,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-23 11:25:22,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:25:22,109 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 11:25:22,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 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 11:25:22,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:25:22,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 11:25:22,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-23 11:25:22,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 11:25:22,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 11:25:22,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2084985710, now seen corresponding path program 1 times [2025-01-23 11:25:22,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 11:25:22,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631206711] [2025-01-23 11:25:22,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 11:25:22,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 11:25:22,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-23 11:25:22,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-23 11:25:22,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 11:25:22,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 11:25:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 11:25:23,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 11:25:23,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631206711] [2025-01-23 11:25:23,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631206711] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 11:25:23,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466429720] [2025-01-23 11:25:23,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 11:25:23,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 11:25:23,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 11:25:23,082 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-23 11:25:23,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-23 11:25:23,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-23 11:25:23,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-23 11:25:23,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 11:25:23,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 11:25:23,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-23 11:25:23,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 11:25:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 11:25:23,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 11:25:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 11:25:32,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466429720] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 11:25:32,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-23 11:25:32,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2025-01-23 11:25:32,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579633963] [2025-01-23 11:25:32,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-23 11:25:32,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-23 11:25:32,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 11:25:32,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-23 11:25:32,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=703, Unknown=3, NotChecked=0, Total=870 [2025-01-23 11:25:32,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:25:32,381 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 11:25:32,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6) internal successors, (48), 30 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 11:25:32,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 11:25:32,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:25:54,016 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse18 (mod c_~b~0 4294967296)) (.cse8 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse9 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse17 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse15 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse7 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse16 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296))) (let ((.cse4 (+ 4294967297 .cse16)) (.cse0 (+ 4294967294 .cse7)) (.cse5 (+ .cse17 .cse15)) (.cse3 (+ .cse8 .cse9)) (.cse11 (< .cse9 .cse18)) (.cse12 (< .cse18 (+ .cse1 1))) (.cse10 (mod c_~a~0 4294967296)) (.cse13 (< .cse16 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse2 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse14 (+ .cse17 .cse8)) (.cse6 (+ .cse16 1))) (and (or (< .cse0 (+ .cse1 .cse2)) (< .cse3 .cse4)) (or (< .cse5 .cse6) (< .cse7 (+ 2 .cse8 .cse9))) (or (< .cse0 .cse3) (< .cse5 .cse4)) (or (< .cse8 .cse10) .cse11 (< .cse10 (+ .cse2 1)) .cse12 .cse13) (or (< .cse14 .cse4) (< .cse0 (+ .cse2 .cse9))) (or (< .cse5 4294967297) (< 4294967295 .cse3)) (or (< .cse3 .cse6) (< .cse7 (+ .cse1 2 .cse2))) (or .cse11 (< .cse2 .cse10) .cse12 (< .cse10 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1)) .cse13) (or (< .cse7 (+ 2 .cse2 .cse9)) (< .cse14 .cse6)) (< .cse15 4294967295)))) is different from false [2025-01-23 11:25:56,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:25:59,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:26:04,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:26:06,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 11:26:06,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-23 11:26:06,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-23 11:26:06,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 11:26:06,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-23 11:26:06,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 11:26:06,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1230957004, now seen corresponding path program 2 times [2025-01-23 11:26:06,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 11:26:06,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244552745] [2025-01-23 11:26:06,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 11:26:06,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 11:26:06,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-23 11:26:06,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-23 11:26:06,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-23 11:26:06,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 11:26:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 11:26:07,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 11:26:07,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244552745] [2025-01-23 11:26:07,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244552745] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 11:26:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499827841] [2025-01-23 11:26:07,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 11:26:07,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 11:26:07,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 11:26:07,990 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-23 11:26:07,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-23 11:26:08,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-23 11:26:08,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-23 11:26:08,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-23 11:26:08,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 11:26:08,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-23 11:26:08,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 11:26:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 11:26:08,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 11:26:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 11:26:25,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499827841] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 11:26:25,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-23 11:26:25,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 49 [2025-01-23 11:26:25,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078804855] [2025-01-23 11:26:25,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-23 11:26:25,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-01-23 11:26:25,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 11:26:25,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-23 11:26:25,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1926, Unknown=4, NotChecked=0, Total=2352 [2025-01-23 11:26:25,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:26:25,936 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 11:26:25,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 0 states have call successors, (0), 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 11:26:25,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 11:26:25,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2025-01-23 11:26:25,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:27:42,943 WARN L286 SmtUtils]: Spent 1.05m on a formula simplification. DAG size of input: 106 DAG size of output: 106 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 11:30:39,747 WARN L286 SmtUtils]: Spent 2.70m on a formula simplification. DAG size of input: 180 DAG size of output: 123 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 11:31:59,820 WARN L286 SmtUtils]: Spent 1.09m on a formula simplification. DAG size of input: 106 DAG size of output: 106 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 11:32:02,162 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse27 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse45 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse13 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse36 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse37 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse9 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse10 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse23 (mod c_~a~0 4294967296)) (.cse35 (mod c_~b~0 4294967296)) (.cse22 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse29 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse14 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse46 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse7 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse0 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse18 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse47 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse44 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse31 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296))) (let ((.cse1 (+ 2 .cse44 .cse31)) (.cse12 (+ 4294967297 .cse47)) (.cse8 (+ 4294967294 .cse18)) (.cse6 (+ .cse0 1)) (.cse20 (+ .cse7 4294967294)) (.cse30 (+ .cse14 .cse46)) (.cse21 (+ .cse0 4294967297)) (.cse11 (+ .cse22 .cse29)) (.cse24 (< .cse29 .cse35)) (.cse33 (< .cse10 .cse23)) (.cse25 (< .cse35 (+ .cse9 1))) (.cse34 (< .cse23 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1))) (.cse26 (< .cse47 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse17 (+ .cse47 1)) (.cse28 (+ .cse37 .cse22)) (.cse3 (+ .cse36 1)) (.cse32 (+ .cse13 .cse31)) (.cse38 (+ .cse44 .cse45)) (.cse4 (+ .cse37 2 .cse45)) (.cse42 (+ .cse36 4294967297)) (.cse43 (+ .cse0 4294967294)) (.cse5 (+ .cse44 .cse31)) (.cse40 (+ 4294967297 .cse18)) (.cse41 (+ .cse36 4294967294)) (.cse19 (+ 2 .cse22 .cse29)) (.cse16 (+ .cse37 .cse45)) (.cse39 (+ .cse18 1)) (.cse2 (+ .cse13 .cse14)) (.cse15 (+ .cse27 .cse46))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse0 .cse4) (< .cse5 .cse3)) (or (< .cse2 .cse6) (< .cse7 .cse1)) (or (< .cse8 (+ .cse9 .cse10)) (< .cse11 .cse12)) (or (< .cse7 (+ .cse13 2 .cse14)) (< .cse15 .cse6)) (or (< .cse16 .cse17) (< .cse18 .cse19)) (or (< .cse20 .cse5) (< .cse2 .cse21)) (or (< .cse8 .cse11) (< .cse16 .cse12)) (or (< .cse22 .cse23) .cse24 (< .cse23 (+ .cse10 1)) .cse25 .cse26) (< .cse27 4294967295) (or (< .cse20 .cse2) (< .cse15 .cse21)) (or (< .cse28 .cse12) (< .cse8 (+ .cse10 .cse29))) (or (< .cse30 .cse6) (< .cse7 (+ .cse13 2 .cse31))) (or (< .cse20 .cse32) (< .cse30 .cse21)) (or .cse33 .cse34 (< .cse9 .cse35) .cse26) (or (< .cse36 (+ .cse37 2 .cse22)) (< .cse38 .cse39)) (or (< .cse16 .cse40) (< .cse41 .cse11)) (or (< .cse11 .cse17) (< .cse18 (+ .cse9 2 .cse10))) (or .cse24 .cse33 .cse25 .cse34 .cse26) (or (< .cse2 .cse42) (< .cse43 .cse5)) (or (< .cse15 4294967300) (< 4294967298 .cse2)) (or (< .cse18 (+ 2 .cse10 .cse29)) (< .cse28 .cse17)) (or (< .cse38 .cse40) (< .cse41 .cse28)) (or (< .cse32 .cse3) (< .cse0 (+ 2 .cse44 .cse45))) (or (< .cse32 .cse42) (< .cse43 .cse38)) (or (< .cse36 .cse4) (< .cse5 .cse39)) (or (< .cse5 .cse42) (< .cse43 .cse16)) (or (< .cse5 .cse40) (< .cse41 .cse16)) (or (< .cse36 .cse19) (< .cse16 .cse39)) (or (< 2 .cse2) (< .cse15 4))))) is different from false [2025-01-23 11:33:01,151 WARN L286 SmtUtils]: Spent 49.17s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 11:33:03,315 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse27 (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296)) (.cse42 (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296)) (.cse13 (mod (+ c_thread2Thread1of1ForFork0_~i~1 4) 4294967296)) (.cse33 (mod (+ 2 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse34 (mod (+ c_thread2Thread1of1ForFork0_~i~1 2) 4294967296)) (.cse9 (mod c_thread2Thread1of1ForFork0_~i~1 4294967296)) (.cse45 (mod c_~b~0 4294967296)) (.cse22 (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296)) (.cse29 (mod (+ c_thread2Thread1of1ForFork0_~i~1 1) 4294967296)) (.cse14 (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296)) (.cse43 (mod (+ c_thread2Thread1of1ForFork0_~i~1 5) 4294967296)) (.cse7 (mod (+ c_thread3Thread1of1ForFork1_~i~2 4) 4294967296)) (.cse0 (mod (+ 3 c_thread3Thread1of1ForFork1_~i~2) 4294967296)) (.cse18 (mod (+ c_thread3Thread1of1ForFork1_~i~2 1) 4294967296)) (.cse44 (mod c_thread3Thread1of1ForFork1_~i~2 4294967296)) (.cse41 (mod (+ c_thread2Thread1of1ForFork0_~i~1 3) 4294967296)) (.cse31 (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296))) (let ((.cse1 (+ 2 .cse41 .cse31)) (.cse12 (+ 4294967297 .cse44)) (.cse8 (+ 4294967294 .cse18)) (.cse6 (+ .cse0 1)) (.cse20 (+ .cse7 4294967294)) (.cse30 (+ .cse14 .cse43)) (.cse21 (+ .cse0 4294967297)) (.cse11 (+ .cse22 .cse29)) (.cse24 (< .cse29 .cse45)) (.cse25 (< .cse45 (+ .cse9 1))) (.cse23 (mod c_~a~0 4294967296)) (.cse26 (< .cse44 (mod (+ c_~b~0 c_~a~0) 4294967296))) (.cse10 (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296)) (.cse17 (+ .cse44 1)) (.cse28 (+ .cse34 .cse22)) (.cse3 (+ .cse33 1)) (.cse32 (+ .cse13 .cse31)) (.cse35 (+ .cse41 .cse42)) (.cse4 (+ .cse34 2 .cse42)) (.cse39 (+ .cse33 4294967297)) (.cse40 (+ .cse0 4294967294)) (.cse5 (+ .cse41 .cse31)) (.cse37 (+ 4294967297 .cse18)) (.cse38 (+ .cse33 4294967294)) (.cse19 (+ 2 .cse22 .cse29)) (.cse16 (+ .cse34 .cse42)) (.cse36 (+ .cse18 1)) (.cse2 (+ .cse13 .cse14)) (.cse15 (+ .cse27 .cse43))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse0 .cse4) (< .cse5 .cse3)) (or (< .cse2 .cse6) (< .cse7 .cse1)) (or (< .cse8 (+ .cse9 .cse10)) (< .cse11 .cse12)) (or (< .cse7 (+ .cse13 2 .cse14)) (< .cse15 .cse6)) (or (< .cse16 .cse17) (< .cse18 .cse19)) (or (< .cse20 .cse5) (< .cse2 .cse21)) (or (< .cse8 .cse11) (< .cse16 .cse12)) (or (< .cse22 .cse23) .cse24 (< .cse23 (+ .cse10 1)) .cse25 .cse26) (< .cse27 4294967295) (or (< .cse20 .cse2) (< .cse15 .cse21)) (or (< .cse28 .cse12) (< .cse8 (+ .cse10 .cse29))) (or (< .cse30 .cse6) (< .cse7 (+ .cse13 2 .cse31))) (or (< .cse20 .cse32) (< .cse30 .cse21)) (or (< .cse33 (+ .cse34 2 .cse22)) (< .cse35 .cse36)) (or (< .cse16 .cse37) (< .cse38 .cse11)) (or (< .cse11 .cse17) (< .cse18 (+ .cse9 2 .cse10))) (or .cse24 (< .cse10 .cse23) .cse25 (< .cse23 (+ (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) 1)) .cse26) (or (< .cse2 .cse39) (< .cse40 .cse5)) (or (< .cse15 4294967300) (< 4294967298 .cse2)) (or (< .cse18 (+ 2 .cse10 .cse29)) (< .cse28 .cse17)) (or (< .cse35 .cse37) (< .cse38 .cse28)) (or (< .cse32 .cse3) (< .cse0 (+ 2 .cse41 .cse42))) (or (< .cse32 .cse39) (< .cse40 .cse35)) (or (< .cse33 .cse4) (< .cse5 .cse36)) (or (< .cse5 .cse39) (< .cse40 .cse16)) (or (< .cse5 .cse37) (< .cse38 .cse16)) (or (< .cse33 .cse19) (< .cse16 .cse36)) (or (< 2 .cse2) (< .cse15 4))))) is different from false [2025-01-23 11:38:10,354 WARN L286 SmtUtils]: Spent 4.43m on a formula simplification. DAG size of input: 194 DAG size of output: 193 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 11:38:14,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:38:19,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:38:50,511 WARN L286 SmtUtils]: Spent 23.13s on a formula simplification. DAG size of input: 115 DAG size of output: 114 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 11:38:52,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:38:56,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:38:58,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:39:00,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:39:02,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:39:04,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:39:06,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:39:08,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:39:10,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:39:12,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15