./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ebd41074 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-2.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 c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-24 02:18:59,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-24 02:18:59,181 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-24 02:18:59,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-24 02:18:59,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-24 02:18:59,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-24 02:18:59,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-24 02:18:59,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-24 02:18:59,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-24 02:18:59,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-24 02:18:59,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-24 02:18:59,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-24 02:18:59,209 INFO L153 SettingsManager]: * Use SBE=true [2025-01-24 02:18:59,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-24 02:18:59,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-24 02:18:59,209 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-24 02:18:59,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-24 02:18:59,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-24 02:18:59,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-24 02:18:59,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-24 02:18:59,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-24 02:18:59,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-24 02:18:59,210 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-24 02:18:59,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-24 02:18:59,210 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-24 02:18:59,210 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-24 02:18:59,210 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-24 02:18:59,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-24 02:18:59,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-24 02:18:59,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-24 02:18:59,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-24 02:18:59,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-24 02:18:59,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-24 02:18:59,211 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-24 02:18:59,211 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-24 02:18:59,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-24 02:18:59,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-24 02:18:59,211 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-24 02:18:59,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-24 02:18:59,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-24 02:18:59,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-24 02:18:59,211 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-24 02:18:59,211 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-24 02:18:59,211 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 -> c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2025-01-24 02:18:59,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-24 02:18:59,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-24 02:18:59,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-24 02:18:59,458 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-24 02:18:59,458 INFO L274 PluginConnector]: CDTParser initialized [2025-01-24 02:18:59,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2025-01-24 02:19:00,540 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/e79c637e2/deff0f0855104fb8a3812cf7c5e64a2e/FLAGc4c010fd1 [2025-01-24 02:19:00,710 INFO L384 CDTParser]: Found 1 translation units. [2025-01-24 02:19:00,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2025-01-24 02:19:00,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/e79c637e2/deff0f0855104fb8a3812cf7c5e64a2e/FLAGc4c010fd1 [2025-01-24 02:19:01,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/e79c637e2/deff0f0855104fb8a3812cf7c5e64a2e [2025-01-24 02:19:01,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-24 02:19:01,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-24 02:19:01,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-24 02:19:01,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-24 02:19:01,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-24 02:19:01,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 02:19:01" (1/1) ... [2025-01-24 02:19:01,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2769b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:19:01, skipping insertion in model container [2025-01-24 02:19:01,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 02:19:01" (1/1) ... [2025-01-24 02:19:01,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-24 02:19:01,211 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/parallel-misc-2.wvr.c[2249,2262] [2025-01-24 02:19:01,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-24 02:19:01,221 INFO L200 MainTranslator]: Completed pre-run [2025-01-24 02:19:01,256 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/parallel-misc-2.wvr.c[2249,2262] [2025-01-24 02:19:01,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-24 02:19:01,266 INFO L204 MainTranslator]: Completed translation [2025-01-24 02:19:01,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:19:01 WrapperNode [2025-01-24 02:19:01,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-24 02:19:01,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-24 02:19:01,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-24 02:19:01,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-24 02:19:01,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:19:01" (1/1) ... [2025-01-24 02:19:01,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:19:01" (1/1) ... [2025-01-24 02:19:01,284 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-01-24 02:19:01,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-24 02:19:01,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-24 02:19:01,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-24 02:19:01,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-24 02:19:01,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:19:01" (1/1) ... [2025-01-24 02:19:01,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:19:01" (1/1) ... [2025-01-24 02:19:01,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:19:01" (1/1) ... [2025-01-24 02:19:01,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:19:01" (1/1) ... [2025-01-24 02:19:01,295 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:19:01" (1/1) ... [2025-01-24 02:19:01,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:19:01" (1/1) ... [2025-01-24 02:19:01,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:19:01" (1/1) ... [2025-01-24 02:19:01,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:19:01" (1/1) ... [2025-01-24 02:19:01,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:19:01" (1/1) ... [2025-01-24 02:19:01,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-24 02:19:01,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-24 02:19:01,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-24 02:19:01,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-24 02:19:01,305 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:19:01" (1/1) ... [2025-01-24 02:19:01,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-24 02:19:01,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:19:01,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-24 02:19:01,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-24 02:19:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-24 02:19:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-24 02:19:01,344 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-24 02:19:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-24 02:19:01,344 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-24 02:19:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-24 02:19:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-24 02:19:01,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-24 02:19:01,345 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-24 02:19:01,396 INFO L234 CfgBuilder]: Building ICFG [2025-01-24 02:19:01,397 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-24 02:19:01,521 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-24 02:19:01,522 INFO L283 CfgBuilder]: Performing block encoding [2025-01-24 02:19:01,640 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-24 02:19:01,640 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-24 02:19:01,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 02:19:01 BoogieIcfgContainer [2025-01-24 02:19:01,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-24 02:19:01,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-24 02:19:01,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-24 02:19:01,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-24 02:19:01,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 02:19:01" (1/3) ... [2025-01-24 02:19:01,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8a950b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 02:19:01, skipping insertion in model container [2025-01-24 02:19:01,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 02:19:01" (2/3) ... [2025-01-24 02:19:01,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8a950b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 02:19:01, skipping insertion in model container [2025-01-24 02:19:01,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 02:19:01" (3/3) ... [2025-01-24 02:19:01,649 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2025-01-24 02:19:01,660 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-24 02:19:01,661 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 29 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-24 02:19:01,662 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-24 02:19:01,701 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-24 02:19:01,733 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 02:19:01,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-24 02:19:01,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:19:01,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-24 02:19:01,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-24 02:19:01,790 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 02:19:01,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 02:19:01,809 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;@6a1afaec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 02:19:01,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-24 02:19:02,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:19:02,019 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:19:02,019 INFO L139 ounterexampleChecker]: Examining path program with hash -1112909302, occurence #1 [2025-01-24 02:19:02,019 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:19:02,020 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:19:02,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:19:02,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1464225346, now seen corresponding path program 1 times [2025-01-24 02:19:02,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:19:02,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680585545] [2025-01-24 02:19:02,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:19:02,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:19:02,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-24 02:19:02,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-24 02:19:02,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:19:02,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:19:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:19:02,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:19:02,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680585545] [2025-01-24 02:19:02,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680585545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 02:19:02,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 02:19:02,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-24 02:19:02,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074547021] [2025-01-24 02:19:02,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 02:19:02,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 02:19:02,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:19:02,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 02:19:02,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-24 02:19:02,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:19:02,349 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:19:02,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:19:02,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:19:02,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 02:19:02,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-24 02:19:02,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:19:02,445 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:19:02,445 INFO L139 ounterexampleChecker]: Examining path program with hash -687417324, occurence #1 [2025-01-24 02:19:02,445 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:19:02,445 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:19:02,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:19:02,446 INFO L85 PathProgramCache]: Analyzing trace with hash -910422195, now seen corresponding path program 1 times [2025-01-24 02:19:02,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:19:02,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484081389] [2025-01-24 02:19:02,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:19:02,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:19:02,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-24 02:19:02,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-24 02:19:02,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:19:02,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:19:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:19:02,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:19:02,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484081389] [2025-01-24 02:19:02,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484081389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 02:19:02,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 02:19:02,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-24 02:19:02,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907725542] [2025-01-24 02:19:02,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 02:19:02,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 02:19:02,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:19:02,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 02:19:02,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-24 02:19:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:19:02,658 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:19:02,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:19:02,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 02:19:02,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:19:02,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 02:19:02,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:19:02,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-24 02:19:02,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:19:02,730 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:19:02,730 INFO L139 ounterexampleChecker]: Examining path program with hash -1719521395, occurence #1 [2025-01-24 02:19:02,730 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:19:02,730 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:19:02,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:19:02,730 INFO L85 PathProgramCache]: Analyzing trace with hash 817022079, now seen corresponding path program 1 times [2025-01-24 02:19:02,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:19:02,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933291318] [2025-01-24 02:19:02,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:19:02,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:19:02,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-24 02:19:02,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-24 02:19:02,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:19:02,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:19:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-24 02:19:03,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:19:03,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933291318] [2025-01-24 02:19:03,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933291318] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 02:19:03,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989298990] [2025-01-24 02:19:03,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:19:03,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:19:03,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:19:03,188 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:19:03,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-24 02:19:03,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-24 02:19:03,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-24 02:19:03,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:19:03,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:19:03,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-24 02:19:03,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:19:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-24 02:19:03,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-24 02:19:03,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989298990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 02:19:03,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-24 02:19:03,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-01-24 02:19:03,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856266713] [2025-01-24 02:19:03,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 02:19:03,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 02:19:03,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:19:03,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 02:19:03,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-24 02:19:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:19:03,309 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:19:03,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:19:03,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 02:19:03,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:19:03,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:19:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 02:19:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:19:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:19:03,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-24 02:19:03,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:19:03,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:19:03,581 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:19:03,581 INFO L139 ounterexampleChecker]: Examining path program with hash 1282604392, occurence #1 [2025-01-24 02:19:03,581 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:19:03,581 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:19:03,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:19:03,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1024522145, now seen corresponding path program 1 times [2025-01-24 02:19:03,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:19:03,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125362739] [2025-01-24 02:19:03,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:19:03,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:19:03,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-24 02:19:03,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-24 02:19:03,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:19:03,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:19:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-24 02:19:03,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:19:03,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125362739] [2025-01-24 02:19:03,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125362739] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 02:19:03,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305255368] [2025-01-24 02:19:03,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 02:19:03,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:19:03,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:19:03,943 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-24 02:19:03,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-24 02:19:03,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-24 02:19:03,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-24 02:19:03,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 02:19:03,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:19:03,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-24 02:19:03,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:19:04,123 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-24 02:19:04,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 02:19:04,201 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-24 02:19:04,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305255368] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 02:19:04,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 02:19:04,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2025-01-24 02:19:04,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850620712] [2025-01-24 02:19:04,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 02:19:04,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-24 02:19:04,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:19:04,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-24 02:19:04,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-24 02:19:04,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:19:04,203 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:19:04,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:19:04,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 02:19:04,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:19:04,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:19:04,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:19:05,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 02:19:05,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:19:05,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:19:05,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-24 02:19:05,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-24 02:19:05,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:19:05,259 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:19:05,259 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:19:05,259 INFO L139 ounterexampleChecker]: Examining path program with hash 327941973, occurence #1 [2025-01-24 02:19:05,259 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:19:05,259 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:19:05,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:19:05,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2126736295, now seen corresponding path program 2 times [2025-01-24 02:19:05,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:19:05,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540536303] [2025-01-24 02:19:05,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 02:19:05,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:19:05,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-01-24 02:19:05,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-01-24 02:19:05,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-24 02:19:05,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:19:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-01-24 02:19:05,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:19:05,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540536303] [2025-01-24 02:19:05,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540536303] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 02:19:05,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075765693] [2025-01-24 02:19:05,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 02:19:05,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:19:05,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:19:05,732 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) [2025-01-24 02:19:05,734 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 [2025-01-24 02:19:05,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-01-24 02:19:06,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-01-24 02:19:06,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-24 02:19:06,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:19:06,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-24 02:19:06,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:19:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-24 02:19:06,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 02:19:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-24 02:19:07,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075765693] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 02:19:07,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 02:19:07,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 29 [2025-01-24 02:19:07,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597265958] [2025-01-24 02:19:07,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 02:19:07,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-24 02:19:07,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:19:07,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-24 02:19:07,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2025-01-24 02:19:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:19:07,235 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:19:07,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.379310344827586) internal successors, (214), 29 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:19:07,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 02:19:07,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:19:07,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:19:07,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-01-24 02:19:07,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:19:19,404 WARN L286 SmtUtils]: Spent 8.75s on a formula simplification. DAG size of input: 45 DAG size of output: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:19:32,530 WARN L286 SmtUtils]: Spent 9.34s on a formula simplification. DAG size of input: 60 DAG size of output: 40 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:19:34,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:20:06,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:20:08,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:20:15,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:20:27,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:20:56,167 WARN L286 SmtUtils]: Spent 6.02s on a formula simplification. DAG size of input: 57 DAG size of output: 32 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:20:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 02:20:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:20:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:20:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-24 02:20:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-01-24 02:20:56,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-24 02:20:56,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:20:56,380 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 02:20:56,380 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 02:20:56,380 INFO L139 ounterexampleChecker]: Examining path program with hash 2123748053, occurence #1 [2025-01-24 02:20:56,380 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 02:20:56,380 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 02:20:56,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 02:20:56,381 INFO L85 PathProgramCache]: Analyzing trace with hash 270988792, now seen corresponding path program 3 times [2025-01-24 02:20:56,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 02:20:56,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256023467] [2025-01-24 02:20:56,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-24 02:20:56,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 02:20:56,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 216 statements into 15 equivalence classes. [2025-01-24 02:20:56,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 216 of 216 statements. [2025-01-24 02:20:56,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-01-24 02:20:56,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:21:12,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 27 proven. 1087 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:21:12,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 02:21:12,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256023467] [2025-01-24 02:21:12,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256023467] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-24 02:21:12,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019237847] [2025-01-24 02:21:12,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-24 02:21:12,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-24 02:21:12,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 02:21:12,585 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) [2025-01-24 02:21:12,586 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 [2025-01-24 02:21:12,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 216 statements into 15 equivalence classes. [2025-01-24 02:21:14,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 216 of 216 statements. [2025-01-24 02:21:14,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-01-24 02:21:14,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 02:21:14,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-01-24 02:21:14,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-24 02:21:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 8 proven. 1108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:21:50,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-24 02:22:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 8 proven. 1108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 02:22:18,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019237847] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-24 02:22:18,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-24 02:22:18,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 49, 48] total 143 [2025-01-24 02:22:18,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815060977] [2025-01-24 02:22:18,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-24 02:22:18,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 143 states [2025-01-24 02:22:18,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 02:22:18,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2025-01-24 02:22:18,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2392, Invalid=17900, Unknown=14, NotChecked=0, Total=20306 [2025-01-24 02:22:18,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:22:18,990 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 02:22:18,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 143 states, 143 states have (on average 4.335664335664336) internal successors, (620), 143 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 02:22:18,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-24 02:22:18,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:22:18,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-24 02:22:18,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-01-24 02:22:18,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2025-01-24 02:22:18,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 02:22:57,192 WARN L286 SmtUtils]: Spent 6.72s on a formula simplification. DAG size of input: 57 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:23:03,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:23:05,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:23:13,287 WARN L286 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 70 DAG size of output: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:23:21,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:23:22,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:23:56,523 WARN L286 SmtUtils]: Spent 10.39s on a formula simplification. DAG size of input: 65 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:24:02,602 WARN L286 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 62 DAG size of output: 45 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:24:10,623 WARN L286 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 71 DAG size of output: 42 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:24:27,567 WARN L286 SmtUtils]: Spent 11.10s on a formula simplification. DAG size of input: 87 DAG size of output: 65 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:24:39,657 WARN L286 SmtUtils]: Spent 7.48s on a formula simplification. DAG size of input: 83 DAG size of output: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:24:41,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 [] [2025-01-24 02:24:58,130 WARN L286 SmtUtils]: Spent 8.64s on a formula simplification. DAG size of input: 80 DAG size of output: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:25:00,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:25:02,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:25:05,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:25:07,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:25:16,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:25:18,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:25:30,451 WARN L286 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 84 DAG size of output: 43 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:25:44,817 WARN L286 SmtUtils]: Spent 7.51s on a formula simplification. DAG size of input: 96 DAG size of output: 44 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:25:46,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:25:55,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:25:57,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:25:59,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:26:01,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:26:03,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:26:20,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:26:33,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:27:00,187 WARN L286 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 72 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:27:12,766 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification. DAG size of input: 69 DAG size of output: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:27:14,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:27:16,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:27:17,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:27:19,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:27:21,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:27:23,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:27:25,928 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse49 (+ c_~i1~0 1))) (let ((.cse7 (mod .cse49 2)) (.cse45 (mod (+ c_~i2~0 12) 4294967296)) (.cse33 (* 4294967295 c_~i2~0)) (.cse46 (mod (+ 5 c_~i2~0) 4294967296)) (.cse32 (* c_~N~0 2)) (.cse5 (mod c_~i1~0 2))) (let ((.cse2 (+ .cse32 .cse5)) (.cse11 (mod (+ c_~i1~0 20) 4294967296)) (.cse17 (mod (+ 23 c_~i2~0) 4294967296)) (.cse26 (mod (+ c_~i2~0 17) 4294967296)) (.cse10 (mod (+ c_~i2~0 11) 4294967296)) (.cse19 (mod (+ c_~i1~0 18) 4294967296)) (.cse8 (mod (+ c_~i2~0 20) 4294967296)) (.cse15 (mod c_~i1~0 4294967296)) (.cse20 (mod (+ 21 c_~i2~0) 4294967296)) (.cse31 (mod (+ c_~i1~0 14) 4294967296)) (.cse29 (mod (+ c_~i1~0 4) 4294967296)) (.cse14 (+ .cse46 .cse5 1)) (.cse25 (mod (+ c_~i1~0 15) 4294967296)) (.cse37 (mod (+ 7 c_~i2~0) 4294967296)) (.cse27 (mod (+ c_~i1~0 12) 4294967296)) (.cse22 (mod (+ 14 c_~i2~0) 4294967296)) (.cse40 (mod (+ c_~i2~0 18) 4294967296)) (.cse41 (mod (+ c_~i1~0 16) 4294967296)) (.cse13 (mod (+ c_~i1~0 2) 4294967296)) (.cse9 (mod (+ c_~i1~0 7) 4294967296)) (.cse4 (mod (+ c_~i2~0 10) 4294967296)) (.cse23 (mod (+ c_~i1~0 10) 4294967296)) (.cse0 (mod (+ .cse32 .cse33 1) 4294967296)) (.cse21 (mod (+ c_~i1~0 11) 4294967296)) (.cse44 (mod (+ c_~i2~0 13) 4294967296)) (.cse6 (mod (+ c_~i1~0 17) 4294967296)) (.cse42 (mod (+ 19 c_~i2~0) 4294967296)) (.cse38 (mod (+ c_~i1~0 19) 4294967296)) (.cse12 (mod (+ 22 c_~i2~0) 4294967296)) (.cse16 (mod (+ 3 c_~i2~0) 4294967296)) (.cse35 (mod (+ c_~i1~0 8) 4294967296)) (.cse24 (+ .cse45 .cse5 1)) (.cse1 (* (div c_~N~0 2147483648) 4294967296)) (.cse18 (mod (+ .cse32 5 .cse33) 4294967296)) (.cse34 (+ .cse7 .cse32)) (.cse36 (mod (+ c_~i1~0 5) 4294967296)) (.cse30 (mod (+ 6 c_~i2~0) 4294967296)) (.cse47 (mod .cse49 4294967296)) (.cse43 (mod (+ c_~i2~0 4) 4294967296)) (.cse3 (mod (+ c_~i1~0 6) 4294967296)) (.cse28 (mod (+ 15 c_~i2~0) 4294967296)) (.cse48 (mod (+ c_~i1~0 13) 4294967296)) (.cse39 (mod (+ 16 c_~i2~0) 4294967296))) (and (<= (+ .cse0 .cse1 (mod (+ c_~i1~0 4294967289) 4294967296) 6) .cse2) (< .cse3 (+ .cse4 .cse5 1)) (< .cse6 (+ .cse7 .cse8 1)) (< .cse9 (+ .cse7 .cse10 1)) (< .cse11 (+ .cse12 .cse5 1)) (< .cse13 .cse14) (< .cse15 (+ .cse16 .cse5 1)) (< (mod (+ c_~i1~0 21) 4294967296) (+ .cse7 .cse17 1)) (<= (+ .cse1 .cse18 (mod (+ c_~i1~0 4294967285) 4294967296) 6) .cse2) (< .cse19 (+ .cse20 .cse5 1)) (< .cse21 (+ .cse7 .cse22 1)) (< .cse11 (+ .cse5 .cse17 1)) (< .cse23 .cse24) (< .cse25 (+ .cse7 .cse26 1)) (< .cse3 (+ (mod (+ 8 c_~i2~0) 4294967296) .cse5 1)) (< .cse27 (+ .cse28 .cse5 1)) (< .cse29 (+ .cse30 .cse5 1)) (< .cse31 (+ .cse26 .cse5 1)) (<= (+ .cse1 (mod (+ c_~i1~0 4294967288) 4294967296) 6 (mod (+ .cse32 3 .cse33) 4294967296)) .cse34) (< .cse35 (+ .cse10 .cse5 1)) (< .cse36 (+ .cse7 .cse37 1)) (< .cse19 (+ .cse8 .cse5 1)) (< .cse15 (+ .cse5 (mod (+ 2 c_~i2~0) 4294967296) 1)) (< .cse38 (+ .cse7 .cse20 1)) (< .cse31 (+ .cse39 .cse5 1)) (< .cse29 .cse14) (< .cse25 (+ .cse40 .cse7 1)) (< .cse3 (+ .cse5 .cse37 1)) (< .cse27 (+ .cse22 .cse5 1)) (<= (+ .cse1 (mod (+ .cse32 6 .cse33) 4294967296) 6 (mod (+ c_~i1~0 4294967284) 4294967296)) .cse34) (< .cse41 (+ .cse40 .cse5 1)) (< .cse41 (+ .cse42 .cse5 1)) (< .cse13 (+ .cse5 .cse43 1)) (< .cse9 (+ .cse7 .cse4 1)) (< .cse23 (+ .cse44 .cse5 1)) (<= (+ .cse0 .cse1 6 (mod (+ c_~i1~0 4294967290) 4294967296)) .cse34) (< (mod (+ c_~i1~0 9) 4294967296) (+ .cse7 .cse45 1)) (< .cse21 (+ .cse7 .cse44 1)) (< .cse6 (+ .cse7 .cse42 1)) (< (mod (+ c_~i1~0 3) 4294967296) (+ .cse7 .cse46 1)) (< .cse38 (+ .cse7 .cse12 1)) (< .cse47 (+ .cse7 .cse16 1)) (< .cse35 .cse24) (<= (+ .cse1 .cse18 6 (mod (+ c_~i1~0 4294967286) 4294967296)) .cse34) (< .cse36 (+ .cse7 .cse30 1)) (< .cse47 (+ .cse7 .cse43 1)) (< .cse3 (+ (mod (+ 9 c_~i2~0) 4294967296) .cse5 1)) (< .cse48 (+ .cse7 .cse28 1)) (< .cse48 (+ .cse7 .cse39 1)))))) is different from false [2025-01-24 02:27:27,939 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_~i1~0 1))) (let ((.cse7 (mod .cse9 2)) (.cse0 (* c_~N~0 2)) (.cse6 (mod c_~i1~0 2))) (let ((.cse3 (+ .cse0 .cse6)) (.cse4 (mod c_~i2~0 4294967296)) (.cse1 (* 4294967295 c_~i2~0)) (.cse2 (* (div c_~N~0 2147483648) 4294967296)) (.cse8 (+ .cse7 .cse0)) (.cse5 (mod (+ c_~i1~0 6) 4294967296))) (and (<= (+ (mod (+ .cse0 .cse1 1) 4294967296) .cse2 (mod (+ c_~i1~0 4294967289) 4294967296) 6) .cse3) (<= (+ .cse2 .cse4 1) .cse0) (< .cse5 (+ (mod (+ c_~i2~0 10) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 17) 4294967296) (+ .cse7 (mod (+ c_~i2~0 20) 4294967296) 1)) (< (mod (+ c_~i1~0 7) 4294967296) (+ .cse7 (mod (+ c_~i2~0 11) 4294967296) 1)) (< (mod c_~i1~0 4294967296) (+ (mod (+ 3 c_~i2~0) 4294967296) .cse6 1)) (<= (+ .cse2 (mod (+ .cse0 5 .cse1) 4294967296) (mod (+ c_~i1~0 4294967285) 4294967296) 6) .cse3) (< (mod (+ c_~i1~0 18) 4294967296) (+ (mod (+ 21 c_~i2~0) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 11) 4294967296) (+ .cse7 (mod (+ 14 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 20) 4294967296) (+ .cse6 (mod (+ 23 c_~i2~0) 4294967296) 1)) (<= (+ 5 (mod (+ c_~i1~0 4294967291) 4294967296)) (+ .cse4 .cse6)) (< .cse5 (+ (mod (+ 8 c_~i2~0) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 12) 4294967296) (+ (mod (+ 15 c_~i2~0) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 4) 4294967296) (+ (mod (+ 6 c_~i2~0) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 14) 4294967296) (+ (mod (+ c_~i2~0 17) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 15) 4294967296) (+ (mod (+ c_~i2~0 18) 4294967296) .cse7 1)) (< .cse5 (+ .cse6 (mod (+ 7 c_~i2~0) 4294967296) 1)) (<= (+ .cse2 (mod (+ .cse0 6 .cse1) 4294967296) 6 (mod (+ c_~i1~0 4294967284) 4294967296)) .cse8) (< (mod (+ c_~i1~0 16) 4294967296) (+ (mod (+ 19 c_~i2~0) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 10) 4294967296) (+ (mod (+ c_~i2~0 13) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 9) 4294967296) (+ .cse7 (mod (+ c_~i2~0 12) 4294967296) 1)) (< (mod (+ c_~i1~0 3) 4294967296) (+ .cse7 (mod (+ 5 c_~i2~0) 4294967296) 1)) (<= (+ (mod (+ .cse0 4294967295 .cse1) 4294967296) .cse2 5 (mod (+ c_~i1~0 4294967292) 4294967296)) .cse8) (< (mod (+ c_~i1~0 19) 4294967296) (+ .cse7 (mod (+ 22 c_~i2~0) 4294967296) 1)) (< (mod .cse9 4294967296) (+ .cse7 (mod (+ c_~i2~0 4) 4294967296) 1)) (< .cse5 (+ (mod (+ 9 c_~i2~0) 4294967296) .cse6 1)) (< (mod (+ c_~i1~0 13) 4294967296) (+ .cse7 (mod (+ 16 c_~i2~0) 4294967296) 1)))))) is different from false [2025-01-24 02:27:29,951 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~i1~0 1))) (let ((.cse2 (mod .cse10 2)) (.cse5 (* c_~N~0 2)) (.cse8 (mod (+ c_~i2~0 12) 4294967296)) (.cse9 (mod (+ 5 c_~i2~0) 4294967296)) (.cse0 (mod c_~i1~0 2))) (let ((.cse1 (+ .cse9 .cse0 1)) (.cse3 (+ .cse8 .cse0 1)) (.cse4 (* (div c_~N~0 2147483648) 4294967296)) (.cse6 (* 4294967295 c_~i2~0)) (.cse7 (+ .cse2 .cse5))) (and (< (mod (+ c_~i1~0 20) 4294967296) (+ (mod (+ 22 c_~i2~0) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 2) 4294967296) .cse1) (< (mod (+ c_~i1~0 21) 4294967296) (+ .cse2 (mod (+ 23 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 10) 4294967296) .cse3) (< (mod (+ c_~i1~0 15) 4294967296) (+ .cse2 (mod (+ c_~i2~0 17) 4294967296) 1)) (<= (+ .cse4 (mod (+ c_~i1~0 4294967288) 4294967296) 6 (mod (+ .cse5 3 .cse6) 4294967296)) .cse7) (< (mod (+ c_~i1~0 18) 4294967296) (+ (mod (+ c_~i2~0 20) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 19) 4294967296) (+ .cse2 (mod (+ 21 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 14) 4294967296) (+ (mod (+ 16 c_~i2~0) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 4) 4294967296) .cse1) (< (mod (+ c_~i1~0 12) 4294967296) (+ (mod (+ 14 c_~i2~0) 4294967296) .cse0 1)) (<= (+ .cse4 (mod (+ .cse5 6 .cse6) 4294967296) 6 (mod (+ c_~i1~0 4294967284) 4294967296)) .cse7) (< (mod (+ c_~i1~0 16) 4294967296) (+ (mod (+ c_~i2~0 18) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 7) 4294967296) (+ .cse2 (mod (+ c_~i2~0 10) 4294967296) 1)) (<= (+ (mod (+ .cse5 .cse6 1) 4294967296) .cse4 6 (mod (+ c_~i1~0 4294967290) 4294967296)) .cse7) (< (mod (+ c_~i1~0 9) 4294967296) (+ .cse2 .cse8 1)) (< (mod (+ c_~i1~0 11) 4294967296) (+ .cse2 (mod (+ c_~i2~0 13) 4294967296) 1)) (< (mod (+ c_~i1~0 17) 4294967296) (+ .cse2 (mod (+ 19 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 3) 4294967296) (+ .cse2 .cse9 1)) (< (mod .cse10 4294967296) (+ .cse2 (mod (+ 3 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 8) 4294967296) .cse3) (<= (+ .cse4 (mod (+ .cse5 5 .cse6) 4294967296) 6 (mod (+ c_~i1~0 4294967286) 4294967296)) .cse7) (< (mod (+ c_~i1~0 5) 4294967296) (+ .cse2 (mod (+ 6 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 6) 4294967296) (+ (mod (+ 9 c_~i2~0) 4294967296) .cse0 1)) (< (mod (+ c_~i1~0 13) 4294967296) (+ .cse2 (mod (+ 15 c_~i2~0) 4294967296) 1)))))) is different from false [2025-01-24 02:31:16,083 WARN L286 SmtUtils]: Spent 54.07s on a formula simplification. DAG size of input: 123 DAG size of output: 123 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-24 02:33:36,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 [] [2025-01-24 02:33:38,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-24 02:33:40,943 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