./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/mult-comm.wvr.c --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis SLEEP_NEW_STATES --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 42d87675 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/weaver/mult-comm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 de93f11842753a9f5cde98724d1851736862f745073786263bfd177abe6c2376 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis SLEEP_NEW_STATES --- Real Ultimate output --- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 00:57:15,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 00:57:15,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 00:57:15,426 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 00:57:15,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 00:57:15,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 00:57:15,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 00:57:15,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 00:57:15,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 00:57:15,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 00:57:15,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 00:57:15,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 00:57:15,452 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 00:57:15,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 00:57:15,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 00:57:15,452 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 00:57:15,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 00:57:15,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 00:57:15,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 00:57:15,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 00:57:15,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 00:57:15,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 00:57:15,453 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 00:57:15,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 00:57:15,453 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 00:57:15,453 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 00:57:15,454 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 00:57:15,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 00:57:15,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 00:57:15,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 00:57:15,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 00:57:15,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 00:57:15,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 00:57:15,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 00:57:15,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 00:57:15,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 00:57:15,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 00:57:15,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 00:57:15,454 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 00:57:15,454 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 00:57:15,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 00:57:15,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 00:57:15,455 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 00:57:15,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 00:57:15,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 00:57:15,455 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 00:57:15,455 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 00:57:15,455 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/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 -> de93f11842753a9f5cde98724d1851736862f745073786263bfd177abe6c2376 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> SLEEP_NEW_STATES [2025-04-25 00:57:15,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 00:57:15,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 00:57:15,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 00:57:15,695 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 00:57:15,696 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 00:57:15,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/mult-comm.wvr.c [2025-04-25 00:57:16,999 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/426c24b6c/162f868740194e16bd39ded24bd455e9/FLAGa448a8d59 [2025-04-25 00:57:17,193 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 00:57:17,194 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-comm.wvr.c [2025-04-25 00:57:17,200 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/426c24b6c/162f868740194e16bd39ded24bd455e9/FLAGa448a8d59 [2025-04-25 00:57:18,000 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/426c24b6c/162f868740194e16bd39ded24bd455e9 [2025-04-25 00:57:18,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 00:57:18,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 00:57:18,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 00:57:18,003 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 00:57:18,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 00:57:18,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 12:57:18" (1/1) ... [2025-04-25 00:57:18,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bbd5f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:57:18, skipping insertion in model container [2025-04-25 00:57:18,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 12:57:18" (1/1) ... [2025-04-25 00:57:18,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 00:57:18,176 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-comm.wvr.c[1936,1949] [2025-04-25 00:57:18,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 00:57:18,188 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 00:57:18,219 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-comm.wvr.c[1936,1949] [2025-04-25 00:57:18,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 00:57:18,232 INFO L204 MainTranslator]: Completed translation [2025-04-25 00:57:18,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:57:18 WrapperNode [2025-04-25 00:57:18,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 00:57:18,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 00:57:18,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 00:57:18,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 00:57:18,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:57:18" (1/1) ... [2025-04-25 00:57:18,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:57:18" (1/1) ... [2025-04-25 00:57:18,256 INFO L138 Inliner]: procedures = 20, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2025-04-25 00:57:18,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 00:57:18,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 00:57:18,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 00:57:18,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 00:57:18,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:57:18" (1/1) ... [2025-04-25 00:57:18,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:57:18" (1/1) ... [2025-04-25 00:57:18,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:57:18" (1/1) ... [2025-04-25 00:57:18,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:57:18" (1/1) ... [2025-04-25 00:57:18,271 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:57:18" (1/1) ... [2025-04-25 00:57:18,271 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:57:18" (1/1) ... [2025-04-25 00:57:18,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:57:18" (1/1) ... [2025-04-25 00:57:18,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:57:18" (1/1) ... [2025-04-25 00:57:18,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:57:18" (1/1) ... [2025-04-25 00:57:18,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 00:57:18,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 00:57:18,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 00:57:18,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 00:57:18,284 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:57:18" (1/1) ... [2025-04-25 00:57:18,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 00:57:18,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 00:57:18,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-25 00:57:18,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-25 00:57:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 00:57:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-25 00:57:18,329 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-25 00:57:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-25 00:57:18,330 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-25 00:57:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-25 00:57:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 00:57:18,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 00:57:18,331 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 00:57:18,394 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 00:57:18,396 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 00:57:18,512 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 00:57:18,512 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 00:57:18,601 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 00:57:18,601 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 00:57:18,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:57:18 BoogieIcfgContainer [2025-04-25 00:57:18,602 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 00:57:18,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 00:57:18,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 00:57:18,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 00:57:18,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.04 12:57:18" (1/3) ... [2025-04-25 00:57:18,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff832ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 12:57:18, skipping insertion in model container [2025-04-25 00:57:18,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 12:57:18" (2/3) ... [2025-04-25 00:57:18,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff832ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 12:57:18, skipping insertion in model container [2025-04-25 00:57:18,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 12:57:18" (3/3) ... [2025-04-25 00:57:18,609 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2025-04-25 00:57:18,617 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 00:57:18,620 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-comm.wvr.c that has 3 procedures, 17 locations, 16 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-25 00:57:18,620 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 00:57:18,665 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-25 00:57:18,696 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 00:57:18,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 00:57:18,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 00:57:18,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-25 00:57:18,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-25 00:57:18,747 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 00:57:18,752 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 00:57:18,757 INFO L340 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;@610a1404, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 00:57:18,757 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-25 00:57:18,778 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 00:57:18,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:57:18,784 INFO L85 PathProgramCache]: Analyzing trace with hash -211985893, now seen corresponding path program 1 times [2025-04-25 00:57:18,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:57:18,790 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793176098] [2025-04-25 00:57:18,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:57:18,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:57:18,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-25 00:57:18,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-25 00:57:18,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:57:18,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:57:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 00:57:19,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:57:19,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793176098] [2025-04-25 00:57:19,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793176098] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 00:57:19,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 00:57:19,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-25 00:57:19,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723758462] [2025-04-25 00:57:19,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 00:57:19,411 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-25 00:57:19,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:57:19,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-25 00:57:19,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-25 00:57:19,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:57:19,427 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:57:19,427 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-04-25 00:57:19,428 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:57:19,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 00:57:19,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 00:57:19,517 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 00:57:19,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:57:19,518 INFO L85 PathProgramCache]: Analyzing trace with hash -341022696, now seen corresponding path program 1 times [2025-04-25 00:57:19,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:57:19,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779996246] [2025-04-25 00:57:19,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:57:19,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:57:19,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-25 00:57:19,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-25 00:57:19,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:57:19,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:57:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 00:57:20,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:57:20,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779996246] [2025-04-25 00:57:20,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779996246] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 00:57:20,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341428349] [2025-04-25 00:57:20,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 00:57:20,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 00:57:20,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 00:57:20,487 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 00:57:20,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-25 00:57:20,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-25 00:57:20,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-25 00:57:20,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 00:57:20,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:57:20,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-25 00:57:20,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 00:57:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 00:57:20,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 00:57:25,391 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_2~0 4294967296))) (let ((.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse0 (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1)) (.cse4 (+ (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse1)) (.cse3 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296))) (and (forall ((v_z_5 Int)) (or (< v_z_5 .cse0) (< (mod (+ (* 2 v_z_5) c_~x_1~0) 4294967296) (+ 2 .cse1 .cse2)) (< .cse3 v_z_5))) (forall ((v_z_5 Int)) (let ((.cse5 (mod (+ (* 2 v_z_5) c_~x_1~0) 4294967296))) (or (< .cse4 (+ .cse5 1)) (< v_z_5 .cse0) (< .cse3 v_z_5) (< (+ .cse5 4294967294) (+ .cse1 .cse2))))) (forall ((v_z_5 Int)) (or (< v_z_5 .cse0) (< .cse4 (+ (mod (+ (* 2 v_z_5) c_~x_1~0) 4294967296) 4294967297)) (< .cse3 v_z_5)))))) is different from false [2025-04-25 00:57:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-04-25 00:57:25,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341428349] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 00:57:25,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 00:57:25,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2025-04-25 00:57:25,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241429921] [2025-04-25 00:57:25,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 00:57:25,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-25 00:57:25,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:57:25,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-25 00:57:25,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=301, Unknown=1, NotChecked=36, Total=420 [2025-04-25 00:57:25,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:57:25,628 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:57:25,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 20 states have internal predecessors, (36), 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-04-25 00:57:25,628 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 00:57:25,628 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:57:26,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 00:57:26,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-25 00:57:26,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-25 00:57:26,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-04-25 00:57:26,661 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 00:57:26,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:57:26,662 INFO L85 PathProgramCache]: Analyzing trace with hash 173912658, now seen corresponding path program 2 times [2025-04-25 00:57:26,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:57:26,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908575209] [2025-04-25 00:57:26,662 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 00:57:26,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:57:26,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-25 00:57:26,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-25 00:57:26,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 00:57:26,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:57:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 00:57:27,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:57:27,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908575209] [2025-04-25 00:57:27,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908575209] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 00:57:27,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061008190] [2025-04-25 00:57:27,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 00:57:27,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 00:57:27,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 00:57:27,553 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 00:57:27,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-25 00:57:27,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-25 00:57:27,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-25 00:57:27,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 00:57:27,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:57:27,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-25 00:57:27,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 00:57:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 00:57:28,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 00:57:41,779 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse5 (+ (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 1)) (.cse4 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_14 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse2 (+ v_z_10 .cse6))) (or (< .cse0 .cse1) (< .cse2 4294967296) (< .cse3 .cse0) (< 4294967295 v_z_10) (< .cse4 v_z_14) (< v_z_14 .cse5) (= .cse2 (+ (mod (+ (* v_z_14 4) c_~x_1~0) 4294967296) 4294967296))))) (forall ((v_z_15 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse7 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse8 (+ v_z_10 .cse6))) (or (< .cse7 .cse1) (= (mod (+ c_~x_1~0 (* v_z_15 4)) 4294967296) .cse8) (< v_z_10 0) (< .cse3 .cse7) (< 4294967295 .cse8) (< .cse4 v_z_15) (< v_z_15 .cse5)))) (forall ((v_z_17 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse9 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse11 (+ v_z_10 .cse6)) (.cse10 (mod (+ (* v_z_17 4) c_~x_1~0) 4294967296))) (or (< .cse9 .cse1) (< v_z_10 0) (< .cse3 .cse9) (< 4294967295 v_z_10) (= (+ .cse10 4294967296) .cse11) (< v_z_17 .cse5) (= .cse11 .cse10) (< .cse4 v_z_17)))))) is different from false [2025-04-25 00:57:46,118 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse1 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse8 (+ .cse4 4294967296)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse3 (+ v_z_10 .cse5))) (or (< .cse0 .cse1) (< v_z_10 0) (< .cse2 .cse0) (< 4294967295 .cse3) (= .cse4 .cse3)))) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse6 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse7 (+ v_z_10 .cse5))) (or (< .cse6 .cse1) (< v_z_10 0) (< .cse2 .cse6) (= .cse7 .cse8) (< 4294967295 v_z_10) (= .cse4 .cse7)))) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse9 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse10 (+ v_z_10 .cse5))) (or (< .cse9 .cse1) (< .cse10 4294967296) (< .cse2 .cse9) (= .cse10 .cse8) (< 4294967295 v_z_10))))))) is different from false [2025-04-25 00:57:50,340 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse4 (+ .cse1 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ v_z_10 .cse2))) (or (< v_z_10 0) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)) (< 4294967295 .cse0) (= .cse1 .cse0)))) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse3 (+ v_z_10 .cse2))) (or (< v_z_10 0) (= .cse3 .cse4) (< 4294967295 v_z_10) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)) (= .cse1 .cse3)))) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse5 (+ v_z_10 .cse2))) (or (< .cse5 4294967296) (= .cse5 .cse4) (< 4294967295 v_z_10) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)))))))) is different from false [2025-04-25 00:57:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-04-25 00:57:50,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061008190] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 00:57:50,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 00:57:50,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2025-04-25 00:57:50,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576732991] [2025-04-25 00:57:50,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 00:57:50,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-25 00:57:50,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 00:57:50,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-25 00:57:50,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=727, Unknown=5, NotChecked=174, Total=1056 [2025-04-25 00:57:50,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:57:50,383 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 00:57:50,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 32 states have internal predecessors, (47), 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-04-25 00:57:50,384 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 00:57:50,384 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-25 00:57:50,384 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 00:57:54,589 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse4 (+ .cse1 4294967296)) (.cse2 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ v_z_10 .cse2))) (or (< v_z_10 0) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)) (< 4294967295 .cse0) (= .cse1 .cse0)))) (= c_~x_2~0 0) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse3 (+ v_z_10 .cse2))) (or (< v_z_10 0) (= .cse3 .cse4) (< 4294967295 v_z_10) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)) (= .cse1 .cse3)))) (= c_~x_1~0 0) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse5 (+ v_z_10 .cse2))) (or (< .cse5 4294967296) (= .cse5 .cse4) (< 4294967295 v_z_10) (not (= (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)) 4)))))))) is different from false [2025-04-25 00:57:58,816 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ c_~x_1~0 12) 4294967296))) (let ((.cse1 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse2 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse8 (+ .cse4 4294967296)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse3 (+ v_z_10 .cse5))) (or (< .cse0 .cse1) (< v_z_10 0) (< .cse2 .cse0) (< 4294967295 .cse3) (= .cse4 .cse3)))) (= c_~x_2~0 0) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse6 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse7 (+ v_z_10 .cse5))) (or (< .cse6 .cse1) (< v_z_10 0) (< .cse2 .cse6) (= .cse7 .cse8) (< 4294967295 v_z_10) (= .cse4 .cse7)))) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~x_1~0 0) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse9 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse10 (+ v_z_10 .cse5))) (or (< .cse9 .cse1) (< .cse10 4294967296) (< .cse2 .cse9) (= .cse10 .cse8) (< 4294967295 v_z_10))))))) is different from false [2025-04-25 00:58:02,843 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse5 (+ (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 1)) (.cse4 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_14 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse0 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse2 (+ v_z_10 .cse6))) (or (< .cse0 .cse1) (< .cse2 4294967296) (< .cse3 .cse0) (< 4294967295 v_z_10) (< .cse4 v_z_14) (< v_z_14 .cse5) (= .cse2 (+ (mod (+ (* v_z_14 4) c_~x_1~0) 4294967296) 4294967296))))) (= c_~x_2~0 0) (forall ((v_z_15 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse7 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse8 (+ v_z_10 .cse6))) (or (< .cse7 .cse1) (= (mod (+ c_~x_1~0 (* v_z_15 4)) 4294967296) .cse8) (< v_z_10 0) (< .cse3 .cse7) (< 4294967295 .cse8) (< .cse4 v_z_15) (< v_z_15 .cse5)))) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_~x_1~0 0) (forall ((v_z_17 Int) (v_z_10 Int) (v_y_10 Int)) (let ((.cse9 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10))) (.cse11 (+ v_z_10 .cse6)) (.cse10 (mod (+ (* v_z_17 4) c_~x_1~0) 4294967296))) (or (< .cse9 .cse1) (< v_z_10 0) (< .cse3 .cse9) (< 4294967295 v_z_10) (= (+ .cse10 4294967296) .cse11) (< v_z_17 .cse5) (= .cse11 .cse10) (< .cse4 v_z_17)))))) is different from false [2025-04-25 00:59:00,321 WARN L286 SmtUtils]: Spent 36.67s on a formula simplification. DAG size of input: 57 DAG size of output: 36 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-25 00:59:04,384 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-25 00:59:09,249 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-25 00:59:16,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 00:59:16,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-25 00:59:16,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-25 00:59:16,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-25 00:59:17,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 00:59:17,028 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 00:59:17,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 00:59:17,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1143750714, now seen corresponding path program 3 times [2025-04-25 00:59:17,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 00:59:17,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973966234] [2025-04-25 00:59:17,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 00:59:17,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 00:59:17,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 8 equivalence classes. [2025-04-25 00:59:17,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 28 of 28 statements. [2025-04-25 00:59:17,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-04-25 00:59:17,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:59:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 00:59:17,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 00:59:17,868 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973966234] [2025-04-25 00:59:17,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973966234] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 00:59:17,868 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656116830] [2025-04-25 00:59:17,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 00:59:17,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 00:59:17,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 00:59:17,870 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 00:59:17,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-25 00:59:17,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 8 equivalence classes. [2025-04-25 00:59:17,981 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 28 of 28 statements. [2025-04-25 00:59:17,981 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-04-25 00:59:17,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 00:59:17,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-04-25 00:59:17,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 00:59:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 00:59:19,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 01:00:46,483 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 56 c_~x_1~0) 4294967296))) (let ((.cse7 (+ .cse0 4294967296)) (.cse2 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse4 (+ (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse3 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22))) (.cse1 (+ v_z_22 .cse5))) (or (= .cse0 .cse1) (< v_z_22 0) (< .cse2 .cse3) (< .cse3 .cse4) (< 4294967295 .cse1)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse6 (+ v_z_22 .cse5)) (.cse8 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (= .cse0 .cse6) (= .cse7 .cse6) (< 4294967295 v_z_22) (< v_z_22 0) (< .cse2 .cse8) (< .cse8 .cse4)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse9 (+ v_z_22 .cse5)) (.cse10 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (= .cse7 .cse9) (< 4294967295 v_z_22) (< .cse9 4294967296) (< .cse2 .cse10) (< .cse10 .cse4))))))) is different from false [2025-04-25 01:00:50,780 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 56 c_~x_1~0) 4294967296))) (let ((.cse2 (+ .cse0 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse1 (+ v_z_22 .cse3))) (or (= .cse0 .cse1) (= .cse2 .cse1) (< 4294967295 v_z_22) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8)) (< v_z_22 0)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse4 (+ v_z_22 .cse3))) (or (= .cse0 .cse4) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8)) (< v_z_22 0) (< 4294967295 .cse4)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse5 (+ v_z_22 .cse3))) (or (= .cse2 .cse5) (< 4294967295 v_z_22) (< .cse5 4294967296) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8)))))))) is different from false [2025-04-25 01:00:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 01:00:50,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656116830] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 01:00:50,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 01:00:50,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 57 [2025-04-25 01:00:50,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114764160] [2025-04-25 01:00:50,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 01:00:50,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-04-25 01:00:50,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 01:00:50,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-04-25 01:00:50,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2710, Unknown=11, NotChecked=218, Total=3306 [2025-04-25 01:00:50,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:00:50,832 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 01:00:50,832 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 57 states have internal predecessors, (72), 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-04-25 01:00:50,832 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 01:00:50,832 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-25 01:00:50,832 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2025-04-25 01:00:50,832 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:00:55,056 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 56 c_~x_1~0) 4294967296))) (let ((.cse2 (+ .cse0 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse1 (+ v_z_22 .cse3))) (or (= .cse0 .cse1) (= .cse2 .cse1) (< 4294967295 v_z_22) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8)) (< v_z_22 0)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse4 (+ v_z_22 .cse3))) (or (= .cse0 .cse4) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8)) (< v_z_22 0) (< 4294967295 .cse4)))) (= c_~x_2~0 0) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse5 (+ v_z_22 .cse3))) (or (= .cse2 .cse5) (< 4294967295 v_z_22) (< .cse5 4294967296) (not (= (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)) 8))))) (= c_~x_1~0 0)))) is different from false [2025-04-25 01:00:59,151 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 56 c_~x_1~0) 4294967296))) (let ((.cse7 (+ .cse0 4294967296)) (.cse2 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse4 (+ (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse3 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22))) (.cse1 (+ v_z_22 .cse5))) (or (= .cse0 .cse1) (< v_z_22 0) (< .cse2 .cse3) (< .cse3 .cse4) (< 4294967295 .cse1)))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse6 (+ v_z_22 .cse5)) (.cse8 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (= .cse0 .cse6) (= .cse7 .cse6) (< 4294967295 v_z_22) (< v_z_22 0) (< .cse2 .cse8) (< .cse8 .cse4)))) (= c_~x_1~0 0) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse9 (+ v_z_22 .cse5)) (.cse10 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (= .cse7 .cse9) (< 4294967295 v_z_22) (< .cse9 4294967296) (< .cse2 .cse10) (< .cse10 .cse4))))))) is different from false [2025-04-25 01:01:03,174 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse6 (+ (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296) 1)) (.cse7 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse2 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse4 (+ (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_23 Int)) (or (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse0 (mod (+ c_~x_1~0 (* v_z_23 8)) 4294967296)) (.cse1 (+ v_z_22 .cse5)) (.cse3 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (< 4294967295 v_z_22) (= .cse0 .cse1) (< v_z_22 0) (= (+ 4294967296 .cse0) .cse1) (< .cse2 .cse3) (< .cse3 .cse4)))) (< v_z_23 .cse6) (< .cse7 v_z_23))) (= c_~x_2~0 0) (forall ((v_z_23 Int)) (or (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse8 (+ v_z_22 .cse5)) (.cse9 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (< 4294967295 v_z_22) (< .cse8 4294967296) (= (+ 4294967296 (mod (+ c_~x_1~0 (* v_z_23 8)) 4294967296)) .cse8) (< .cse2 .cse9) (< .cse9 .cse4)))) (< v_z_23 .cse6) (< .cse7 v_z_23))) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_~x_1~0 0) (forall ((v_z_23 Int)) (or (< v_z_23 .cse6) (< .cse7 v_z_23) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse11 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22))) (.cse10 (+ v_z_22 .cse5))) (or (= (mod (+ c_~x_1~0 (* v_z_23 8)) 4294967296) .cse10) (< v_z_22 0) (< .cse2 .cse11) (< .cse11 .cse4) (< 4294967295 .cse10)))))))) is different from false [2025-04-25 01:01:07,313 WARN L849 $PredicateComparison]: unable to prove that (and (= c_~x_1~0 c_~a~0) (let ((.cse0 (mod c_~a~0 4294967296))) (or (< (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296) .cse0) (let ((.cse8 (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296))) (let ((.cse2 (+ .cse8 4294967296)) (.cse3 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse5 (+ (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse1 (+ v_z_22 .cse6)) (.cse4 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22)))) (or (< 4294967295 v_z_22) (< .cse1 4294967296) (= .cse2 .cse1) (< .cse3 .cse4) (< .cse4 .cse5)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse7 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22))) (.cse9 (+ v_z_22 .cse6))) (or (< v_z_22 0) (< .cse3 .cse7) (< .cse7 .cse5) (= .cse8 .cse9) (< 4294967295 .cse9)))) (forall ((v_z_22 Int) (v_y_22 Int)) (let ((.cse11 (+ (* v_y_22 4294967296) (* 3067833783 v_z_22))) (.cse10 (+ v_z_22 .cse6))) (or (< 4294967295 v_z_22) (= .cse2 .cse10) (< v_z_22 0) (< .cse3 .cse11) (< .cse11 .cse5) (= .cse8 .cse10))))))) (< .cse0 (+ (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296) 1)))) (= c_~x_2~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_thread1Thread1of1ForFork0_~i~0 1)) is different from false [2025-04-25 01:01:26,931 WARN L286 SmtUtils]: Spent 18.24s on a formula simplification that was a NOOP. DAG size: 149 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-25 01:01:37,288 WARN L286 SmtUtils]: Spent 6.37s on a formula simplification that was a NOOP. DAG size: 145 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-25 01:01:52,809 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-25 01:03:00,411 WARN L286 SmtUtils]: Spent 32.60s on a formula simplification that was a NOOP. DAG size: 153 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-25 01:03:01,849 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-25 01:03:04,523 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-25 01:03:07,035 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-25 01:03:10,377 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-25 01:03:19,911 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-25 01:03:23,537 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-25 01:03:24,619 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-25 01:03:32,038 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-25 01:03:43,727 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-25 01:03:52,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 01:03:52,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-25 01:03:52,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-25 01:03:52,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-25 01:03:52,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-25 01:03:52,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 01:03:52,321 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 01:03:52,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 01:03:52,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1923333806, now seen corresponding path program 4 times [2025-04-25 01:03:52,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 01:03:52,322 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801089432] [2025-04-25 01:03:52,322 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 01:03:52,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 01:03:52,326 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-25 01:03:52,387 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-25 01:03:52,387 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-25 01:03:52,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 01:03:55,443 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 01:03:55,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 01:03:55,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801089432] [2025-04-25 01:03:55,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801089432] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 01:03:55,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443180773] [2025-04-25 01:03:55,443 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 01:03:55,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 01:03:55,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 01:03:55,445 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 01:03:55,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-25 01:03:55,475 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-25 01:03:55,608 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-25 01:03:55,608 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-25 01:03:55,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 01:03:55,611 WARN L254 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 137 conjuncts are in the unsatisfiable core [2025-04-25 01:03:55,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 01:03:58,565 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 01:03:58,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 01:06:39,754 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 240) 4294967296))) (let ((.cse2 (+ .cse1 4294967296)) (.cse4 (+ 1 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse5 (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse0 (+ v_z_28 .cse6)) (.cse3 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse0 .cse1) (< v_z_28 0) (= .cse2 .cse0) (< .cse3 .cse4) (< .cse5 .cse3) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse7 (+ v_z_28 .cse6)) (.cse8 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse7 .cse1) (< v_z_28 0) (< 4294967295 .cse7) (< .cse8 .cse4) (< .cse5 .cse8)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse9 (+ v_z_28 .cse6)) (.cse10 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse2 .cse9) (< .cse10 .cse4) (< .cse9 4294967296) (< .cse5 .cse10) (< 4294967295 v_z_28))))))) is different from false [2025-04-25 01:06:44,095 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 240) 4294967296))) (let ((.cse2 (+ .cse1 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse0 (+ v_z_28 .cse3))) (or (= .cse0 .cse1) (< v_z_28 0) (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (= .cse2 .cse0) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse4 (+ v_z_28 .cse3))) (or (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (= .cse2 .cse4) (< .cse4 4294967296) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse5 (+ v_z_28 .cse3))) (or (= .cse5 .cse1) (< v_z_28 0) (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (< 4294967295 .cse5))))))) is different from false [2025-04-25 01:06:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 01:06:44,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443180773] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 01:06:44,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 01:06:44,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 104 [2025-04-25 01:06:44,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403721233] [2025-04-25 01:06:44,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 01:06:44,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2025-04-25 01:06:44,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 01:06:44,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2025-04-25 01:06:44,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1952, Invalid=8556, Unknown=6, NotChecked=406, Total=10920 [2025-04-25 01:06:44,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:06:44,155 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 01:06:44,155 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 1.1333333333333333) internal successors, (119), 104 states have internal predecessors, (119), 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-04-25 01:06:44,155 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 01:06:44,155 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2025-04-25 01:06:44,155 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2025-04-25 01:06:44,155 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2025-04-25 01:06:44,155 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 01:06:48,285 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 240) 4294967296))) (let ((.cse2 (+ .cse1 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (= c_~x_2~0 0) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse0 (+ v_z_28 .cse3))) (or (= .cse0 .cse1) (< v_z_28 0) (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (= .cse2 .cse0) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse4 (+ v_z_28 .cse3))) (or (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (= .cse2 .cse4) (< .cse4 4294967296) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse5 (+ v_z_28 .cse3))) (or (= .cse5 .cse1) (< v_z_28 0) (not (= (+ (* v_z_28 4008636143) (* v_y_28 4294967296)) 16)) (< 4294967295 .cse5)))) (= c_~x_1~0 0)))) is different from false [2025-04-25 01:06:52,495 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~x_1~0 240) 4294967296))) (let ((.cse2 (+ .cse1 4294967296)) (.cse4 (+ 1 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse5 (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse0 (+ v_z_28 .cse6)) (.cse3 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse0 .cse1) (< v_z_28 0) (= .cse2 .cse0) (< .cse3 .cse4) (< .cse5 .cse3) (< 4294967295 v_z_28)))) (= c_~x_2~0 0) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse7 (+ v_z_28 .cse6)) (.cse8 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse7 .cse1) (< v_z_28 0) (< 4294967295 .cse7) (< .cse8 .cse4) (< .cse5 .cse8)))) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~x_1~0 0) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse9 (+ v_z_28 .cse6)) (.cse10 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (= .cse2 .cse9) (< .cse10 .cse4) (< .cse9 4294967296) (< .cse5 .cse10) (< 4294967295 v_z_28))))))) is different from false [2025-04-25 01:06:56,515 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) 1)) (.cse1 (mod (+ c_thread2Thread1of1ForFork1_~i~1 15) 4294967296)) (.cse5 (+ 1 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296))) (.cse6 (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse7 (mod c_~x_2~0 4294967296))) (and (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (forall ((v_z_35 Int) (v_z_28 Int) (v_y_28 Int)) (let ((.cse2 (+ v_z_28 .cse7)) (.cse3 (mod (+ (* v_z_35 16) c_~x_1~0) 4294967296)) (.cse4 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (< v_z_35 .cse0) (< v_z_28 0) (< .cse1 v_z_35) (= .cse2 .cse3) (= .cse2 (+ .cse3 4294967296)) (< .cse4 .cse5) (< .cse6 .cse4) (< 4294967295 v_z_28)))) (= c_~x_1~0 0) (forall ((v_z_28 Int) (v_y_28 Int) (v_z_33 Int)) (let ((.cse9 (+ v_z_28 .cse7)) (.cse8 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (< .cse1 v_z_33) (< v_z_33 .cse0) (< .cse8 .cse5) (= .cse9 (+ 4294967296 (mod (+ c_~x_1~0 (* v_z_33 16)) 4294967296))) (< .cse9 4294967296) (< .cse6 .cse8) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int) (v_z_32 Int)) (let ((.cse10 (+ v_z_28 .cse7)) (.cse11 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (< v_z_28 0) (< v_z_32 .cse0) (< .cse1 v_z_32) (= .cse10 (mod (+ (* v_z_32 16) c_~x_1~0) 4294967296)) (< 4294967295 .cse10) (< .cse11 .cse5) (< .cse6 .cse11)))))) is different from false