./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c --full-output --traceabstraction.commutativity.condition.synthesis NONE -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1c4755c5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/mult-comm.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 de93f11842753a9f5cde98724d1851736862f745073786263bfd177abe6c2376 --traceabstraction.commutativity.condition.synthesis NONE -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.3.0-dev-1c4755c-m [2024-12-17 06:21:43,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-17 06:21:43,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-12-17 06:21:43,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-17 06:21:43,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-17 06:21:43,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-17 06:21:43,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-17 06:21:43,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-17 06:21:43,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-17 06:21:43,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-17 06:21:43,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-17 06:21:43,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-17 06:21:43,389 INFO L153 SettingsManager]: * Use SBE=true [2024-12-17 06:21:43,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-17 06:21:43,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-17 06:21:43,390 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-17 06:21:43,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-17 06:21:43,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-17 06:21:43,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-17 06:21:43,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-17 06:21:43,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-17 06:21:43,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-17 06:21:43,391 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-17 06:21:43,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-17 06:21:43,391 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-17 06:21:43,391 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-17 06:21:43,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-17 06:21:43,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-17 06:21:43,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-17 06:21:43,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-17 06:21:43,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-17 06:21:43,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-17 06:21:43,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-17 06:21:43,392 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-17 06:21:43,392 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2024-12-17 06:21:43,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-17 06:21:43,393 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-17 06:21:43,393 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-12-17 06:21:43,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-17 06:21:43,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-17 06:21:43,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-12-17 06:21:43,393 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-12-17 06:21:43,393 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-12-17 06:21:43,393 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 -> de93f11842753a9f5cde98724d1851736862f745073786263bfd177abe6c2376 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE [2024-12-17 06:21:43,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-17 06:21:43,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-17 06:21:43,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-17 06:21:43,696 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-17 06:21:43,696 INFO L274 PluginConnector]: CDTParser initialized [2024-12-17 06:21:43,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c [2024-12-17 06:21:45,121 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/7ac7476c7/e56a822ca8b24ec2b5ef978bd87ffb26/FLAG008d2086a [2024-12-17 06:21:45,416 INFO L384 CDTParser]: Found 1 translation units. [2024-12-17 06:21:45,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/mult-comm.wvr.c [2024-12-17 06:21:45,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/7ac7476c7/e56a822ca8b24ec2b5ef978bd87ffb26/FLAG008d2086a [2024-12-17 06:21:45,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/7ac7476c7/e56a822ca8b24ec2b5ef978bd87ffb26 [2024-12-17 06:21:45,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-17 06:21:45,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-17 06:21:45,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-17 06:21:45,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-17 06:21:45,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-17 06:21:45,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:21:45" (1/1) ... [2024-12-17 06:21:45,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa5e070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:21:45, skipping insertion in model container [2024-12-17 06:21:45,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:21:45" (1/1) ... [2024-12-17 06:21:45,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-17 06:21:45,662 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-comm.wvr.c[1936,1949] [2024-12-17 06:21:45,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-17 06:21:45,678 INFO L200 MainTranslator]: Completed pre-run [2024-12-17 06:21:45,699 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-comm.wvr.c[1936,1949] [2024-12-17 06:21:45,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-17 06:21:45,717 INFO L204 MainTranslator]: Completed translation [2024-12-17 06:21:45,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:21:45 WrapperNode [2024-12-17 06:21:45,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-17 06:21:45,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-17 06:21:45,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-17 06:21:45,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-17 06:21:45,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:21:45" (1/1) ... [2024-12-17 06:21:45,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:21:45" (1/1) ... [2024-12-17 06:21:45,749 INFO L138 Inliner]: procedures = 20, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2024-12-17 06:21:45,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-17 06:21:45,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-17 06:21:45,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-17 06:21:45,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-17 06:21:45,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:21:45" (1/1) ... [2024-12-17 06:21:45,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:21:45" (1/1) ... [2024-12-17 06:21:45,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:21:45" (1/1) ... [2024-12-17 06:21:45,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:21:45" (1/1) ... [2024-12-17 06:21:45,764 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:21:45" (1/1) ... [2024-12-17 06:21:45,765 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:21:45" (1/1) ... [2024-12-17 06:21:45,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:21:45" (1/1) ... [2024-12-17 06:21:45,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:21:45" (1/1) ... [2024-12-17 06:21:45,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:21:45" (1/1) ... [2024-12-17 06:21:45,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-17 06:21:45,779 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-17 06:21:45,779 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-17 06:21:45,779 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-17 06:21:45,780 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:21:45" (1/1) ... [2024-12-17 06:21:45,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-17 06:21:45,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 06:21:45,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-12-17 06:21:45,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-12-17 06:21:45,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-17 06:21:45,837 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-12-17 06:21:45,838 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-12-17 06:21:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-12-17 06:21:45,838 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-12-17 06:21:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-17 06:21:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-17 06:21:45,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-17 06:21:45,839 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-17 06:21:45,917 INFO L234 CfgBuilder]: Building ICFG [2024-12-17 06:21:45,920 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-17 06:21:46,032 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-17 06:21:46,033 INFO L283 CfgBuilder]: Performing block encoding [2024-12-17 06:21:46,140 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-17 06:21:46,140 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-17 06:21:46,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:21:46 BoogieIcfgContainer [2024-12-17 06:21:46,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-17 06:21:46,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-17 06:21:46,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-17 06:21:46,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-17 06:21:46,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 06:21:45" (1/3) ... [2024-12-17 06:21:46,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e98ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:21:46, skipping insertion in model container [2024-12-17 06:21:46,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:21:45" (2/3) ... [2024-12-17 06:21:46,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e98ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:21:46, skipping insertion in model container [2024-12-17 06:21:46,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:21:46" (3/3) ... [2024-12-17 06:21:46,150 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2024-12-17 06:21:46,160 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-17 06:21:46,161 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-comm.wvr.c that has 3 procedures, 17 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-12-17 06:21:46,162 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-17 06:21:46,208 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-12-17 06:21:46,252 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 06:21:46,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-12-17 06:21:46,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 06:21:46,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-12-17 06:21:46,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-12-17 06:21:46,324 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 06:21:46,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 06:21:46,346 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;@34b47aec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 06:21:46,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-12-17 06:21:46,520 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 06:21:46,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 06:21:46,526 INFO L85 PathProgramCache]: Analyzing trace with hash -211985893, now seen corresponding path program 1 times [2024-12-17 06:21:46,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 06:21:46,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266547975] [2024-12-17 06:21:46,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 06:21:46,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 06:21:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 06:21:47,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 06:21:47,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 06:21:47,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266547975] [2024-12-17 06:21:47,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266547975] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 06:21:47,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 06:21:47,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-17 06:21:47,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163264012] [2024-12-17 06:21:47,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 06:21:47,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-17 06:21:47,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 06:21:47,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-17 06:21:47,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-17 06:21:47,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 06:21:47,437 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 06:21:47,439 INFO L472 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) [2024-12-17 06:21:47,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 06:21:47,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 06:21:47,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-17 06:21:47,561 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 06:21:47,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 06:21:47,562 INFO L85 PathProgramCache]: Analyzing trace with hash -341022696, now seen corresponding path program 1 times [2024-12-17 06:21:47,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 06:21:47,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104628035] [2024-12-17 06:21:47,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 06:21:47,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 06:21:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 06:21:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 06:21:48,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 06:21:48,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104628035] [2024-12-17 06:21:48,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104628035] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 06:21:48,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650201374] [2024-12-17 06:21:48,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 06:21:48,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 06:21:48,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 06:21:48,913 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) [2024-12-17 06:21:48,916 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 [2024-12-17 06:21:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 06:21:48,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-12-17 06:21:49,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 06:21:49,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 06:21:49,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 06:21:52,064 WARN L851 $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 [2024-12-17 06:21:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-12-17 06:21:52,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650201374] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 06:21:52,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 06:21:52,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2024-12-17 06:21:52,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340803240] [2024-12-17 06:21:52,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 06:21:52,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-12-17 06:21:52,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 06:21:52,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-12-17 06:21:52,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=301, Unknown=1, NotChecked=36, Total=420 [2024-12-17 06:21:52,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 06:21:52,476 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 06:21:52,477 INFO L472 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) [2024-12-17 06:21:52,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 06:21:52,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 06:21:53,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 06:21:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-17 06:21:53,834 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 [2024-12-17 06:21:54,028 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 [2024-12-17 06:21:54,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 06:21:54,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 06:21:54,030 INFO L85 PathProgramCache]: Analyzing trace with hash 173912658, now seen corresponding path program 2 times [2024-12-17 06:21:54,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 06:21:54,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569114272] [2024-12-17 06:21:54,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 06:21:54,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 06:21:54,078 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-17 06:21:54,079 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 06:21:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 06:21:55,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 06:21:55,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569114272] [2024-12-17 06:21:55,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569114272] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 06:21:55,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419706335] [2024-12-17 06:21:55,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 06:21:55,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 06:21:55,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 06:21:55,232 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) [2024-12-17 06:21:55,234 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 [2024-12-17 06:21:55,383 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-17 06:21:55,384 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 06:21:55,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-12-17 06:21:55,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 06:21:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 06:21:56,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 06:22:05,120 WARN L851 $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 [2024-12-17 06:22:07,408 WARN L851 $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 [2024-12-17 06:22:09,668 WARN L851 $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 [2024-12-17 06:22:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-12-17 06:22:09,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419706335] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 06:22:09,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 06:22:09,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-12-17 06:22:09,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229602634] [2024-12-17 06:22:09,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 06:22:09,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-12-17 06:22:09,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 06:22:09,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-12-17 06:22:09,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=727, Unknown=5, NotChecked=174, Total=1056 [2024-12-17 06:22:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 06:22:09,735 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 06:22:09,736 INFO L472 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) [2024-12-17 06:22:09,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 06:22:09,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-12-17 06:22:09,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 06:22:11,770 WARN L851 $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 [2024-12-17 06:22:13,835 WARN L851 $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 [2024-12-17 06:22:15,928 WARN L851 $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 [2024-12-17 06:22:18,028 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~x_1~0 c_~a~0) (= c_~x_2~0 0) (let ((.cse11 (mod c_~a~0 4294967296))) (or (let ((.cse2 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296))) (let ((.cse4 (+ .cse2 4294967296)) (.cse1 (+ (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296) 1)) (.cse5 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse6 (mod c_~x_2~0 4294967296))) (and (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse3 (+ v_z_10 .cse6)) (.cse0 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)))) (or (< v_z_10 0) (< .cse0 .cse1) (< 4294967295 v_z_10) (= .cse2 .cse3) (= .cse3 .cse4) (< .cse5 .cse0)))) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse7 (+ v_z_10 .cse6)) (.cse8 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)))) (or (< .cse7 4294967296) (< .cse8 .cse1) (< 4294967295 v_z_10) (= .cse7 .cse4) (< .cse5 .cse8)))) (forall ((v_z_10 Int) (v_y_10 Int)) (let ((.cse10 (+ v_z_10 .cse6)) (.cse9 (+ (* v_y_10 4294967296) (* 2863311531 v_z_10)))) (or (< v_z_10 0) (< .cse9 .cse1) (= .cse2 .cse10) (< 4294967295 .cse10) (< .cse5 .cse9))))))) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) .cse11) (< .cse11 (+ (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) 1)))) (= c_thread2Thread1of1ForFork1_~i~1 0) (= c_thread1Thread1of1ForFork0_~i~0 1)) is different from false [2024-12-17 06:22:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 06:22:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-17 06:22:22,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-12-17 06:22:22,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-17 06:22:22,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 06:22:22,421 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 06:22:22,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 06:22:22,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1143750714, now seen corresponding path program 3 times [2024-12-17 06:22:22,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 06:22:22,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500621362] [2024-12-17 06:22:22,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-17 06:22:22,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 06:22:22,475 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-12-17 06:22:22,476 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 06:22:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 06:22:23,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 06:22:23,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500621362] [2024-12-17 06:22:23,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500621362] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 06:22:23,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207215079] [2024-12-17 06:22:23,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-17 06:22:23,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 06:22:23,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 06:22:23,450 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 06:22:23,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-17 06:22:23,569 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-12-17 06:22:23,569 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 06:22:23,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-12-17 06:22:23,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 06:22:24,634 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 06:22:24,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 06:23:16,837 WARN L851 $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 [2024-12-17 06:23:19,032 WARN L851 $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 [2024-12-17 06:23:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 06:23:19,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207215079] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 06:23:19,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 06:23:19,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 57 [2024-12-17 06:23:19,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661273979] [2024-12-17 06:23:19,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 06:23:19,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-12-17 06:23:19,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 06:23:19,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-12-17 06:23:19,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=2710, Unknown=13, NotChecked=218, Total=3306 [2024-12-17 06:23:19,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 06:23:19,085 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 06:23:19,085 INFO L472 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) [2024-12-17 06:23:19,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 06:23:19,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-12-17 06:23:19,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-12-17 06:23:19,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 06:23:21,231 WARN L851 $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 [2024-12-17 06:23:23,300 WARN L851 $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 [2024-12-17 06:23:25,315 WARN L851 $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 [2024-12-17 06:24:01,889 WARN L286 SmtUtils]: Spent 18.14s on a formula simplification. DAG size of input: 57 DAG size of output: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-17 06:24:03,968 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 [1] [2024-12-17 06:24:21,475 WARN L286 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 153 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-17 06:24:23,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-12-17 06:25:08,685 WARN L286 SmtUtils]: Spent 38.96s on a formula simplification that was a NOOP. DAG size: 182 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-17 06:25:24,690 WARN L286 SmtUtils]: Spent 10.62s on a formula simplification that was a NOOP. DAG size: 145 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-17 06:25:35,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 06:25:39,646 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 [] [2024-12-17 06:25:48,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 06:25:52,330 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 [] [2024-12-17 06:26:00,309 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 [] [2024-12-17 06:26:05,905 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 [] [2024-12-17 06:26:07,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 06:26:09,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 06:26:13,931 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 [] [2024-12-17 06:26:15,941 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 [] [2024-12-17 06:26:17,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 06:26:19,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 06:26:25,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 06:26:25,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-12-17 06:26:25,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-12-17 06:26:25,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-12-17 06:26:25,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-17 06:26:26,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 06:26:26,154 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 06:26:26,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 06:26:26,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1923333806, now seen corresponding path program 4 times [2024-12-17 06:26:26,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 06:26:26,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812010589] [2024-12-17 06:26:26,155 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-17 06:26:26,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 06:26:26,253 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-17 06:26:26,255 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 06:26:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 06:26:29,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 06:26:29,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812010589] [2024-12-17 06:26:29,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812010589] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 06:26:29,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634014317] [2024-12-17 06:26:29,764 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-17 06:26:29,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 06:26:29,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 06:26:29,766 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 06:26:29,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-17 06:26:29,943 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-17 06:26:29,943 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 06:26:29,945 WARN L254 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-12-17 06:26:29,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 06:26:34,193 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 06:26:34,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 06:27:12,929 WARN L851 $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 (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)))) (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 [2024-12-17 06:27:15,212 WARN L851 $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 [2024-12-17 06:27:17,406 WARN L851 $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 [2024-12-17 06:27:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2024-12-17 06:27:17,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634014317] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 06:27:17,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 06:27:17,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 104 [2024-12-17 06:27:17,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741915991] [2024-12-17 06:27:17,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 06:27:17,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2024-12-17 06:27:17,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 06:27:17,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2024-12-17 06:27:17,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1952, Invalid=8357, Unknown=5, NotChecked=606, Total=10920 [2024-12-17 06:27:17,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 06:27:17,457 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 06:27:17,457 INFO L472 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) [2024-12-17 06:27:17,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 06:27:17,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-12-17 06:27:17,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-12-17 06:27:17,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-12-17 06:27:17,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 06:27:19,610 WARN L851 $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 [2024-12-17 06:27:21,671 WARN L851 $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 [2024-12-17 06:27:23,751 WARN L851 $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 [2024-12-17 06:28:15,124 WARN L286 SmtUtils]: Spent 18.11s on a formula simplification. DAG size of input: 57 DAG size of output: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-17 06:28:17,152 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 [1] [2024-12-17 06:28:19,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-12-17 06:28:21,904 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse91 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse96 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse94 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse99 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse100 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse98 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse93 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse102 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse97 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse92 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse95 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse89 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse101 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse42 (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse105 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse108 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse115 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse103 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse104 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse114 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse113 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse106 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse107 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse112 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse111 (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296)) (.cse116 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse41 (mod c_~b~0 4294967296)) (.cse76 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse110 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse109 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse90 (mod c_~a~0 4294967296))) (let ((.cse24 (< .cse109 .cse90)) (.cse25 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse28 (< .cse90 (+ .cse110 1))) (.cse26 (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (.cse27 (< .cse41 (+ .cse76 1))) (.cse29 (< .cse116 .cse41)) (.cse36 (< .cse90 (+ .cse111 1))) (.cse38 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) .cse90)) (.cse40 (mod (+ c_~x_2~0 (* 14 c_~b~0)) 4294967296)) (.cse3 (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) (.cse2 (< .cse112 .cse90)) (.cse5 (< .cse90 (+ .cse107 1))) (.cse0 (< .cse41 (+ .cse106 1))) (.cse1 (< .cse113 .cse41)) (.cse4 (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (.cse6 (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296)) (.cse8 (< .cse41 (+ .cse114 1))) (.cse11 (< .cse104 .cse41)) (.cse9 (< .cse103 .cse90)) (.cse7 (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (.cse10 (< .cse90 (+ .cse115 1))) (.cse30 (< .cse41 (+ .cse116 1))) (.cse31 (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (.cse32 (< .cse108 .cse41)) (.cse52 (< .cse115 .cse90)) (.cse53 (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296)) (.cse65 (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296)) (.cse64 (< .cse114 .cse41)) (.cse66 (< .cse41 (+ .cse113 1))) (.cse54 (< .cse90 (+ .cse112 1))) (.cse35 (< .cse41 (+ .cse105 1))) (.cse37 (< .cse42 .cse41)) (.cse58 (< .cse111 .cse90)) (.cse39 (mod (+ c_~x_1~0 (* 14 c_~a~0)) 4294967296)) (.cse57 (mod (+ c_~x_2~0 (* c_~b~0 13)) 4294967296)) (.cse59 (< .cse90 (+ .cse101 1))) (.cse34 (< .cse110 .cse90)) (.cse33 (mod c_~x_2~0 4294967296)) (.cse43 (< .cse41 (+ .cse89 1))) (.cse47 (< .cse95 .cse41)) (.cse44 (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296)) (.cse77 (< .cse90 (+ .cse92 1))) (.cse78 (< .cse97 .cse90)) (.cse79 (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296)) (.cse73 (< .cse90 (+ .cse109 1))) (.cse49 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296)) (.cse75 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (.cse50 (< .cse41 (+ .cse108 1))) (.cse74 (< .cse107 .cse90)) (.cse51 (< .cse106 .cse41)) (.cse55 (< .cse105 .cse41)) (.cse56 (mod (+ c_~x_1~0 (* 13 c_~a~0)) 4294967296)) (.cse60 (< .cse41 (+ .cse102 1))) (.cse67 (< .cse93 .cse41)) (.cse62 (< .cse98 .cse90)) (.cse68 (< .cse41 (+ .cse104 1))) (.cse63 (< .cse90 (+ .cse103 1))) (.cse61 (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296)) (.cse70 (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296)) (.cse12 (< .cse41 (+ .cse100 1))) (.cse83 (< .cse90 (+ .cse99 1))) (.cse84 (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296)) (.cse15 (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296)) (.cse16 (< .cse102 .cse41)) (.cse85 (< .cse101 .cse90)) (.cse19 (< .cse100 .cse41)) (.cse13 (< .cse99 .cse90)) (.cse23 (< .cse41 (+ .cse94 1))) (.cse14 (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296)) (.cse22 (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (.cse17 (< .cse90 (+ .cse96 1))) (.cse69 (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (.cse71 (< .cse91 .cse90)) (.cse72 (< .cse90 (+ .cse98 1))) (.cse18 (< .cse90 (+ .cse97 1))) (.cse20 (< .cse96 .cse90)) (.cse80 (< .cse41 (+ .cse95 1))) (.cse81 (< .cse94 .cse41)) (.cse21 (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296)) (.cse82 (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296)) (.cse45 (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296)) (.cse87 (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296)) (.cse86 (< .cse41 (+ .cse93 1))) (.cse46 (< .cse92 .cse90)) (.cse48 (< .cse90 (+ .cse91 1))) (.cse88 (< .cse89 .cse41))) (and (or .cse0 .cse1 .cse2 (= .cse3 .cse4) .cse5) (or (= .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse13 (= .cse14 .cse15) .cse16 .cse17) (or .cse18 .cse19 .cse20 (= .cse21 .cse22) .cse23) (or .cse24 (= .cse25 .cse26) .cse27 .cse28 .cse29) (or .cse24 .cse30 (= .cse25 .cse31) .cse28 .cse32) (or (= .cse33 .cse26) .cse34 .cse27 .cse29) (or .cse35 .cse36 .cse37 .cse38 (= .cse39 .cse40)) (or (< (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse41) .cse36 (< .cse41 (+ .cse42 1)) .cse38 (= (mod (+ c_~x_1~0 (* 15 c_~a~0)) 4294967296) .cse40)) (or .cse43 (= .cse44 .cse45) .cse46 .cse47 .cse48) (or (= .cse49 .cse3) .cse50 .cse2 .cse51 .cse5) (or .cse0 .cse1 .cse52 (= .cse53 .cse4) .cse54) (or .cse55 (= .cse56 .cse57) .cse58 .cse59 .cse60) (or (= .cse61 .cse6) .cse62 .cse63 .cse8 .cse11) (or .cse9 .cse64 (= .cse65 .cse7) .cse66 .cse10) (or .cse67 .cse68 (= .cse69 .cse70) .cse71 .cse72) (or .cse73 .cse30 .cse74 (= .cse75 .cse31) .cse32) (or .cse52 (= .cse53 .cse65) .cse64 .cse66 .cse54) (or .cse35 .cse37 .cse58 (= .cse39 .cse57) .cse59) (or (< .cse76 .cse41) .cse34 (= (mod c_~x_1~0 4294967296) .cse33)) (or .cse43 .cse77 .cse78 .cse47 (= .cse79 .cse44)) (or .cse77 .cse80 .cse78 .cse81 (= .cse79 .cse82)) (or .cse73 (= .cse49 .cse75) .cse50 .cse74 .cse51) (or .cse55 .cse83 (= .cse84 .cse56) .cse85 .cse60) (or .cse67 .cse62 .cse68 .cse63 (= .cse61 .cse70)) (or .cse12 .cse83 (= .cse84 .cse15) .cse16 .cse85) (or .cse19 .cse13 .cse23 (= .cse14 .cse22) .cse17) (or .cse86 (= .cse87 .cse69) .cse71 .cse72 .cse88) (or .cse18 .cse20 .cse80 .cse81 (= .cse21 .cse82)) (or (= .cse45 .cse87) .cse86 .cse46 .cse48 .cse88)))) is different from false [2024-12-17 06:28:24,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-12-17 06:28:26,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-12-17 06:28:28,626 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse107 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse100 (mod c_~x_1~0 4294967296)) (.cse33 (mod c_~x_2~0 4294967296)) (.cse112 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse110 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse115 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse116 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse114 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse109 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse119 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse113 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse108 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse111 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse106 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse118 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse117 (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse122 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse125 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse131 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse120 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse121 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse130 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse129 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse123 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse124 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse128 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse97 (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296)) (.cse127 (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296)) (.cse132 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse43 (mod c_~b~0 4294967296)) (.cse34 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse126 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse35 (mod c_~a~0 4294967296))) (let ((.cse24 (< .cse126 .cse35)) (.cse25 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse28 (< .cse35 (+ .cse34 1))) (.cse26 (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (.cse27 (< .cse43 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1))) (.cse29 (< .cse132 .cse43)) (.cse37 (< .cse35 (+ .cse127 1))) (.cse39 (< .cse97 .cse35)) (.cse41 (mod (+ c_~x_2~0 (* 14 c_~b~0)) 4294967296)) (.cse3 (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) (.cse2 (< .cse128 .cse35)) (.cse5 (< .cse35 (+ .cse124 1))) (.cse0 (< .cse43 (+ .cse123 1))) (.cse1 (< .cse129 .cse43)) (.cse4 (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (.cse6 (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296)) (.cse8 (< .cse43 (+ .cse130 1))) (.cse11 (< .cse121 .cse43)) (.cse9 (< .cse120 .cse35)) (.cse7 (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (.cse10 (< .cse35 (+ .cse131 1))) (.cse30 (< .cse43 (+ .cse132 1))) (.cse31 (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (.cse32 (< .cse125 .cse43)) (.cse56 (< .cse131 .cse35)) (.cse57 (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296)) (.cse69 (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296)) (.cse68 (< .cse130 .cse43)) (.cse70 (< .cse43 (+ .cse129 1))) (.cse58 (< .cse35 (+ .cse128 1))) (.cse36 (< .cse43 (+ .cse122 1))) (.cse38 (< .cse117 .cse43)) (.cse62 (< .cse127 .cse35)) (.cse40 (mod (+ c_~x_1~0 (* 14 c_~a~0)) 4294967296)) (.cse61 (mod (+ c_~x_2~0 (* c_~b~0 13)) 4294967296)) (.cse63 (< .cse35 (+ .cse118 1))) (.cse47 (< .cse43 (+ .cse106 1))) (.cse51 (< .cse111 .cse43)) (.cse48 (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296)) (.cse81 (< .cse35 (+ .cse108 1))) (.cse82 (< .cse113 .cse35)) (.cse83 (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296)) (.cse77 (< .cse35 (+ .cse126 1))) (.cse53 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296)) (.cse79 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (.cse54 (< .cse43 (+ .cse125 1))) (.cse78 (< .cse124 .cse35)) (.cse55 (< .cse123 .cse43)) (.cse59 (< .cse122 .cse43)) (.cse60 (mod (+ c_~x_1~0 (* 13 c_~a~0)) 4294967296)) (.cse64 (< .cse43 (+ .cse119 1))) (.cse71 (< .cse109 .cse43)) (.cse66 (< .cse114 .cse35)) (.cse72 (< .cse43 (+ .cse121 1))) (.cse67 (< .cse35 (+ .cse120 1))) (.cse65 (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296)) (.cse74 (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296)) (.cse12 (< .cse43 (+ .cse116 1))) (.cse87 (< .cse35 (+ .cse115 1))) (.cse88 (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296)) (.cse15 (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296)) (.cse16 (< .cse119 .cse43)) (.cse89 (< .cse118 .cse35)) (.cse42 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse44 (+ .cse117 1)) (.cse45 (mod (+ c_~x_1~0 (* 15 c_~a~0)) 4294967296)) (.cse19 (< .cse116 .cse43)) (.cse13 (< .cse115 .cse35)) (.cse23 (< .cse43 (+ .cse110 1))) (.cse14 (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296)) (.cse22 (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (.cse17 (< .cse35 (+ .cse112 1))) (.cse80 (= .cse100 .cse33)) (.cse46 (div c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse73 (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (.cse75 (< .cse107 .cse35)) (.cse76 (< .cse35 (+ .cse114 1))) (.cse18 (< .cse35 (+ .cse113 1))) (.cse20 (< .cse112 .cse35)) (.cse84 (< .cse43 (+ .cse111 1))) (.cse85 (< .cse110 .cse43)) (.cse21 (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296)) (.cse86 (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296)) (.cse49 (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296)) (.cse104 (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296)) (.cse103 (< .cse43 (+ .cse109 1))) (.cse50 (< .cse108 .cse35)) (.cse52 (< .cse35 (+ .cse107 1))) (.cse105 (< .cse106 .cse43))) (and (or .cse0 .cse1 .cse2 (= .cse3 .cse4) .cse5) (or (= .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse13 (= .cse14 .cse15) .cse16 .cse17) (or .cse18 .cse19 .cse20 (= .cse21 .cse22) .cse23) (or .cse24 (= .cse25 .cse26) .cse27 .cse28 .cse29) (or .cse24 .cse30 (= .cse25 .cse31) .cse28 .cse32) (or (= .cse33 .cse26) (< .cse34 .cse35) .cse27 .cse29) (or .cse36 .cse37 .cse38 .cse39 (= .cse40 .cse41)) (or (< .cse42 .cse43) .cse37 (< .cse43 .cse44) .cse39 (= .cse45 .cse41)) (<= 0 .cse46) (or .cse47 (= .cse48 .cse49) .cse50 .cse51 .cse52) (or (= .cse53 .cse3) .cse54 .cse2 .cse55 .cse5) (or .cse0 .cse1 .cse56 (= .cse57 .cse4) .cse58) (or .cse59 (= .cse60 .cse61) .cse62 .cse63 .cse64) (or (= .cse65 .cse6) .cse66 .cse67 .cse8 .cse11) (or .cse9 .cse68 (= .cse69 .cse7) .cse70 .cse10) (or .cse71 .cse72 (= .cse73 .cse74) .cse75 .cse76) (or .cse77 .cse30 .cse78 (= .cse79 .cse31) .cse32) (or .cse56 (= .cse57 .cse69) .cse68 .cse70 .cse58) (or .cse36 .cse38 .cse62 (= .cse40 .cse61) .cse63) .cse80 (or .cse47 .cse81 .cse82 .cse51 (= .cse83 .cse48)) (or .cse81 .cse84 .cse82 .cse85 (= .cse83 .cse86)) (or .cse77 (= .cse53 .cse79) .cse54 .cse78 .cse55) (or .cse59 .cse87 (= .cse88 .cse60) .cse89 .cse64) (or .cse71 .cse66 .cse72 .cse67 (= .cse65 .cse74)) (or .cse12 .cse87 (= .cse88 .cse15) .cse16 .cse89) (or (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 15) 4294967296) .cse35) (let ((.cse94 (+ .cse45 4294967296))) (and (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse90 (+ (* v_z_28 4008636143) (* v_y_28 4294967296))) (.cse91 (+ v_z_28 .cse33))) (or (< .cse42 .cse90) (< v_z_28 0) (= .cse91 .cse45) (< .cse90 .cse44) (< 4294967295 .cse91)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse93 (+ v_z_28 .cse33)) (.cse92 (+ (* v_z_28 4008636143) (* v_y_28 4294967296)))) (or (< .cse42 .cse92) (< v_z_28 0) (= .cse93 .cse45) (= .cse93 .cse94) (< .cse92 .cse44) (< 4294967295 v_z_28)))) (forall ((v_z_28 Int) (v_y_28 Int)) (let ((.cse95 (+ (* v_z_28 4008636143) (* v_y_28 4294967296))) (.cse96 (+ v_z_28 .cse33))) (or (< .cse42 .cse95) (= .cse96 .cse94) (< .cse95 .cse44) (< .cse96 4294967296) (< 4294967295 v_z_28)))))) (< .cse35 (+ .cse97 1))) (or .cse19 .cse13 .cse23 (= .cse14 .cse22) .cse17) (let ((.cse101 (* .cse46 64424509440)) (.cse98 (* 64424509440 (div c_~b~0 4294967296))) (.cse99 (* 15 c_thread1Thread1of1ForFork0_~i~0)) (.cse102 (* c_~b~0 15))) (or (and (or (< (+ .cse98 .cse99 .cse33) (+ .cse100 .cse101 1 .cse102)) .cse80) (<= .cse100 .cse33)) (< (+ .cse98 .cse99 4294967521) (+ .cse100 .cse101 .cse102)) (< (+ 4294966830 .cse98 .cse99 .cse33) .cse102))) (or .cse103 (= .cse104 .cse73) .cse75 .cse76 .cse105) (or .cse18 .cse20 .cse84 .cse85 (= .cse21 .cse86)) (or (= .cse49 .cse104) .cse103 .cse50 .cse52 .cse105)))) is different from false [2024-12-17 06:28:31,534 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse89 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse94 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse92 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse97 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse98 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse96 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse91 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse100 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse95 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse90 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse93 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse88 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse99 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse42 (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse103 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse106 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse112 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse101 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse102 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse111 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse110 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse104 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse105 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse109 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse108 (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296)) (.cse113 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse41 (mod c_~b~0 4294967296)) (.cse33 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse107 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse34 (mod c_~a~0 4294967296))) (let ((.cse24 (< .cse107 .cse34)) (.cse25 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse28 (< .cse34 (+ .cse33 1))) (.cse26 (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (.cse27 (< .cse41 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1))) (.cse29 (< .cse113 .cse41)) (.cse36 (< .cse34 (+ .cse108 1))) (.cse38 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) .cse34)) (.cse40 (mod (+ c_~x_2~0 (* 14 c_~b~0)) 4294967296)) (.cse3 (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) (.cse2 (< .cse109 .cse34)) (.cse5 (< .cse34 (+ .cse105 1))) (.cse0 (< .cse41 (+ .cse104 1))) (.cse1 (< .cse110 .cse41)) (.cse4 (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (.cse6 (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296)) (.cse8 (< .cse41 (+ .cse111 1))) (.cse11 (< .cse102 .cse41)) (.cse9 (< .cse101 .cse34)) (.cse7 (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (.cse10 (< .cse34 (+ .cse112 1))) (.cse30 (< .cse41 (+ .cse113 1))) (.cse31 (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (.cse32 (< .cse106 .cse41)) (.cse52 (< .cse112 .cse34)) (.cse53 (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296)) (.cse65 (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296)) (.cse64 (< .cse111 .cse41)) (.cse66 (< .cse41 (+ .cse110 1))) (.cse54 (< .cse34 (+ .cse109 1))) (.cse35 (< .cse41 (+ .cse103 1))) (.cse37 (< .cse42 .cse41)) (.cse58 (< .cse108 .cse34)) (.cse39 (mod (+ c_~x_1~0 (* 14 c_~a~0)) 4294967296)) (.cse57 (mod (+ c_~x_2~0 (* c_~b~0 13)) 4294967296)) (.cse59 (< .cse34 (+ .cse99 1))) (.cse43 (< .cse41 (+ .cse88 1))) (.cse47 (< .cse93 .cse41)) (.cse44 (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296)) (.cse76 (< .cse34 (+ .cse90 1))) (.cse77 (< .cse95 .cse34)) (.cse78 (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296)) (.cse73 (< .cse34 (+ .cse107 1))) (.cse49 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296)) (.cse75 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (.cse50 (< .cse41 (+ .cse106 1))) (.cse74 (< .cse105 .cse34)) (.cse51 (< .cse104 .cse41)) (.cse55 (< .cse103 .cse41)) (.cse56 (mod (+ c_~x_1~0 (* 13 c_~a~0)) 4294967296)) (.cse60 (< .cse41 (+ .cse100 1))) (.cse67 (< .cse91 .cse41)) (.cse62 (< .cse96 .cse34)) (.cse68 (< .cse41 (+ .cse102 1))) (.cse63 (< .cse34 (+ .cse101 1))) (.cse61 (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296)) (.cse70 (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296)) (.cse12 (< .cse41 (+ .cse98 1))) (.cse82 (< .cse34 (+ .cse97 1))) (.cse83 (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296)) (.cse15 (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296)) (.cse16 (< .cse100 .cse41)) (.cse84 (< .cse99 .cse34)) (.cse19 (< .cse98 .cse41)) (.cse13 (< .cse97 .cse34)) (.cse23 (< .cse41 (+ .cse92 1))) (.cse14 (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296)) (.cse22 (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (.cse17 (< .cse34 (+ .cse94 1))) (.cse69 (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (.cse71 (< .cse89 .cse34)) (.cse72 (< .cse34 (+ .cse96 1))) (.cse18 (< .cse34 (+ .cse95 1))) (.cse20 (< .cse94 .cse34)) (.cse79 (< .cse41 (+ .cse93 1))) (.cse80 (< .cse92 .cse41)) (.cse21 (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296)) (.cse81 (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296)) (.cse45 (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296)) (.cse86 (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296)) (.cse85 (< .cse41 (+ .cse91 1))) (.cse46 (< .cse90 .cse34)) (.cse48 (< .cse34 (+ .cse89 1))) (.cse87 (< .cse88 .cse41))) (and (or .cse0 .cse1 .cse2 (= .cse3 .cse4) .cse5) (or (= .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse13 (= .cse14 .cse15) .cse16 .cse17) (or .cse18 .cse19 .cse20 (= .cse21 .cse22) .cse23) (or .cse24 (= .cse25 .cse26) .cse27 .cse28 .cse29) (or .cse24 .cse30 (= .cse25 .cse31) .cse28 .cse32) (or (= (mod c_~x_2~0 4294967296) .cse26) (< .cse33 .cse34) .cse27 .cse29) (or .cse35 .cse36 .cse37 .cse38 (= .cse39 .cse40)) (or (< (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse41) .cse36 (< .cse41 (+ .cse42 1)) .cse38 (= (mod (+ c_~x_1~0 (* 15 c_~a~0)) 4294967296) .cse40)) (or .cse43 (= .cse44 .cse45) .cse46 .cse47 .cse48) (or (= .cse49 .cse3) .cse50 .cse2 .cse51 .cse5) (or .cse0 .cse1 .cse52 (= .cse53 .cse4) .cse54) (or .cse55 (= .cse56 .cse57) .cse58 .cse59 .cse60) (or (= .cse61 .cse6) .cse62 .cse63 .cse8 .cse11) (or .cse9 .cse64 (= .cse65 .cse7) .cse66 .cse10) (or .cse67 .cse68 (= .cse69 .cse70) .cse71 .cse72) (or .cse73 .cse30 .cse74 (= .cse75 .cse31) .cse32) (or .cse52 (= .cse53 .cse65) .cse64 .cse66 .cse54) (or .cse35 .cse37 .cse58 (= .cse39 .cse57) .cse59) (or .cse43 .cse76 .cse77 .cse47 (= .cse78 .cse44)) (or .cse76 .cse79 .cse77 .cse80 (= .cse78 .cse81)) (or .cse73 (= .cse49 .cse75) .cse50 .cse74 .cse51) (or .cse55 .cse82 (= .cse83 .cse56) .cse84 .cse60) (or .cse67 .cse62 .cse68 .cse63 (= .cse61 .cse70)) (or .cse12 .cse82 (= .cse83 .cse15) .cse16 .cse84) (or .cse19 .cse13 .cse23 (= .cse14 .cse22) .cse17) (or .cse85 (= .cse86 .cse69) .cse71 .cse72 .cse87) (or .cse18 .cse20 .cse79 .cse80 (= .cse21 .cse81)) (or (= .cse45 .cse86) .cse85 .cse46 .cse48 .cse87)))) is different from false [2024-12-17 06:28:38,884 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse86 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse91 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse89 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse94 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse95 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse93 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse88 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse97 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse92 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse87 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse90 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse84 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse96 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse38 (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse100 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse103 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse28 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse109 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse98 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse99 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse108 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse107 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse26 (mod c_~b~0 4294967296)) (.cse101 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse102 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse106 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse105 (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296)) (.cse104 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse85 (mod c_~a~0 4294967296))) (let ((.cse24 (< .cse104 .cse85)) (.cse25 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse27 (< .cse85 (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1))) (.cse33 (< .cse85 (+ .cse105 1))) (.cse35 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) .cse85)) (.cse37 (mod (+ c_~x_2~0 (* 14 c_~b~0)) 4294967296)) (.cse3 (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) (.cse2 (< .cse106 .cse85)) (.cse5 (< .cse85 (+ .cse102 1))) (.cse0 (< .cse26 (+ .cse101 1))) (.cse1 (< .cse107 .cse26)) (.cse4 (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (.cse6 (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296)) (.cse8 (< .cse26 (+ .cse108 1))) (.cse11 (< .cse99 .cse26)) (.cse9 (< .cse98 .cse85)) (.cse7 (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (.cse10 (< .cse85 (+ .cse109 1))) (.cse29 (< .cse26 (+ .cse28 1))) (.cse30 (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (.cse31 (< .cse103 .cse26)) (.cse48 (< .cse109 .cse85)) (.cse49 (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296)) (.cse61 (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296)) (.cse60 (< .cse108 .cse26)) (.cse62 (< .cse26 (+ .cse107 1))) (.cse50 (< .cse85 (+ .cse106 1))) (.cse32 (< .cse26 (+ .cse100 1))) (.cse34 (< .cse38 .cse26)) (.cse54 (< .cse105 .cse85)) (.cse36 (mod (+ c_~x_1~0 (* 14 c_~a~0)) 4294967296)) (.cse53 (mod (+ c_~x_2~0 (* c_~b~0 13)) 4294967296)) (.cse55 (< .cse85 (+ .cse96 1))) (.cse39 (< .cse26 (+ .cse84 1))) (.cse43 (< .cse90 .cse26)) (.cse40 (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296)) (.cse72 (< .cse85 (+ .cse87 1))) (.cse73 (< .cse92 .cse85)) (.cse74 (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296)) (.cse69 (< .cse85 (+ .cse104 1))) (.cse45 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296)) (.cse71 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (.cse46 (< .cse26 (+ .cse103 1))) (.cse70 (< .cse102 .cse85)) (.cse47 (< .cse101 .cse26)) (.cse51 (< .cse100 .cse26)) (.cse52 (mod (+ c_~x_1~0 (* 13 c_~a~0)) 4294967296)) (.cse56 (< .cse26 (+ .cse97 1))) (.cse63 (< .cse88 .cse26)) (.cse58 (< .cse93 .cse85)) (.cse64 (< .cse26 (+ .cse99 1))) (.cse59 (< .cse85 (+ .cse98 1))) (.cse57 (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296)) (.cse66 (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296)) (.cse12 (< .cse26 (+ .cse95 1))) (.cse78 (< .cse85 (+ .cse94 1))) (.cse79 (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296)) (.cse15 (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296)) (.cse16 (< .cse97 .cse26)) (.cse80 (< .cse96 .cse85)) (.cse19 (< .cse95 .cse26)) (.cse13 (< .cse94 .cse85)) (.cse23 (< .cse26 (+ .cse89 1))) (.cse14 (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296)) (.cse22 (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (.cse17 (< .cse85 (+ .cse91 1))) (.cse65 (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (.cse67 (< .cse86 .cse85)) (.cse68 (< .cse85 (+ .cse93 1))) (.cse18 (< .cse85 (+ .cse92 1))) (.cse20 (< .cse91 .cse85)) (.cse75 (< .cse26 (+ .cse90 1))) (.cse76 (< .cse89 .cse26)) (.cse21 (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296)) (.cse77 (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296)) (.cse41 (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296)) (.cse82 (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296)) (.cse81 (< .cse26 (+ .cse88 1))) (.cse42 (< .cse87 .cse85)) (.cse44 (< .cse85 (+ .cse86 1))) (.cse83 (< .cse84 .cse26))) (and (or .cse0 .cse1 .cse2 (= .cse3 .cse4) .cse5) (or (= .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse13 (= .cse14 .cse15) .cse16 .cse17) (or .cse18 .cse19 .cse20 (= .cse21 .cse22) .cse23) (or .cse24 (= .cse25 (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (< .cse26 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) .cse27 (< .cse28 .cse26)) (or .cse24 .cse29 (= .cse25 .cse30) .cse27 .cse31) (or .cse32 .cse33 .cse34 .cse35 (= .cse36 .cse37)) (or (< (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse26) .cse33 (< .cse26 (+ .cse38 1)) .cse35 (= (mod (+ c_~x_1~0 (* 15 c_~a~0)) 4294967296) .cse37)) (or .cse39 (= .cse40 .cse41) .cse42 .cse43 .cse44) (or (= .cse45 .cse3) .cse46 .cse2 .cse47 .cse5) (or .cse0 .cse1 .cse48 (= .cse49 .cse4) .cse50) (or .cse51 (= .cse52 .cse53) .cse54 .cse55 .cse56) (or (= .cse57 .cse6) .cse58 .cse59 .cse8 .cse11) (or .cse9 .cse60 (= .cse61 .cse7) .cse62 .cse10) (or .cse63 .cse64 (= .cse65 .cse66) .cse67 .cse68) (or .cse69 .cse29 .cse70 (= .cse71 .cse30) .cse31) (or .cse48 (= .cse49 .cse61) .cse60 .cse62 .cse50) (or .cse32 .cse34 .cse54 (= .cse36 .cse53) .cse55) (or .cse39 .cse72 .cse73 .cse43 (= .cse74 .cse40)) (or .cse72 .cse75 .cse73 .cse76 (= .cse74 .cse77)) (or .cse69 (= .cse45 .cse71) .cse46 .cse70 .cse47) (or .cse51 .cse78 (= .cse79 .cse52) .cse80 .cse56) (or .cse63 .cse58 .cse64 .cse59 (= .cse57 .cse66)) (or .cse12 .cse78 (= .cse79 .cse15) .cse16 .cse80) (or .cse19 .cse13 .cse23 (= .cse14 .cse22) .cse17) (or .cse81 (= .cse82 .cse65) .cse67 .cse68 .cse83) (or .cse18 .cse20 .cse75 .cse76 (= .cse21 .cse77)) (or (= .cse41 .cse82) .cse81 .cse42 .cse44 .cse83)))) is different from false [2024-12-17 06:28:58,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 06:29:13,323 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 [] [2024-12-17 06:29:32,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 06:29:39,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-17 06:29:46,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-12-17 06:29:54,045 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 [] [2024-12-17 06:30:02,433 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 [] [2024-12-17 06:30:08,680 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 [] [2024-12-17 06:30:10,951 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse73 (mod (+ c_thread2Thread1of1ForFork1_~i~1 8) 4294967296)) (.cse74 (mod (+ 9 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse84 (mod (+ 7 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse86 (mod (+ c_thread2Thread1of1ForFork1_~i~1 10) 4294967296)) (.cse82 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse88 (mod (+ c_thread2Thread1of1ForFork1_~i~1 11) 4294967296)) (.cse89 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse87 (mod (+ c_thread2Thread1of1ForFork1_~i~1 6) 4294967296)) (.cse85 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse91 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse81 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse83 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse90 (mod (+ c_thread2Thread1of1ForFork1_~i~1 12) 4294967296)) (.cse38 (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse94 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse97 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse28 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse103 (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296)) (.cse92 (mod (+ 5 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse93 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse102 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse101 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse26 (mod c_~b~0 4294967296)) (.cse95 (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse96 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse100 (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296)) (.cse99 (mod (+ c_thread2Thread1of1ForFork1_~i~1 13) 4294967296)) (.cse98 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse72 (mod c_~a~0 4294967296))) (let ((.cse24 (< .cse98 .cse72)) (.cse25 (mod (+ c_~x_2~0 c_~b~0) 4294967296)) (.cse27 (< .cse72 (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1))) (.cse33 (< .cse72 (+ .cse99 1))) (.cse35 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 14) 4294967296) .cse72)) (.cse37 (mod (+ c_~x_2~0 (* 14 c_~b~0)) 4294967296)) (.cse3 (mod (+ c_~x_2~0 (* 3 c_~b~0)) 4294967296)) (.cse2 (< .cse100 .cse72)) (.cse5 (< .cse72 (+ .cse96 1))) (.cse0 (< .cse26 (+ .cse95 1))) (.cse1 (< .cse101 .cse26)) (.cse4 (mod (+ (* 4 c_~a~0) c_~x_1~0) 4294967296)) (.cse6 (mod (+ (* 6 c_~a~0) c_~x_1~0) 4294967296)) (.cse8 (< .cse26 (+ .cse102 1))) (.cse11 (< .cse93 .cse26)) (.cse9 (< .cse92 .cse72)) (.cse7 (mod (+ c_~x_2~0 (* 5 c_~b~0)) 4294967296)) (.cse10 (< .cse72 (+ .cse103 1))) (.cse29 (< .cse26 (+ .cse28 1))) (.cse30 (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296)) (.cse31 (< .cse97 .cse26)) (.cse48 (< .cse103 .cse72)) (.cse49 (mod (+ (* c_~b~0 4) c_~x_2~0) 4294967296)) (.cse61 (mod (+ c_~x_1~0 (* 5 c_~a~0)) 4294967296)) (.cse60 (< .cse102 .cse26)) (.cse62 (< .cse26 (+ .cse101 1))) (.cse50 (< .cse72 (+ .cse100 1))) (.cse32 (< .cse26 (+ .cse94 1))) (.cse34 (< .cse38 .cse26)) (.cse54 (< .cse99 .cse72)) (.cse36 (mod (+ c_~x_1~0 (* 14 c_~a~0)) 4294967296)) (.cse53 (mod (+ c_~x_2~0 (* c_~b~0 13)) 4294967296)) (.cse55 (< .cse72 (+ .cse90 1))) (.cse39 (< .cse26 (+ .cse83 1))) (.cse43 (< .cse81 .cse26)) (.cse40 (mod (+ (* 9 c_~a~0) c_~x_1~0) 4294967296)) (.cse69 (< .cse72 (+ .cse98 1))) (.cse45 (mod (+ c_~x_1~0 (* 3 c_~a~0)) 4294967296)) (.cse71 (mod (+ c_~x_2~0 (* 2 c_~b~0)) 4294967296)) (.cse46 (< .cse26 (+ .cse97 1))) (.cse70 (< .cse96 .cse72)) (.cse47 (< .cse95 .cse26)) (.cse51 (< .cse94 .cse26)) (.cse52 (mod (+ c_~x_1~0 (* 13 c_~a~0)) 4294967296)) (.cse56 (< .cse26 (+ .cse91 1))) (.cse63 (< .cse85 .cse26)) (.cse58 (< .cse87 .cse72)) (.cse64 (< .cse26 (+ .cse93 1))) (.cse59 (< .cse72 (+ .cse92 1))) (.cse57 (mod (+ c_~x_2~0 (* 6 c_~b~0)) 4294967296)) (.cse66 (mod (+ c_~x_1~0 (* 7 c_~a~0)) 4294967296)) (.cse12 (< .cse26 (+ .cse89 1))) (.cse75 (< .cse72 (+ .cse88 1))) (.cse76 (mod (+ c_~x_2~0 (* c_~b~0 12)) 4294967296)) (.cse15 (mod (+ c_~x_1~0 (* 12 c_~a~0)) 4294967296)) (.cse16 (< .cse91 .cse26)) (.cse77 (< .cse90 .cse72)) (.cse19 (< .cse89 .cse26)) (.cse13 (< .cse88 .cse72)) (.cse23 (< .cse26 (+ .cse82 1))) (.cse14 (mod (+ c_~x_2~0 (* c_~b~0 11)) 4294967296)) (.cse22 (mod (+ c_~x_1~0 (* 11 c_~a~0)) 4294967296)) (.cse17 (< .cse72 (+ .cse86 1))) (.cse65 (mod (+ c_~x_2~0 (* 7 c_~b~0)) 4294967296)) (.cse67 (< .cse84 .cse72)) (.cse68 (< .cse72 (+ .cse87 1))) (.cse18 (< .cse72 (+ .cse74 1))) (.cse20 (< .cse86 .cse72)) (.cse21 (mod (+ c_~x_2~0 (* c_~b~0 10)) 4294967296)) (.cse41 (mod (+ (* c_~b~0 8) c_~x_2~0) 4294967296)) (.cse79 (mod (+ (* 8 c_~a~0) c_~x_1~0) 4294967296)) (.cse78 (< .cse26 (+ .cse85 1))) (.cse42 (< .cse73 .cse72)) (.cse44 (< .cse72 (+ .cse84 1))) (.cse80 (< .cse83 .cse26))) (and (or .cse0 .cse1 .cse2 (= .cse3 .cse4) .cse5) (or (= .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse13 (= .cse14 .cse15) .cse16 .cse17) (or .cse18 .cse19 .cse20 (= .cse21 .cse22) .cse23) (or .cse24 (= .cse25 (mod (+ c_~x_1~0 c_~a~0) 4294967296)) (< .cse26 (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) .cse27 (< .cse28 .cse26)) (or .cse24 .cse29 (= .cse25 .cse30) .cse27 .cse31) (or .cse32 .cse33 .cse34 .cse35 (= .cse36 .cse37)) (or (< (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse26) .cse33 (< .cse26 (+ .cse38 1)) .cse35 (= (mod (+ c_~x_1~0 (* 15 c_~a~0)) 4294967296) .cse37)) (or .cse39 (= .cse40 .cse41) .cse42 .cse43 .cse44) (or (= .cse45 .cse3) .cse46 .cse2 .cse47 .cse5) (or .cse0 .cse1 .cse48 (= .cse49 .cse4) .cse50) (or .cse51 (= .cse52 .cse53) .cse54 .cse55 .cse56) (or (= .cse57 .cse6) .cse58 .cse59 .cse8 .cse11) (or .cse9 .cse60 (= .cse61 .cse7) .cse62 .cse10) (or .cse63 .cse64 (= .cse65 .cse66) .cse67 .cse68) (or .cse69 .cse29 .cse70 (= .cse71 .cse30) .cse31) (or .cse48 (= .cse49 .cse61) .cse60 .cse62 .cse50) (or .cse32 .cse34 .cse54 (= .cse36 .cse53) .cse55) (or .cse39 (< .cse72 (+ .cse73 1)) (< .cse74 .cse72) .cse43 (= (mod (+ c_~x_2~0 (* 9 c_~b~0)) 4294967296) .cse40)) (or .cse69 (= .cse45 .cse71) .cse46 .cse70 .cse47) (or .cse51 .cse75 (= .cse76 .cse52) .cse77 .cse56) (or .cse63 .cse58 .cse64 .cse59 (= .cse57 .cse66)) (or .cse12 .cse75 (= .cse76 .cse15) .cse16 .cse77) (or .cse19 .cse13 .cse23 (= .cse14 .cse22) .cse17) (or .cse78 (= .cse79 .cse65) .cse67 .cse68 .cse80) (or .cse18 .cse20 (< .cse26 (+ .cse81 1)) (< .cse82 .cse26) (= .cse21 (mod (+ c_~x_1~0 (* 10 c_~a~0)) 4294967296))) (or (= .cse41 .cse79) .cse78 .cse42 .cse44 .cse80)))) is different from false [2024-12-17 06:30:13,778 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